Algorithmic & Greedy Constructions
Describe a procedure, then prove it terminates and works.
Many 'show that such an arrangement exists' problems are answered by giving an explicit algorithm: repeatedly apply a local fix, and argue with a monovariant that it must stop.
The proof has two halves people forget to separate: termination (some non-negative integer strictly decreases) and correctness (the stopped state has the required property).
Greedy arguments belong here too: take the largest available piece, then prove an exchange argument shows greedy is optimal.
Guides on Algorithmic & Greedy Constructions
- Greedy arguments in olympiad combinatorics: when they workGreedy is the first idea on every construction problem and the one most often marked zero. How to tell when it works, and the two proofs it always owes.
Train it on Lemma
Algorithmic & Greedy Constructions unlocks at Level 6 of Lemma's eight-level ladder, with lessons that teach it and drills that make it stick. 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 techniques
- The Extremal PrincipleLook at the largest, the smallest, the closest, the first.
- Infinite Descent & Vieta JumpingNo smallest counterexample can survive.
- All 29 techniques →