|
Erdős–Moser Equation
In number theory, the Erdős–Moser equation is :1^k+2^k+\cdots+m^k=(m+1)^k, where m and k are positive integers. The only known solution is 11 + 21 = 31, and Paul Erdős conjectured that no further solutions exist. Constraints on solutions Leo Moser in 1953 proved that, in any further solutions, 2 must divide ''k'' and that ''m'' ≥ 101,000,000. In 1966, it was shown that 6 ≤ ''k'' + 2 1.485 × 109,321,155. In 2002, it was shown that all primes between 200 and 1000 must divide ''k''. In 2009, it was shown that 2''k'' / (2''m'' – 3) must be a convergent (continued fraction), convergent of Natural logarithm of 2, ln(2); large-scale computation of ln(2) was then used to show that ''m'' > 2.7139 × 101,667,658,416. References {{DEFAULTSORT:Erdős-Moser equation Diophantine equations Paul Erdős, Moser equation Unsolved problems in number theory ... [...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] |
Integers
An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign (−1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language of mathematics, the set of integers is often denoted by the boldface or blackboard bold \mathbb. The set of natural numbers \mathbb is a subset of \mathbb, which in turn is a subset of the set of all rational numbers \mathbb, itself a subset of the real numbers \mathbb. Like the natural numbers, \mathbb is Countable set, countably infinite. An integer may be regarded as a real number that can be written without a fraction, fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , and are not. The integers form the smallest Group (mathematics), group and the smallest ring (mathematics), ring containing the natural numbers. In algebraic number theory, the integers are sometimes qualified as rational integers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paul Erdős
Paul Erdős ( hu, Erdős Pál ; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set theory, and probability theory. Much of his work centered around discrete mathematics, cracking many previously unsolved problems in the field. He championed and contributed to Ramsey theory, which studies the conditions in which order necessarily appears. Overall, his work leaned towards solving previously open problems, rather than developing or exploring new areas of mathematics. Erdős published around 1,500 mathematical papers during his lifetime, a figure that remains unsurpassed. He firmly believed mathematics to be a social activity, living an itinerant lifestyle with the sole purpose of writing mathematical papers with other mathem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leo Moser
Leo Moser (11 April 1921, Vienna – 9 February 1970, Edmonton) was an Austrian-Canadian mathematician, best known for his polygon notation. A native of Vienna, Leo Moser immigrated with his parents to Canada at the age of three. He received his Bachelor of Science degree from the University of Manitoba in 1943, and a Master of Science from the University of Toronto in 1945. After two years of teaching he went to the University of North Carolina to complete a PhD, supervised by Alfred Brauer. There, in 1950, he began suffering recurrent heart problems. He took a position at Texas Technical College for one year, and joined the faculty of the University of Alberta in 1951, where he remained until his death at the age of 48. In 1966, Moser posed the question "What is the region of smallest area which will accommodate every planar arc of length one?".W. Moser, G. Bloind, V. Klee, C. Rousseau, J. Goodman, B. Monson, J. Wetzel, L. M. Kelly7, G. Purdy, and J Wilker, Fifth edition, ''Pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Least Common Multiple
In arithmetic and number theory, the least common multiple, lowest common multiple, or smallest common multiple of two integers ''a'' and ''b'', usually denoted by lcm(''a'', ''b''), is the smallest positive integer that is divisible by both ''a'' and ''b''. Since division of integers by zero is undefined, this definition has meaning only if ''a'' and ''b'' are both different from zero. However, some authors define lcm(''a'',0) as 0 for all ''a'', since 0 is the only common multiple of ''a'' and 0. The lcm is the "lowest common denominator" (lcd) that can be used before fractions can be added, subtracted or compared. The least common multiple of more than two integers ''a'', ''b'', ''c'', . . . , usually denoted by lcm(''a'', ''b'', ''c'', . . .), is also well defined: It is the smallest positive integer that is divisible by each of ''a'', ''b'', ''c'', . . . Overview A multiple of a number is the product of that number and an integer. For example, 10 is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Prime
In number theory, a regular prime is a special kind of prime number, defined by Ernst Kummer in 1850 to prove certain cases of Fermat's Last Theorem. Regular primes may be defined via the divisibility of either class numbers or of Bernoulli numbers. The first few regular odd primes are: : 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 41, 43, 47, 53, 61, 71, 73, 79, 83, 89, 97, 107, 109, 113, 127, 137, 139, 151, 163, 167, 173, 179, 181, 191, 193, 197, 199, ... . History and motivation In 1850, Kummer proved that Fermat's Last Theorem is true for a prime exponent ''p'' if ''p'' is regular. This focused attention on the irregular primes. In 1852, Genocchi was able to prove that the first case of Fermat's Last Theorem is true for an exponent ''p'', if is not an irregular pair. Kummer improved this further in 1857 by showing that for the "first case" of Fermat's Last Theorem (see Sophie Germain's theorem) it is sufficient to establish that either or fails to be an irregular pair. Kummer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convergent (continued Fraction)
In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. In a finite continued fraction (or terminated continued fraction), the iteration/recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction. In contrast, an infinite continued fraction is an infinite expression. In either case, all integers in the sequence, other than the first, must be positive. The integers a_i are called the coefficients or terms of the continued fraction. It is generally assumed that the numerator of all of the fractions is 1. If arbitrary values and/or functions are used in place of one or more of the numerators or the integers in the denominators, the resulting expression is a generalized continued fraction. When it is necessa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Logarithm Of 2
The decimal value of the natural logarithm of 2 is approximately :\ln 2 \approx 0.693\,147\,180\,559\,945\,309\,417\,232\,121\,458. The logarithm of 2 in other bases is obtained with the formula :\log_b 2 = \frac. The common logarithm in particular is () :\log_ 2 \approx 0.301\,029\,995\,663\,981\,195. The inverse of this number is the binary logarithm of 10: : \log_2 10 =\frac \approx 3.321\,928\,095 (). By the Lindemann–Weierstrass theorem, the natural logarithm of any natural number other than 0 and 1 (more generally, of any positive algebraic number other than 1) is a transcendental number. Series representations Rising alternate factorial :\ln 2 = \sum_^\infty \frac=1-\frac12+\frac13-\frac14+\frac15-\frac16+\cdots. This is the well-known "alternating harmonic series". :\ln 2 = \frac +\frac\sum_^\infty \frac. :\ln 2 = \frac +\frac\sum_^\infty \frac. :\ln 2 = \frac +\frac\sum_^\infty \frac. :\ln 2 = \frac +\frac\sum_^\infty \frac. :\ln 2 = \frac +\frac\sum_^\infty \frac. : ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Diophantine Equations
In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponential Diophantine equation is one in which unknowns can appear in exponents. Diophantine problems have fewer equations than unknowns and involve finding integers that solve simultaneously all equations. As such systems of equations define algebraic curves, algebraic surfaces, or, more generally, algebraic sets, their study is a part of algebraic geometry that is called ''Diophantine geometry''. The word ''Diophantine'' refers to the Hellenistic mathematician of the 3rd century, Diophantus of Alexandria, who made a study of such equations and was one of the first mathematicians to introduce symbolism into algebra. The mathematical study of Diophantine problems that Di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
