A Method for Solving Legendre's Conjecture

Hashem Sazegar


Legendre's conjecture states that there is a prime number between $n^2$ and $(n+1)^2$ for every positive integer $n$.
In this paper we prove that every composite number between $n^2$ and $(n+1)^2$ can be written $u^2-v^2$ or $u^2-v^2+u-v$ that $u>0$ and $v\geq 0$. Using these result as well as induction and residues $(modq)$ we prove Legendre's conjecture.

Full Text:


DOI: http://dx.doi.org/10.5539/jmr.v4n1p121

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.