Erdős Problem #870 — Let k≥ 3 and A be an additive basis of order k. Does there exist a constant c=c(k)>0 such that if r(n)≥ clog n for all large n then A must contain a minimal basis of order k?
Statement
Let and be an additive basis of order . Does there exist a constant such that if for all large then must contain a minimal basis of order ? (Here counts the number of representations of as the sum of at most elements from .)
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.