Goldbach–Euler Theorem
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, the Goldbach–Euler theorem (also known as Goldbach's theorem), states that the sum of 1/(''p'' − 1) over the set of
perfect powers In mathematics, a perfect power is a natural number that is a product of equal natural factors, or, in other words, an integer that can be expressed as a square or a higher integer Exponentiation, power of another integer greater than one. More ...
''p'', excluding 1 and omitting repetitions, converges to 1: :\sum_^\frac= + \cdots = 1. This result was first published in
Euler Leonhard Euler ( , ; 15 April 170718 September 1783) was a Swiss mathematician, physicist, astronomer, geographer, logician and engineer who founded the studies of graph theory and topology and made pioneering and influential discoveries in ma ...
's 1737 paper "''Variæ observationes circa series infinitas''". Euler attributed the result to a letter (now lost) from Goldbach.


Proof

Goldbach's original proof to Euler involved assigning a constant to the harmonic series: \textstyle x = \sum_^\infty \frac, which is divergent. Such a proof is not considered rigorous by modern standards. There is a strong resemblance between the method of sieving out powers employed in his proof and the method of factorization used to derive Euler's product formula for the Riemann zeta function. Let x be given by :x = 1 + \frac + \frac + \frac + \frac + \frac + \frac + \frac \cdots Since the sum of the reciprocal of every power of two is \textstyle 1 = \frac + \frac + \frac + \frac + \cdots, subtracting the terms with powers of two from x gives :x - 1 = 1 + \frac + \frac + \frac + \frac + \frac + \frac + \frac + \cdots Repeat the process with the terms with the powers of three: \textstyle \frac = \frac + \frac + \frac + \frac + \cdots :x - 1 - \frac = 1 + \frac + \frac + \frac + \frac + \frac + \frac + \cdots Absent from the above sum are now all terms with powers of two and three. Continue by removing terms with powers of 5, 6 and so on until the right side is exhausted to the value of 1. Eventually, we obtain the equation :x - 1 - \frac - \frac - \frac - \frac - \frac - \cdots = 1 which we rearrange into :x - 1 = 1 + \frac + \frac + \frac + \frac + \frac + \cdots where the denominators consist of all positive integers that are the non-powers minus one. By subtracting the previous equation from the definition of x given above, we obtain :1 = \frac + \frac + \frac+ \frac + \frac + \frac+ \frac + \cdots where the denominators now consist only of perfect powers minus one. While lacking mathematical rigor, Goldbach's proof provides a reasonably intuitive argument for the theorem's truth. Rigorous proofs require proper and more careful treatment of the divergent terms of the harmonic series. Other proofs make use of the fact that the sum of 1/''p'' over the set of perfect powers ''p'', excluding 1 but including repetitions, converges to 1 by demonstrating the equivalence: :\sum_^\frac = \sum_^\infty \sum_^\infty \frac = 1.


See also

*
Goldbach's conjecture Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even natural number greater than 2 is the sum of two prime numbers. The conjecture has been shown to hold ...
*
List of sums of reciprocals In mathematics and especially number theory, the sum of reciprocals generally is computed for the reciprocals of some or all of the positive integers (counting numbers)—that is, it is generally the sum of unit fractions. If infinitely many n ...


References

* . * {{DEFAULTSORT:Goldbach-Euler theorem Theorems in analysis Mathematical series Articles containing proofs