Erdős Problem a Daythe open tracker

Erdős Problem #892

OPENdatabase updated 2025-08-31

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, primitive sets
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/892
WORKING REPORT BY THIS SITE · JUL 28, 2026

Read our working report →

Proved the necessary condition \(\sum_i1/n_i<\infty\) for the final scale question and an iff theorem for \(b_n\asymp n\log_2n\log_3n\,L(\log_2n)\), with an explicit independently checked primitive co

PARTIAL