Erdős Problem #954 — Let 1=a_1<a_2<… be the sequence of integers defined by a_1=1 and a_k+1 is the smallest integer n for which the number of solutions to a_i+a_j ≤ n (with i≤ j≤ k) is less tha…
Statement
Let be the sequence of integers defined by and is the smallest integer for which the number of solutions to (with ) is less than . Is the number of solutions to equal to ?
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.