Math Olympiad
Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial...
Install
npx skills add anthropics/claude-plugins-official --skill math-olympiad -g -a claude-code -y- Repository
- anthropics/claude-plugins-official45.7k
- Category
- Documents
- Updated
- 3d ago
- License
- Apache-2.0
- Context cost
- Mediumabout 3,000 tokens
- Runs scripts
- Yes, review before use
What it does
Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial verification that catches the errors self-verification misses. Activates when asked to 'solve this IMO problem', 'prove this olympiad inequality', 'verify this competition proof', 'find a counterexample', 'is this proof correct', or for any problem with 'IMO', 'Putnam', 'USAMO', 'olympiad', or 'competition math' in it. Uses pure reasoning (no tools), then a fresh-context adversarial verifier attacks the proof using specific failure patterns, not generic 'check logic'. Outputs calibrated confidence, will say 'no confident solution' rather than bluff. If LaTeX is available, produces a clean PDF after verification passes.
Math Olympiad Solver
The five things that change outcomes
- Strip thinking before verifying, a verifier that sees the reasoning is biased toward agreement. Fresh context, cleaned proof only.
- "Does this prove RH?", if your theorem's specialization to ζ is a famous open problem, you have a gap. Most reliable red flag.
- Short proof → extract the general lemma, try 2×2 counterexamples. If general form is false, find what's special about THIS instance.
- Same gap twice → step back, the case split may be obscuring a unified argument. Three lines sometimes does what twelve pages couldn't.
- Say "no confident solution", wrong-and-confident is worse than honest abstain.
Tool policy: Solvers and verifiers use THINKING ONLY in the tight-budget workflow. Competition math is reasoning. Computation is for deep mode (§6c), and even then bounded, a recurrence that's doubly-exponential can't be computed past n~30, work mod 2^m instead.
