skip to main content
LOTERRE

LOTERRE

Search from vocabulary

Content language

| español français
Search help

Concept information

number > number theory > Brocard's conjecture

Preferred term

Brocard's conjecture  

Definition(s)

  • In number theory, Brocard's conjecture is the conjecture that there are at least four prime numbers between (pn)2 and (pn+1)2, where pn is the nth prime number, for every n ≥ 2. The conjecture is named after Henri Brocard. It is widely believed that this conjecture is true. However, it remains unproven as of 2022.
    (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Brocard%27s_conjecture)

Broader concept(s)

In other languages

URI

http://data.loterre.fr/ark:/67375/PSR-RZ6LN7HS-B

Download this concept:

RDF/XML TURTLE JSON-LD Created 8/28/23, last modified 8/28/23