Authors: Bertrand Wong
Euclid’s proof of the infinitude of the primes has generally been regarded as elegant. It is a proof by contradiction, or, reductio ad absurdum, and it relies on an algorithm which will always bring in larger and larger primes, an infinite number of them. However, the proof is also subtle and has been misinterpreted by some with one well-known mathematician even remarking that the algorithm might not work for extremely large numbers. The author has been working on the twin primes conjecture for a long period and had published a paper on the conjecture in an international mathematics journal in 2003. This paper presents some remarks/reasons which support the validity of the twin primes conjecture, including a reasoning which is somewhat similar to Euclid’s proof of the infinity of the primes.
Comments: 15 Pages.
Download: PDF
[v1] 2013-10-15 00:03:10
[v2] 2014-09-16 03:57:14
[v3] 2015-01-01 03:30:05
[v4] 2015-01-01 07:33:58
[v5] 2019-04-17 14:52:51
[v6] 2019-04-18 20:42:15
Unique-IP document downloads: 336 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.