Andrica's conjecture

(a) The function A n {\displaystyle A_{n}} for the first 100 primes.
(b) The function A n {\displaystyle A_{n}} for the first 200 primes.
(c) The function A n {\displaystyle A_{n}} for the first 500 primes.
Graphical proof for Andrica's conjecture for the first (a)100, (b)200 and (c)500 prime numbers. It is conjectured that the function A n {\displaystyle A_{n}} is always less than 1.

Andrica's conjecture (named after Dorin Andrica) is a conjecture regarding the gaps between prime numbers.[1]

The conjecture states that the inequality

p n + 1 p n < 1 {\displaystyle {\sqrt {p_{n+1}}}-{\sqrt {p_{n}}}<1}

holds for all n {\displaystyle n} , where p n {\displaystyle p_{n}} is the nth prime number. If g n = p n + 1 p n {\displaystyle g_{n}=p_{n+1}-p_{n}} denotes the nth prime gap, then Andrica's conjecture can also be rewritten as

g n < 2 p n + 1. {\displaystyle g_{n}<2{\sqrt {p_{n}}}+1.}

Empirical evidence

Imran Ghory has used data on the largest prime gaps to confirm the conjecture for n {\displaystyle n} up to 1.3002 × 1016.[2] Using a table of maximal gaps and the above gap inequality, the confirmation value can be extended exhaustively to 4 × 1018.

The discrete function A n = p n + 1 p n {\displaystyle A_{n}={\sqrt {p_{n+1}}}-{\sqrt {p_{n}}}} is plotted in the figures opposite. The high-water marks for A n {\displaystyle A_{n}} occur for n = 1, 2, and 4, with A4 ≈ 0.670873..., with no larger value among the first 105 primes. Since the Andrica function decreases asymptotically as n increases, a prime gap of ever increasing size is needed to make the difference large as n becomes large. It therefore seems highly likely the conjecture is true, although this has not yet been proven.

Generalizations

Value of x in the generalized Andrica's conjecture for the first 100 primes, with the conjectured value of xmin labeled.

As a generalization of Andrica's conjecture, the following equation has been considered:

p n + 1 x p n x = 1 , {\displaystyle p_{n+1}^{x}-p_{n}^{x}=1,}

where p n {\displaystyle p_{n}} is the nth prime and x can be any positive number.

The largest possible solution for x is easily seen to occur for n=1, when xmax = 1. The smallest solution for x is conjectured to be xmin ≈ 0.567148... (sequence A038458 in the OEIS) which occurs for n = 30.

This conjecture has also been stated as an inequality, the generalized Andrica conjecture:

p n + 1 x p n x < 1 {\displaystyle p_{n+1}^{x}-p_{n}^{x}<1} for x < x min . {\displaystyle x<x_{\min }.}

See also

References and notes

  1. ^ Andrica, D. (1986). "Note on a conjecture in prime number theory". Studia Univ. Babes–Bolyai Math. 31 (4): 44–48. ISSN 0252-1938. Zbl 0623.10030.
  2. ^ Wells, David (May 18, 2005). Prime Numbers: The Most Mysterious Figures in Math. Hoboken (N.J.): Wiley. p. 13. ISBN 978-0-471-46234-7.
  • Guy, Richard K. (2004). "Section A8". Unsolved problems in number theory (3rd ed.). Springer-Verlag. ISBN 978-0-387-20860-2. Zbl 1058.11001.

External links

  • Andrica's Conjecture at PlanetMath
  • Generalized Andrica conjecture at PlanetMath
  • Weisstein, Eric W. "Andrica's Conjecture". MathWorld.