|
Congruent Number
In number theory, a congruent number is a positive integer that is the area of a right triangle with three rational number sides. A more general definition includes all positive rational numbers with this property. The sequence of (integer) congruent numbers starts with :5, 6, 7, 13, 14, 15, 20, 21, 22, 23, 24, 28, 29, 30, 31, 34, 37, 38, 39, 41, 45, 46, 47, 52, 53, 54, 55, 56, 60, 61, 62, 63, 65, 69, 70, 71, 77, 78, 79, 80, 84, 85, 86, 87, 88, 92, 93, 94, 95, 96, 101, 102, 103, 109, 110, 111, 112, 116, 117, 118, 119, 120, ... For example, 5 is a congruent number because it is the area of a (20/3, 3/2, 41/6) triangle. Similarly, 6 is a congruent number because it is the area of a (3,4,5) triangle. 3 and 4 are not congruent numbers. The triangle sides demonstrating a number is congruent can have very large numerators and denominators, for example 263 is the area of a triangle whose two shortest sides are 16277526249841969031325182370950195/2303229894605810399672144140263708 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fermat's Right Triangle Theorem
Fermat's right triangle theorem is a non-existence mathematical proof, proof in number theory, published in 1670 among the works of Pierre de Fermat, soon after his death. It is the only complete proof given by Fermat. It has many equivalent formulations, one of which was stated (but not proved) in 1225 by Fibonacci. In its geometry, geometric forms, it states: *A right triangle in the Euclidean plane for which all three side lengths are rational numbers cannot have an area that is the square (algebra), square of a rational number. The area of a rational-sided right triangle is called a congruent number, so no congruent number can be square. *A right triangle and a square with equal areas cannot have all sides Commensurability (mathematics), commensurate with each other. *There do not exist two Pythagorean triple, integer-sided right triangles in which the two legs of one triangle are the leg and hypotenuse of the other triangle. More abstractly, as a result about Diophantine equa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Congruum
In number theory, a congruum (plural ''congrua'') is the difference between successive square numbers in an arithmetic progression of three squares. The congruum problem is the problem of finding squares in arithmetic progression and their associated congrua. It can be formalized as a Diophantine equation. Fibonacci solved the congruum problem by finding a parameterized formula for generating all congrua, together with their associated arithmetic progressions. According to this formula, each congruum is four times the area of a Pythagorean triangle, a right triangle whose sides are integers. Congrua are also closely connected with congruent numbers, the areas of right triangles whose sides are rational numbers. Every congruum is a congruent number, and every congruent number is a congruum multiplied by the square of a rational number. Fibonacci claimed without proof that it is impossible for a congruum to be a square number. This was later proven by Pierre de Fermat as Fermat's r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
If And Only If
In logic and related fields such as mathematics and philosophy, "if and only if" (often shortened as "iff") is paraphrased by the biconditional, a logical connective between statements. The biconditional is true in two cases, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence), and can be likened to the standard material conditional ("only if", equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other (i.e. either both statements are true, or both are false), though it is controversial whether the connective thus defined is properly rendered by the English "if and only if"—with its pre-existing meaning. For example, ''P if and only if Q'' means that ''P'' is true whenever ''Q'' is true, and the only case in which ''P'' is true is if ''Q'' is also true, whereas in the case of ''P if Q ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alice Silverberg
Alice Silverberg (born 1958) is professor of Mathematics and Computer Science at the University of California, Irvine. She was faculty at the Ohio State University from 1984 through 2004. She has given over 300 lectures at universities around the world, and she has brought attention to issues of sexism and discrimination through her blog ''Alice's Adventures in Numberland''. Research Silverberg's research concerns number theory and cryptography. With Karl Rubin, she introduced the CEILIDH system for torus-based cryptography in 2003, and she currently holds 10 patents related to cryptography. She is also known for her work on theoretical aspects of abelian varieties. Education and career Silverberg graduated from Harvard University in 1979, and received her Ph.D. from Princeton University in 1984 under the supervision of Goro Shimura. She began her academic career at Ohio State University in 1984 and became a full professor in 1996. She moved to the University of California ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inventiones Mathematicae
''Inventiones Mathematicae'' is a mathematical journal published monthly by Springer Science+Business Media. It was established in 1966 and is regarded as one of the most prestigious mathematics journals in the world. The current (2023) managing editors are Jean-Benoît Bost (University of Paris-Sud) and Wilhelm Schlag (Yale University Yale University is a Private university, private Ivy League research university in New Haven, Connecticut, United States. Founded in 1701, Yale is the List of Colonial Colleges, third-oldest institution of higher education in the United Stat ...). Abstracting and indexing The journal is abstracted and indexed in: References External links *{{Official website, https://www.springer.com/journal/222 Mathematics journals Academic journals established in 1966 English-language journals Springer Science+Business Media academic journals Monthly journals ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
History Of The Theory Of Numbers
''History of the Theory of Numbers'' is a three-volume work by Leonard Eugene Dickson summarizing work in number theory up to about 1920. The style is unusual in that Dickson mostly just lists results by various authors, with little further discussion. The central topic of quadratic reciprocity and higher reciprocity laws is barely mentioned; this was apparently going to be the topic of a fourth volume that was never written . Volumes * Volume 1 - Divisibility In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a ''Multiple (mathematics), multiple'' of m. An integer n is divis ... and Primality - 486 pages * Volume 2 - Diophantine Analysis - 803 pages * Volume 3 - Quadratic and Higher Forms - 313 pages References * * * * * * * * * * * * External links History of the Theory of Numbers - Volume 1at the Internet Archive. History of the Theory of Nu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Arithmetic
In mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book '' Disquisitiones Arithmeticae'', published in 1801. A familiar example of modular arithmetic is the hour hand on a 12-hour clock. If the hour hand points to 7 now, then 8 hours later it will point to 3. Ordinary addition would result in , but 15 reads as 3 on the clock face. This is because the hour hand makes one rotation every 12 hours and the hour number starts over when the hour hand passes 12. We say that 15 is ''congruent'' to 3 modulo 12, written 15 ≡ 3 (mod 12), so that 7 + 8 ≡ 3 (mod 12). Similarly, if one starts at 12 and waits 8 hours, the hour hand will be at 8. If one instead waited twice as long, 16 hours, the hour hand would be on 4. This ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorization, factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow primality test, method of checking the primality of a given number , called trial division, tests whether is a multiple of any integer between 2 and . Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dirichlet's Theorem On Arithmetic Progressions
In number theory, Dirichlet's theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers ''a'' and ''d'', there are infinitely many primes of the form ''a'' + ''nd'', where ''n'' is also a positive integer. In other words, there are infinitely many primes that are congruent to ''a'' modulo ''d''. The numbers of the form ''a'' + ''nd'' form an arithmetic progression :a,\ a+d,\ a+2d,\ a+3d,\ \dots,\ and Dirichlet's theorem states that this sequence contains infinitely many prime numbers. The theorem extends Euclid's theorem that there are infinitely many prime numbers (of the form 1 + 2n). Stronger forms of Dirichlet's theorem state that for any such arithmetic progression, the sum of the reciprocals of the prime numbers in the progression diverges and that different such arithmetic progressions with the same modulus have approximately the same proportions of primes. Equivalently, the primes are evenly dis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Point
In number theory and algebraic geometry, a rational point of an algebraic variety is a point whose coordinates belong to a given field. If the field is not mentioned, the field of rational numbers is generally understood. If the field is the field of real numbers, a rational point is more commonly called a real point. Understanding rational points is a central goal of number theory and Diophantine geometry. For example, Fermat's Last Theorem may be restated as: for , the Fermat curve of equation x^n+y^n=1 has no other rational points than , , and, if is even, and . Definition Given a field , and an algebraically closed extension of , an affine variety over is the set of common zeros in of a collection of polynomials with coefficients in : :\begin & f_1(x_1,\ldots,x_n)=0, \\ & \qquad \quad \vdots \\ & f_r(x_1,\dots,x_n)=0. \end These common zeros are called the ''points'' of . A -rational point (or -point) of is a point of that belongs to , that is, a sequence (a_1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
One-to-one Correspondence
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set. A function is bijective if it is invertible; that is, a function f:X\to Y is bijective if and only if there is a function g:Y\to X, the ''inverse'' of , such that each of the two ways for composing the two functions produces an identity function: g(f(x)) = x for each x in X and f(g(y)) = y for each y in Y. For example, the ''multiplication by two'' defines a bijection from the integers to the even numbers, which has the ''division by two'' as its inverse function. A function is bijective if and only if it is both injective (or ''one-to-one'')—meaning that each element in the codomain is mapped f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
