|
Vieta Jumping
In number theory, Vieta jumping, also known as root flipping, is a proof technique. It is most often used for problems in which a relation between two integers is given, along with a statement to prove about its solutions. In particular, it can be used to produce new solutions of a Diophantine equation from known ones. There exist multiple variations of Vieta jumping, all of which involve the common theme of infinite descent by finding new solutions to an equation using Vieta's formulas. History Vieta jumping is a classical method in the theory of quadratic Diophantine equations and binary quadratic forms. For example, it was used in the analysis of Markov equation back in 1879 and in the 1953 paper of Mills. In 1988, the method came to the attention to mathematical olympiad problems in the light of the first olympiad problem to use it in a solution that was proposed for the International Mathematics Olympiad and assumed to be the most difficult problem on the contest: :Let and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Number Theory
Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic function, integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics."German original: "Die Mathematik ist die Königin der Wissenschaften, und die Arithmetik ist die Königin der Mathematik." Number theorists study prime numbers as well as the properties of mathematical objects made out of integers (for example, rational numbers) or defined as generalizations of the integers (for example, algebraic integers). Integers can be considered either in themselves or as solutions to equations (Diophantine geometry). Questions in number theory are often best understood through the study of Complex analysis, analytical objects (for example, the Riemann zeta function) that encode properties of the integers, primes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ngô Bảo Châu
Ngô Bảo Châu (, born June 28, 1972) is a Vietnamese-French mathematician at the University of Chicago, best known for proving the fundamental lemma for automorphic forms (proposed by Robert Langlands and Diana Shelstad). He is the first Vietnamese national to have received the Fields Medal. Early life Ngô Bảo Châu was born in 1972, the son of an intellectual family in Hanoi, North Vietnam. His father, professor Ngô Huy Cẩn, is full professor of physics at the Vietnam National Institute of Mechanics. His mother, Trần Lưu Vân Hiền, is a physician and associate professor at an herbal medicine hospital in Hanoi. The beginning of Châu's schooling was at an experimental elementary school that had been founded by the revolutionary pedagogue Hồ Ngọc Đại, but when his father returned from the Soviet Union with his doctoral degree, he decided that Châu would learn more in traditional schools and enrolled him in the "chuyên toán" (special classes for gifted s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brilliant
Brilliant may refer to: Music * ''Brilliant'' (album), a 2012 album by Ultravox *Brilliant (band), a British pop/rock group active in the 1980s * "Brilliant" (song), a song by D'espairsRay *Brilliant Classics, Dutch classical music record label *''Brilliant!'', a 1989 album by Kym Mazelle Places *Brilliant, British Columbia, a community in Canada *Brilliant, Alabama, a town in the U.S. * Brilliant, New Mexico *Brilliant, Ohio, a town in the U.S. Ships * ''Brilliant'' (schooner), a schooner at Mystic Seaport in Mystic, Connecticut * * – one of nine vessels by that name * – one of two vessels by that name Other uses * Brilliant.org, an educational website *Brilliant (diamond cut) *brilliant (typography), the typographic size between diamond and excelsior * ''Brilliant'' (film), a 2004 TV film *'' Brilliant!'', 1995/96 art show of Young British Artists in Minneapolis and Houston *''The Fast Show'' or ''Brilliant!'', a BBC series *Brilliant, a 1950s cartoon character in the ''Di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Apollonian Gasket
In mathematics, an Apollonian gasket or Apollonian net is a fractal generated by starting with a triple of circles, each tangent to the other two, and successively filling in more circles, each tangent to another three. It is named after Greek mathematician Apollonius of Perga. Construction The construction of the Apollonian gasket starts with three circles C_1, C_2, and C_3 (black in the figure), that are each tangent to the other two, but that do not have a single point of triple tangency. These circles may be of different sizes to each other, and it is allowed for two to be inside the third, or for all three to be outside each other. As Apollonius discovered, there exist two more circles C_4 and C_5 (red) that are tangent to all three of the original circles – these are called ''Apollonian circles''. These five circles are separated from each other by six curved triangular regions, each bounded by the arcs from three pairwise-tangent circles. The construction continues b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Markov Number
A Markov number or Markoff number is a positive integer ''x'', ''y'' or ''z'' that is part of a solution to the Markov Diophantine equation :x^2 + y^2 + z^2 = 3xyz,\, studied by . The first few Markov numbers are : 1, 2, 5, 13, 29, 34, 89, 169, 194, 233, 433, 610, 985, 1325, ... appearing as coordinates of the Markov triples :(1, 1, 1), (1, 1, 2), (1, 2, 5), (1, 5, 13), (2, 5, 29), (1, 13, 34), (1, 34, 89), (2, 29, 169), (5, 13, 194), (1, 89, 233), (5, 29, 433), (1, 233, 610), (2, 169, 985), (13, 34, 1325), ... There are infinitely many Markov numbers and Markov triples. Markov tree There are two simple ways to obtain a new Markov triple from an old one (''x'', ''y'', ''z''). First, one may permute the 3 numbers ''x'',''y'',''z'', so in particular one can normalize the triples so that ''x'' ≤ ''y'' ≤ ''z''. Second, if (''x'', ''y'', ''z'') is a Markov triple then by Vieta jumping so is (''x'', ''y'', 3''xy''&n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Infinite Descent
In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction used to show that a statement cannot possibly hold for any number, by showing that if the statement were to hold for a number, then the same would be true for a smaller number, leading to an infinite descent and ultimately a contradiction. It is a method which relies on the well-ordering principle, and is often used to show that a given equation, such as a Diophantine equation, has no solutions. Typically, one shows that if a solution to a problem existed, which in some sense was related to one or more natural numbers, it would necessarily imply that a second solution existed, which was related to one or more 'smaller' natural numbers. This in turn would imply a third solution related to smaller natural numbers, implying a fourth solution, therefore a fifth solution, and so on. However, there cannot be an infinity of ever-smaller natural numbers, and t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proof By Contradiction
In logic and mathematics, proof by contradiction is a form of proof that establishes the truth or the validity of a proposition, by showing that assuming the proposition to be false leads to a contradiction. Proof by contradiction is also known as indirect proof, proof by assuming the opposite, and ''reductio ad impossibile''. It is an example of the weaker logical refutation ''reductio ad absurdum''. A mathematical proof employing proof by contradiction usually proceeds as follows: #The proposition to be proved is ''P''. #We assume ''P'' to be false, i.e., we assume ''¬P''. #It is then shown that ''¬P'' implies falsehood. This is typically accomplished by deriving two mutually contradictory assertions, ''Q'' and ''¬Q'', and appealing to the Law of noncontradiction. #Since assuming ''P'' to be false leads to a contradiction, it is concluded that ''P'' is in fact true. An important special case is the existence proof by contradiction: in order to demonstrate the existence of an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperbolas
In mathematics, a hyperbola (; pl. hyperbolas or hyperbolae ; adj. hyperbolic ) is a type of smooth function, smooth plane curve, curve lying in a plane, defined by its geometric properties or by equations for which it is the solution set. A hyperbola has two pieces, called Component (graph theory), connected components or branches, that are mirror images of each other and resemble two infinite bow (weapon), bows. The hyperbola is one of the three kinds of conic section, formed by the intersection of a plane (mathematics), plane and a double cone (geometry), cone. (The other conic sections are the parabola and the ellipse. A circle is a special case of an ellipse.) If the plane intersects both halves of the double cone but does not pass through the apex of the cones, then the conic is a hyperbola. Hyperbolas arise in many ways: * as the curve representing the multiplicative inverse, reciprocal function y(x) = 1/x in the Cartesian coordinate system, Cartesian plane, * as the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Without Loss Of Generality
''Without loss of generality'' (often abbreviated to WOLOG, WLOG or w.l.o.g.; less commonly stated as ''without any loss of generality'' or ''with no loss of generality'') is a frequently used expression in mathematics. The term is used to indicate the assumption that follows is chosen arbitrarily, narrowing the premise to a particular case, but does not affect the validity of the proof in general. The other cases are sufficiently similar to the one presented that proving them follows by essentially the same logic. As a result, once a proof is given for the particular case, it is trivial to adapt it to prove the conclusion in all other cases. In many scenarios, the use of "without loss of generality" is made possible by the presence of symmetry. For example, if some property ''P''(''x'',''y'') of real numbers is known to be symmetric in ''x'' and ''y'', namely that ''P''(''x'',''y'') is equivalent to ''P''(''y'',''x''), then in proving that ''P''(''x'',''y'') holds for every ''x'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Number
In mathematics, a square number or perfect square is an integer that is the square (algebra), square of an integer; in other words, it is the multiplication, product of some integer with itself. For example, 9 is a square number, since it equals and can be written as . The usual notation for the square of a number is not the product , but the equivalent exponentiation , usually pronounced as " squared". The name ''square'' number comes from the name of the shape. The unit of area is defined as the area of a unit square (). Hence, a square with side length has area . If a square number is represented by ''n'' points, the points can be arranged in rows as a square each side of which has the same number of points as the square root of ''n''; thus, square numbers are a type of figurate numbers (other examples being Cube (algebra), cube numbers and triangular numbers). Square numbers are non-negative. A non-negative integer is a square number when its square root is again an intege ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proof By Contradiction
In logic and mathematics, proof by contradiction is a form of proof that establishes the truth or the validity of a proposition, by showing that assuming the proposition to be false leads to a contradiction. Proof by contradiction is also known as indirect proof, proof by assuming the opposite, and ''reductio ad impossibile''. It is an example of the weaker logical refutation ''reductio ad absurdum''. A mathematical proof employing proof by contradiction usually proceeds as follows: #The proposition to be proved is ''P''. #We assume ''P'' to be false, i.e., we assume ''¬P''. #It is then shown that ''¬P'' implies falsehood. This is typically accomplished by deriving two mutually contradictory assertions, ''Q'' and ''¬Q'', and appealing to the Law of noncontradiction. #Since assuming ''P'' to be false leads to a contradiction, it is concluded that ''P'' is in fact true. An important special case is the existence proof by contradiction: in order to demonstrate the existence of an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nicușor Dan
Nicușor Dan (born 20 December 1969) is a Romanian activist, mathematician, former member of the Chamber of Deputies of Romania as well as former founder and leader of the centre-right Romanian political party Save Romania Union (USR). He is currently serving as the Mayor of Bucharest following the 2020 Romanian local elections. Biography Born in Făgăraș, Brașov County, he attended the Radu Negru High School in his native city. He won first prizes in the International Mathematical Olympiads in 1987 and 1988 with perfect scores. Dan moved to Bucharest at the age of 18 and began studying mathematics at the University of Bucharest. In 1992, he moved to France to continue studying mathematics: he followed the courses of the École Normale Supérieure, one of the most prestigious French ''grande écoles'', where he gained a master's degree. In 1998 Dan completed a PhD in mathematics at Paris 13 University, with thesis "Courants de Green et prolongement méromorphe" written unde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Hyperbolas")
