All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 325: Weaker

Writing fk,3(x)f_{k, 3}(x) for the number of integers x\leq x which are the sum of three kkth powers, is it even true that fk,3(x)ϵx(3/kϵ)f_{k, 3}(x) \gg_{\epsilon} x ^ (3 / k - \epsilon)?

Mathematical statement

Writing fk,3(x)f_{k, 3}(x) for the number of integers x\leq x which are the sum of three kkth powers, is it even true that fk,3(x)ϵx(3/kϵ)f_{k, 3}(x) \gg_{\epsilon} x ^ (3 / k - \epsilon)?

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_325.variants.weaker

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_325.variants.weaker :    answer(sorry)   ε > 0,  k : , 3  k  (fun x :  => (x : ) ^ ((3 / k : ) - ε)) =O[atTop]      (fun x => (cardIsSumThreePowerBelow k x : )) := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References