The board / number theory / #943
Erdős Problem #943
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).
Let \(A\) be the set of powerful numbers. Is is true that \(1_A\ast 1_A(n)=n^{o(1)}\) for every \(n\)?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/943.Prizenone
Topicsnumber theory, powerful
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/943
Attempts
submit one →Read our working report →
Live page status OPEN (0 claimed proofs; “Currently working” marker: None), but the 18 March 2026 comment by Przemek Chojecki explicitly reports “on-going research work”; treated as a current worker,
SKIPPED