PL-OM 1987 Problem 3
is a polynomial with integer coefficients. Let be the sum of the digits of the number . Show that some value must occur infinitely often in the sequence .
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.