The board / number theory / #938
Erdős Problem #938
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=\{n_1 < n_2 < \cdots\}\) be the sequence of powerful numbers (if \(p\mid n\) then \(p^2\mid n\)). Are there only finitely many three-term progressions of consecutive terms \(n_k,n_{k+1},n_{k+2}\)?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/938.Prizenone
Topicsnumber theory, powerful
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/938
Attempts
submit one →Read our working report →
The live page is OPEN with 0 claimed proofs, but it lists SkyYang as “Currently working on this problem” (accessed 2026-07-28), so the mandatory no-collision rule requires stopping without a mathemati
SKIPPED