UNSOLVED PROBLEMS |

In Number Theory, Logic, and Cryptography |

Legendre’s Conjecture |

Between 13 The problem is to prove Legendre's Conjecture, which states that there is at least one prime number between every pair of consecutive squares, or find a counter-example.
For further information, please see: [1] http://mathworld.wolfram.com/LegendresConjecture.html [2] http://en.wikipedia.org/wiki/Legendre%27s_conjecture [3] http://arxiv.org/PS_cache/arxiv/pdf/0811/0811.4451v2.pdf
You can check for contributions to this problem on the solutions page. ——————————–- This web site developed and maintained by Tim S Roberts Email: timro21@gmail.com |