Erdős Problem #323 — Let 1≤ m≤ k and f_k,m(x) denote the number of integers ≤ x which are the sum of m many nonnegative kth powers.
Statement
Let and denote the number of integers which are the sum of many nonnegative th powers. Is it true that for all ? Is it true that if then for sufficiently large ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.