MathDB

2001 Stanford Math Tournament Team #6

Source:

May 24, 2014

Stanfordcollege

Problem Statement

Find the least

n

such that any subset of

{1,2,\dots,100}

with

n

elements has 2 elements with a diﬀerence of 9.