Oppermann's conjecture is an unsolved problem on the distribution of prime numbers, closely related to but stronger than Legendre's conjecture, Andrica's conjecture and Brocard's conjecture. It is named after Danish mathematician Ludvig Oppermann, who announced it in an unpublished lecture in March 1877. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
StatementFor every integer n greater than 1, there is at least one prime number between n(n-1) and n^2, and at least another prime between n^2 and n(n+1). 1 Proposed Year Classification
Resolution Status Prize Status
Prize Status (category) Sources
1. Oppermann's Conjecture (Wikipedia)
Wikimedia FoundationLead section
announced it in an unpublished lecture in March 1877
Statement
The conjecture states that, for every integer n > 1, there is at least one prime number between
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.