MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
Stanford Mathematics Tournament
2001 Stanford Mathematics Tournament
6
6
Part of
2001 Stanford Mathematics Tournament
Problems
(1)
2001 Stanford Math Tournament Team #6
Source:
5/24/2014
Find the least
n
n
n
such that any subset of
1
,
2
,
…
,
100
{1,2,\dots,100}
1
,
2
,
…
,
100
with
n
n
n
elements has 2 elements with a difference of 9.
Stanford
college