Classic olympiad problem · Algebra
Prove that among any n+1 numbers chosen from \1,2,…,2n\, some one…
Prove that among any numbers chosen from , some one divides another.
This is a proof problem. The answer is an argument, not a number. The solution is deliberately not posted here: reading a solution you didn't fight for teaches almost nothing. On Lemma you attempt it cold, take one of the 3 progressive hints only when genuinely stuck, then compare your proof against a full walkthrough and mark yourself with the same rubric a competition coordinator would use.
Guides that use this problem
- How to spot a pigeonhole problem in under a minutePigeonhole is easy to understand and hard to recognise. Four signals that tell you to reach for it, and the three questions that turn a signal into boxes.
Train it on Lemma
This problem sits in the Olympiad Set: 89 proof problems (real IMO problems and the classics) with progressive hints, full walkthroughs and marking rubrics. 128 lessons, 1237 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and the paid plan opens with 3 free days.
Find your levelMore Algebra problems
- IMO 1964, Problem 2IMO 1964, Problem 2 · difficulty 5/6
- Functional equationClassic (functional equation) · difficulty 4/6
- AM–GM: Prove that for positive reals a,b,c:…Classic (AM–GM) · difficulty 3/6
- All 89 problems →