Erdős Problem #1107
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, powerful.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
A positive integer is \(r\)‑powerful when each prime appearing in its factorization has exponent at least \(r\). For example, \(8=2^3\) is \(3\)‑powerful, and \(36=2^2 3^2\) is \(2\)‑powerful. The number \(1\) satisfies the condition vacuously.
Erdős Problem #1107 asks whether, for each fixed integer \(r\ge2\), every sufficiently large positive integer can be written as a sum of at most \(r+1\) positive \(r\)‑powerful numbers.
The assertion is eventual: small exceptions are permitted. The number of summands is at most \(r+1\), not necessarily exactly that many.
A small example
For \(r=2\), the permitted summands include \(1,4,8,9,16,25,27,\ldots\). Many integers can be written as sums of at most three such numbers:
The integer \(7\) cannot: using only squarefull numbers no greater than seven, the largest sum below seven of at most three positive terms is \(4+1+1=6\).
Exact enumeration through \(120\) finds the following small integers not representable by at most three positive squarefull numbers:
This is not a counterexample to the theorem that all sufficiently large integers have representations.
What is known
The case \(r=2\) was proved by Heath-Brown (1988), according to the maintained catalogue. The general problem, for all fixed \(r\ge3\), is still listed as open.
The question arises from a powerful-number analogue of additive bases: one restricts summands to numbers with repeated prime factors but asks whether a fixed number of these sparse summands covers all sufficiently large integers.
The related problem of using only \(r\) rather than \(r+1\) summands is different and has its own history.
GCL's current state
Authenticated source audit #2378 verifies the small exact representation search, distinguishing exceptional integers from genuine obstructions to eventual representation.
The frozen formal source correctly separates its solved \(r=2\) special case from its open general statement, but the theorem bodies have not been kernel-replayed.
What remains
Inspect Heath-Brown's original proof and all positivity, unit, and eventual-exception conventions. Investigate the extension to \(r\ge3\) without treating finite searches as evidence of a complete Waring-type theorem.
Sources and claim boundaries
Erdős Problem #1107, Oberwolfach 1986; Heath-Brown (1988), externally reported \(r=2\) theorem; frozen formal statements; GCL return #2378. Finite representations are independently verified. General case open; manuscript unaccepted.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2378 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.