Papers
Topics
Authors
Recent
Search
2000 character limit reached

A conditional proof of Legendre's Conjecture and Andrica's conjecture

Published 27 Sep 2018 in math.GM | (1810.02191v3)

Abstract: The Legendre conjecture has resisted analysis over a century, even under assumption of the Riemann Hypothesis. We present, a significant improvement on previous results by greatly reducing the assumption to a more modest statement called the Parity conjecture. Let $p_n$ and $p_{n+1}$ be two consecutive odd primes, let $m$ be their midpoint fixed once for all. Conjecture: The largest multiple of $p_n$ not exceeding ${m_i}2$ is odd for every integer $m_i$ in the interval $(p_n, m]$. Main result: We prove that the Parity conjecture implies Legendre's conjecture and Andrica's conjecture.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.