Abstract

Background: The twin prime conjecture is regarded as a classic puzzle in number theory and one of the most well-known conjectures that has always perplexed us. Mathematician David Hilbert presented 23 key mathematical problems and conjectures to be solved at the International Congress of Mathematicians in 1900. He included the Bernhard Riemann conjecture, the Twin Prime Conjecture, and the Goldbach's conjecture in the eighth of 23 mathematical problems. Methods: Based on the "Differential Incremental Equilibrium Theory" [1], the infinite set of infinite prime numbers is divided, the increment equation of infinite prime numbers is established, and the tree-like set of prime numbers is obtained. Find the twin primes with a minimum unit [1\(\to\)1] of 2. Results: When a set of prime numbers is infinitely divided, there are 2[1\(\to\)1] pairs of prime numbers whose gap is equal to 2 and gap is not equal to 2. We gives a complete proof of the twin prime conjecture. It shows that the importance of "Differential Incremental Equilibrium Theory" [1] and infinite classification in twin prime conjecture. In a higher-level ideology, the set infinite partition classification confirms that the minimum unit is 2. It's a new way to prove Twin Prime Conjecture. Conclusion: This paper gives a complete proof of the establishment of the Twin Prime Conjecture.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call