Brocard's conjecture

From Wikipedia, the free encyclopedia

In number theory, Brocard's conjecture is a conjecture that there are at least four prime numbers between (pn)2 and (pn+1)2, for n > 1, where pn is the nth prime number.[1] It is widely believed that this conjecture is true. However, it remains unproven as of 2007.

The number of primes between prime squares is 2, 5, 6, 15, 9, 22, 11, 27, ... (sequence A050216 in OEIS).

Legendre's conjecture that there is a prime between any integer square directly implies that there are at least two primes between prime squares for pn ≥ 3 since pn+1 - pn ≥ 2.

[edit] See also

[edit] References

  1. ^ Eric W. Weisstein, Brocard's Conjecture at MathWorld.
This number theory-related article is a stub. You can help Wikipedia by expanding it.
Languages