TH-TMO 2010 Problem 8
Define the modulo distance between two integers to be the smallest nonnegative integer equivalent to either or modulo . Show that, given a set S of integers such that , there must be with .
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.