====== Brocard's conjecture ======

Brocard's conjecture asserts that there are at least four prime numbers between (//p<sub>n</sub>//)<sup>2</sup> and (//p<sub>n+1</sub>)<sup>2</sup>, where //p<sub>n</sub> is the //n//<sup>th</sup> prime number, for every //n// ≥ 2.

It was first suggested by French mathematician Henri Brocard in the late 19th century.

As yet, it has neither been proved or disproved.

For technical details see : [[https://mathworld.wolfram.com/BrocardsConjecture.html|Wolfram Mathworld]]

----

Also see : [[content:mathematics:brocards_problem]]