Number Theory

    

Proof of Infinite Number of Triplet Primes

Authors: Stephen Marshall

This paper presents a complete and exhaustive proof that an Infinite Number of Triplet Primes exist. 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): n =(p−1)!(1/p+(−1)d(d!)/(p + d)+ 1/(p+1)+ 1/(p+d) We use this proof and Euclid logic to prove only an infinite number of Triplet Primes exist. However we shall begin by assuming that a finite number of Triplet Primes exist, we shall prove a contradiction to the assumption of a finite number, which will prove that an infinite number of Triplet Primes exist.

Comments: 12 Pages.

Download: PDF

Submission history

[v1] 2014-08-28 15:30:00

Unique-IP document downloads: 902 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus