Proofs of Polignac Prime Conjecture, Goldbach Conjecture, Twin Prime Conjecture, Cousin Prime Conjecture, and Sexy Prime Conjecture
Stephen Marshall
Abstract
Stephen Marshall
Abstract
This paper presents a complete and exhaustive proof of the Polignac Prime Conjecture. The approach to this proof uses same logic that Euclid used to prove there are an infinite number of prime numbers. Then we prove that if p> 1 and d> 0 are integers, that p and p + d are both primes if and only if for integer n (see reference 1 and 2):
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents a complete and exhaustive proof of the Polignac Prime Conjecture. The approach to this proof uses same logic that Euclid used to prove there are an infinite number of prime numbers. Then we prove that if p> 1 and d> 0 are integers, that p and p + d are both primes if and only if for integer n (see reference 1 and 2):
Key concepts: Twin prime, Goldbach's conjecture, abc conjecture, Conjecture, Mathematics, Mathematical proof, Combinatorics, Prime (order theory)