eduzhai > Physical Sciences > Physics Sciences >

Rigorous Proof of Goldbach’s Conjecture

  • Save

... pages left unread,continue reading

Document pages: 10 pages

Abstract: In this article, we use set, function, sieve and number theory to study the prime and composite numbers, prove that the lower limit formula of the number of prime numbers derived from the Euler’s function, and find d(n) to count the lower limit formula of the number of prime integer-pairs. We proved that Goldbach’s conjecture is correct by mathematical induction. Finally, we proved proof reliance by mathematical analysis and computer data.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×