Brocard's conjecture

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. 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, ... .

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

See also


Search another word or see brocardon Dictionary | Thesaurus |Spanish
Copyright © 2015, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature