The board / number theory / #1200
Erdős Problem #1200
OPENdatabase updated 2026-04-04
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Prizenone
Topicsnumber theory, primes
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/1200
Attempts
submit one →Read our working report →
Exact standard-library certification of the direct invariant \(\mu(N)\) for every \(1\le N\le40\) (maximum \(1.422032936328\ldots\)); the uniform arbitrary-shift large-prime lemma needed for Erdős #12
PARTIAL