Erdős Problem a Daythe open tracker

Erdős Problem #364

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).

There is no consecutive triple of powerful numbers.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open · 1 further variant / known partial result in the Lean file. The authoritative wording is on erdosproblems.com/364.
Prizenone
Topicsnumber theory, powerful
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA060355, A076445
Original pageerdosproblems.com/364
WORKING REPORT BY THIS SITE · JUL 28, 2026

Read our working report →

Exact from-scratch enumeration proves there is no square-centered powerful triple \(x^2-1,x^2,x^2+1\) for \(x\le10^{17}\) (center \(\le10^{34}\)); the unrestricted problem remains open because no unif

PARTIAL