by stupidityismygam » Tue Mar 23, 2010 2:51 am
Let [unparseable or potentially dangerous latex formula] be an integer and let [unparseable or potentially dangerous latex formula]. Find the smallest value of [unparseable or potentially dangerous latex formula] such that for every partition of [unparseable or potentially dangerous latex formula] into two subsets, at least one of the subsets contains integers [unparseable or potentially dangerous latex formula] and [unparseable or potentially dangerous latex formula] (not necessarily distinct) such that [unparseable or potentially dangerous latex formula]
my avatar is pretty awesome
tytia