en>Jason Quinn: the 1980 edition is the 2nd edition... the 3rd edition was released in 2002.... plus it had two coauthors

2013-10-29T01:06:56Z

the 1980 edition is the 2nd edition... the 3rd edition was released in 2002.... plus it had two coauthors

← Older revision		Revision as of 03:06, 29 October 2013
Line 1:		Line 1:
			{{about\|a certain mathematical series\|The Goldbach's theorem concerning Fermat numbers\|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, [[Convergent series\|converges]] to 1:

	~~Friends call him Tad~~. ~~South Dakota has always been his home~~. ~~His day job is an auditing officer. Researching fashion is one of~~ the ~~things he loves most~~. ~~He is running and maintaining~~ a ~~blog here: http~~:/~~/www~~.~~sesctv~~.~~com~~.br/~~backups~~/~~cfc~~/~~CK_BR~~/~~[https~~:/~~/www~~.~~Flickr~~.~~com/search/?q=loja~~-~~virtual~~-~~calvin~~-~~klein.cfm loja~~-~~virtual~~-~~calvin~~-~~klein.cfm]~~<br><br>~~my site: Loja Virtual Calvin Klein ([http~~:/~~/www~~.~~sesctv~~.~~com~~.br/~~backups~~/~~cfc~~/~~CK_BR/loja-virtual-calvin-klein.cfm~~ http://www.~~sesctv~~.~~com.br~~/~~backups~~/~~cfc~~/~~CK_BR~~/~~loja~~-~~virtual~~-~~calvin~~-~~klein~~.~~cfm~~])		:<math>\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.</math>

			This result was first published in [[Leonhard Euler\|Euler]]'s 1737 paper "''Variae observationes circa series infinita''s". Euler attributed the result to a letter (now lost) from [[Christian Goldbach\|Goldbach]].

			==Proof==

			Goldbach's original proof to Euler involved assigning a constant to the [[harmonic series (mathematics)\|harmonic series]]:
			<math> \textstyle x = \sum_{n=1}^\infty \frac{1}{n}\ </math>, which is [[divergent series\|divergent]]. Such a proof is not considered rigorous by modern standards. It is also interesting to note that there is a strong resemblance between the method of sieving out powers employed in his proof and the [[Proof of the Euler product formula for the Riemann zeta function\|method of factorization used to derive Euler's product formula for the Riemann zeta function]].

			Let x be given by

			:<math>x = 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \frac{1}{5} + \frac{1}{6} + \frac{1}{7} + \frac{1}{8} \cdots</math>

			Since the sum of the reciprocal of every power of two is <math> \textstyle 1 = \frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \frac{1}{16} + \cdots</math>, subtracting the terms with powers of two from x gives

			:<math>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</math>

			Repeat the process with the terms with the powers of three: <math>\textstyle \frac{1}{2} = \frac{1}{3} + \frac{1}{9} + \frac{1}{27} + \frac{1}{81} + \cdots</math>

			:<math>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</math>

			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

			:<math>x - 1 - \frac{1}{2} - \frac{1}{4} - \frac{1}{5} - \frac{1}{6} - \frac{1}{9} - \cdots = 1</math>

			which we rearrange into

			:<math>x - 1 = 1 + \frac{1}{2} + \frac{1}{4} + \frac{1}{5} + \frac{1}{6} + \frac{1}{9} + \cdots</math>

			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

			:<math>1 = \frac{1}{3} + \frac{1}{7} + \frac{1}{8}+ \frac{1}{15} + \frac{1}{24} + \frac{1}{26}+ \frac{1}{31} + \cdots</math>

			where the denominators now consist only of perfect powers minus one.

			While mathematically incorrect, Goldbach's proof provides a reasonably intuitive visualization of the problem. 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:

			:<math>\sum_{p}\frac{1}{p - 1} = \sum_{m=2}^\infty \sum_{n=2}^\infty \frac{1}{m^n} = 1.</math>

			==See also==
			* [[Goldbach's conjecture]]

			==References==
			* {{Cite journal \| doi=10.2307/27641889 \| first1=Pelegrí \|last1=Viader\|first2= Lluís \|last2=Bibiloni\|first3= Jaume\|last3=Paradís \| title=On a series of Goldbach and Euler \| url=http://www.recercat.net/bitstream/2072/920/1/776.pdf\|journal=[[American Mathematical Monthly]]\|volume= 113\|year=2006 \| issue=3\|pages= 206–220 \| postscript=<!--None--> \| jstor=27641889 }}.
			* {{cite book \|title=Concrete Mathematics \|last=Graham \|first=Ronald \|authorlink=Ronald Graham \|coauthors=[[Donald Knuth]], [[Oren Patashnik]] \|year=1988 \|publisher=Addison-Wesley \|location= \|isbn=0-201-14236-8 }}

			{{DEFAULTSORT:Goldbach-Euler theorem}}
			[[Category:Theorems in analysis]]
			[[Category:Mathematical series]]
			[[Category:Articles containing proofs]]

en>Helpful Pixie Bot: ISBNs (Build KC)

2012-05-06T00:00:52Z

ISBNs (Build KC)

New page

Friends call him Tad. South Dakota has always been his home. His day job is an auditing officer. Researching fashion is one of the things he loves most. He is running and maintaining a blog here: http://www.sesctv.com.br/backups/cfc/CK_BR/[https://www.Flickr.com/search/?q=loja-virtual-calvin-klein.cfm loja-virtual-calvin-klein.cfm]<br><br>my site: Loja Virtual Calvin Klein ([http://www.sesctv.com.br/backups/cfc/CK_BR/loja-virtual-calvin-klein.cfm http://www.sesctv.com.br/backups/cfc/CK_BR/loja-virtual-calvin-klein.cfm])

Monogenic system - Revision history

en>Jason Quinn: the 1980 edition is the 2nd edition... the 3rd edition was released in 2002.... plus it had two coauthors

en>Helpful Pixie Bot: ISBNs (Build KC)