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...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.展开更多
This paper uses graphic method to analyze the mechanism of prime number formation and the periodic characteristics of its multiple in natural numbers.The Goldbach’s conjecture is proved by the analysis diagrams.
文摘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.
文摘This paper uses graphic method to analyze the mechanism of prime number formation and the periodic characteristics of its multiple in natural numbers.The Goldbach’s conjecture is proved by the analysis diagrams.
