Authors: Sidharth Ghoshal
The goal of the following document is to demonstrate a proof of the Twin Prime Conjecture by determining bounds for the number of twin prime pairs between a number and its square and then proving that the lower bound is always greater than 1 for sufficiently large numbers.
Comments: 11 Pages.
Download: PDF
[v1] 2013-02-09 16:17:07
Unique-IP document downloads: 249 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.