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.

This work is licensed under a Creative Commons Attribution 4.0 License.