fbpx
Wikipedia

Goldbach–Euler theorem

In 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 p, excluding 1 and omitting repetitions, converges to 1:

This result was first published in Euler'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:  , 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

 

Since the sum of the reciprocal of every power of two is  , subtracting the terms with powers of two from x gives

 

Repeat the process with the terms with the powers of three:  

 

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

 

which we rearrange into

 

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

 

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:

 

See also

References

  • Viader, Pelegrí; Bibiloni, Lluís; Paradís, Jaume (2006). "On a series of Goldbach and Euler" (PDF). American Mathematical Monthly. 113 (3): 206–220. doi:10.2307/27641889. hdl:10230/382. JSTOR 27641889..
  • Graham, Ronald; Donald Knuth; Oren Patashnik (1988). Concrete Mathematics. Addison-Wesley. ISBN 0-201-14236-8.

goldbach, euler, theorem, this, article, about, certain, mathematical, series, goldbach, theorem, concerning, fermat, numbers, fermat, number, basic, properties, mathematics, also, known, goldbach, theorem, states, that, over, perfect, powers, excluding, omitt. This article is about a certain mathematical series For The Goldbach s theorem concerning Fermat numbers see Fermat number Basic properties In 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 p excluding 1 and omitting repetitions converges to 1 p 1 p 1 1 3 1 7 1 8 1 15 1 24 1 26 1 31 1 displaystyle sum p infty frac 1 p 1 frac 1 3 frac 1 7 frac 1 8 frac 1 15 frac 1 24 frac 1 26 frac 1 31 cdots 1 This result was first published in Euler s 1737 paper Variae observationes circa series infinitas Euler attributed the result to a letter now lost from Goldbach Proof EditGoldbach s original proof to Euler involved assigning a constant to the harmonic series x n 1 1 n displaystyle textstyle x sum n 1 infty frac 1 n 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 1 2 1 3 1 4 1 5 1 6 1 7 1 8 displaystyle x 1 frac 1 2 frac 1 3 frac 1 4 frac 1 5 frac 1 6 frac 1 7 frac 1 8 cdots Since the sum of the reciprocal of every power of two is 1 1 2 1 4 1 8 1 16 displaystyle textstyle 1 frac 1 2 frac 1 4 frac 1 8 frac 1 16 cdots subtracting the terms with powers of two from x gives x 1 1 1 3 1 5 1 6 1 7 1 9 1 10 1 11 displaystyle x 1 1 frac 1 3 frac 1 5 frac 1 6 frac 1 7 frac 1 9 frac 1 10 frac 1 11 cdots Repeat the process with the terms with the powers of three 1 2 1 3 1 9 1 27 1 81 displaystyle textstyle frac 1 2 frac 1 3 frac 1 9 frac 1 27 frac 1 81 cdots x 1 1 2 1 1 5 1 6 1 7 1 10 1 11 1 12 displaystyle x 1 frac 1 2 1 frac 1 5 frac 1 6 frac 1 7 frac 1 10 frac 1 11 frac 1 12 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 1 2 1 4 1 5 1 6 1 9 1 displaystyle x 1 frac 1 2 frac 1 4 frac 1 5 frac 1 6 frac 1 9 cdots 1 which we rearrange into x 1 1 1 2 1 4 1 5 1 6 1 9 displaystyle x 1 1 frac 1 2 frac 1 4 frac 1 5 frac 1 6 frac 1 9 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 1 3 1 7 1 8 1 15 1 24 1 26 1 31 displaystyle 1 frac 1 3 frac 1 7 frac 1 8 frac 1 15 frac 1 24 frac 1 26 frac 1 31 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 p 1 p 1 m 2 n 2 1 m n 1 displaystyle sum p infty frac 1 p 1 sum m 2 infty sum n 2 infty frac 1 m n 1 See also EditGoldbach s conjecture List of sums of reciprocalsReferences EditViader Pelegri Bibiloni Lluis Paradis Jaume 2006 On a series of Goldbach and Euler PDF American Mathematical Monthly 113 3 206 220 doi 10 2307 27641889 hdl 10230 382 JSTOR 27641889 Graham Ronald Donald Knuth Oren Patashnik 1988 Concrete Mathematics Addison Wesley ISBN 0 201 14236 8 Retrieved from https en wikipedia org w index php title Goldbach Euler theorem amp oldid 1066143328, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.