OIM 2012 Problem 2
A positive integer is called shiny if it can be written as the sum of two not necessarily distinct integers and which have the same sum of their digits. For instance, is shiny, because , and both and have the same sum of their digits. Find all positive integers which are not shiny (the dark integers).
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.