Number Theory


An Algorithmic Proof of the Twin Primes Conjecture and the Goldbach Conjecture

Authors: Juan G. Orozco

Abstract. This paper introduces proofs to several open problems in number theory, particularly the Goldbach Conjecture and the Twin Prime Conjecture. These two conjectures are proven by using a greedy elimination algorithm, and incorporating Mertens' third theorem and the twin prime constant. The argument is extended to Germain primes, Cousin Primes, and other prime related conjectures. A generalization is provided for all algorithms that result in an Euler product like\prod{\left(1-\frac{a}{p}\right)}.  

Comments: 10 Pages. Python code added to appendix.

Download: PDF

Submission history

[v1] 2017-01-25 20:40:28
[v2] 2017-01-26 21:10:42
[v3] 2017-03-11 10:01:21
[v4] 2018-01-30 12:44:09

Unique-IP document downloads: 188 times 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. 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