OMM 1998 Problem 1
A number is called lucky if computing the sum of the squares of its digits and repeating this operation sufficiently many times leads to number . For example, is lucky, as . Find infinitely many pairs of consecutive numbers each of which is lucky.
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.