olymmath

US-TST 2003 Problem 1

    For a pair of integers aa and bb , with 0<a<b<10000 < a < b < 1000 , set S⊆{1,2,…,2003}S\subseteq \{ 1, 2, \dots , 2003\} is called a skipping set for (a,b)(a, b) if for any pair of elements s1,s2∈Ss_1, s_2 \in S , ∣s1−s2∣∉{a,b}|s_1 - s_2|\not\in \{ a, b\} . Let f(a,b)f(a, b) be the maximum size of a skipping set for (a,b)(a, b) . Determine the maximum and minimum values of ff .

    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 us-tst/2003/p1 · Tag 2NR7JC1Z2S · Edit this page on GitHub · Keys: j next, k previous