The board / number theory / #366
Erdős Problem #366
ambiguous statement
VERIFIABLEdatabase updated 2025-08-31
Still open — but if it is true, a finite example proves it, so a computer search could in principle prove it. A search can't disprove it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Are there any \(2\)-full \(n\) such that \(n+1\) is \(3\)-full?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open · 2 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/366.Prizenone
Topicsnumber theory, powerful
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA060355
Original pageerdosproblems.com/366
Attempts
submit one →Read our working report →
Live page status is VERIFIABLE and lists “1 claimed proof for this problem” (currently working: None), so the mandatory no-duplication rule applies.
SKIPPED