OME 1999 Problem 4
A box contains cards, labeled from to . Cards are removed one at a time without replacement. What is the smallest number of cards that must be removed to guarantee that the labels of at least three removed cards have equal sums of digits?
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.