2009 IMO Problems/Problem 6: Difference between revisions
Created page with '== Problem == Let <math>a_1,a_2,\ldots,a_n</math> be distinct positive integers and let <math>M</math> be a set of <math>n-1</math> positive integers not containing <math>s=a_1+…' |
mNo edit summary |
||
| Line 4: | Line 4: | ||
''Author: Dmitry Khramtsov, Russia'' | ''Author: Dmitry Khramtsov, Russia'' | ||
Revision as of 12:04, 10 July 2012
Problem
Let 
be distinct positive integers and let 
be a set of 
positive integers not containing 
. A grasshopper is to jump along the real axis, starting at the point 
and making 
jumps to the right with lengths in some order. Prove that the order can be chosen in such a way that the grasshopper never lands on any point in .
Author: Dmitry Khramtsov, Russia
