olymmath

TH-TMO 2010 Problem 8

    Define the modulo 25532553 distance d(x,y)d(x, y) between two integers x,yx, y to be the smallest nonnegative integer dd equivalent to either x−yx - y or y−xy - x modulo 25532553 . Show that, given a set S of integers such that ∣S∣≥70|S| \ge 70 , there must be m,n∈Sm, n \in S with d(m,n)≤36d(m, n) \le 36 .

    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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator th-tmo/2010/p8 · Tag PMASXAFV84 · Edit this page on GitHub · Keys: j next, k previous