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

Madieyna Diouf

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

General Mathematics 2019-03-05 v3

Authors: Madieyna Diouf

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.

Keywords

legendre's conjecture andrica's conjecture parity conjecture consecutive primes conditional proof

Cite

@article{arxiv.1810.02191,
  title  = {A conditional proof of Legendre's Conjecture and Andrica's conjecture},
  author = {Madieyna Diouf},
  journal= {arXiv preprint arXiv:1810.02191},
  year   = {2019}
}

Comments

In v3, we have reduced a difficult problem, that is the difference between two consecutive primes, to a much simpler problem where the focus is not in the gap or location of these primes, but simply in whether some particular numbers are even or odd

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

Abstract

Keywords

Cite

Comments

Related papers