Number Theory

   

The proof of the Twin Primes Conjecture

Authors: Ramón Ruiz

Twin Primes Conjecture statement: “There are infinitely many primes p such that (p + 2) is also prime”. Initially, to prove this conjecture, we can form two arithmetic sequences (A and B), with all the natural numbers, lesser than a number x, that can be primes and being each term of sequence B equal to its partner of sequence A plus 2. By analyzing the pairing process, in general, between all non-prime numbers of sequence A, with terms of sequence B, or vice versa, we note that some pairs of primes are always formed. This allow us to develop a non-probabilistic formula to calculate the approximate number of pairs of primes, p and (p + 2), that are lesser than x. The result of this formula tends to infinite when x tends to infinite, which allow us to confirm that the Twin Primes Conjecture is true. The prime numbers theorem by Carl Friedrich Gauss, the prime numbers theorem in arithmetic progressions and some axioms have been used to complete this investigation.

Comments: 24 Pages. This document has been written in Spanish.

Download: PDF

Submission history

[v1] 2014-06-04 15:53:02
[v2] 2015-02-22 13:56:43

Unique-IP document downloads: 472 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