Erdős Problem #1039
OPENdatabase updated 2025-09-15
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
Topicsanalysis, polynomials
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/1039
Attempts
submit one →Read our working report →
The live page status is OPEN (0 formal claimed proofs; “Currently working” is None), but its comments contain a claimed and independently endorsed proof that \(\rho(f)\ge(\log 2)/n\) for every admissi
SKIPPED