erdős #323
Let and denote the number of integers which are the sum of many nonnegative th powers. Is it true thatfor all ? Is it true that if thenfor sufficiently large ?
Worked, still open.
number theory · open · possible · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Write [ f_{k,m}(x)=|\\{n\le x:\ n=a_1^k+\cdots+a_m^k\ \text{for some }a_i\in\mathbb Z_{\ge 0}\\}|. ]
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 11 · open (literature)
theorem erdos_323.parts.i :
answer(sorry) ↔ ∀ k ≥ 1, ∀ ε > (0 : ℝ),
(fun (x : ℕ) ↦ (x : ℝ) ^ (1 - ε)) =O[atTop] (fun (x : ℕ) ↦ (f k k x : ℝ))formal-conjectures/323.lean ↗status
open