Brocard's conjecture

From Wikipedia, the free encyclopedia

You have new messages (last change).

In mathematics, 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]. This conjecture is unproven as of 2005.

[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.
Retrieved from "http://en.wikipedia.org../../../b/r/o/Brocard%27s_conjecture.html"
In other languages