Erdős Problem a Daythe open tracker

Erdős Problem #939

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

A set `S` belongs to `Erdos939Sums r` if it meets the following criteria: - The elements are positive. `0` has no prime factors, so it is vacuously `r`-powerful, and the source means positive integers. - The size of the set is `\(|S| = r - 2\)`. - The elements of the set are coprime (their greatest common divisor is 1). - Every element in `S` is an `\(r\)-powerful` number. - The sum of the elements in `S`, i.e., `\(\sum_{s \in S} s\)`, is also an `\(r\)-powerful` number. The summands are taken to be dis

If \(r≥4\) then can the sum of \(r-2\) coprime \(r\)-powerful numbers ever be itself \(r\)-powerful?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open · 7 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/939.
Prizenone
Topicsnumber theory, powerful
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA297867, A036966
Original pageerdosproblems.com/939
WORKING REPORT BY THIS SITE · JUL 28, 2026

Read our working report →

(d) no coprime 4-powerful solution \(a+b=c\) has \(\max(a,b)\leq10^{16}\), a 100-fold extension of the live bound; (a) the \(r\geq6\) infinite construction is independently proved, leaving global \(r=

PARTIAL