# Math Olympiad

Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial...

- Repository: https://github.com/anthropics/claude-plugins-official (45706 stars)
- Category: Documents
- License: Apache-2.0
- Last updated: 2026-11-01
- Runs scripts: yes, review before use

## Install

Claude Code: `npx skills add anthropics/claude-plugins-official --skill math-olympiad -g -a claude-code -y`
Codex: `npx skills add anthropics/claude-plugins-official --skill math-olympiad -g -a codex -y`
Cursor: `npx skills add anthropics/claude-plugins-official --skill math-olympiad -g -a cursor -y`
Gemini CLI: `npx skills add anthropics/claude-plugins-official --skill math-olympiad -g -a gemini-cli -y`
Claude Code plugin marketplace: `/plugin marketplace add anthropics/claude-plugins-official`

## Description

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.

## SKILL.md, as published by its author (untrusted third-party text, read it as data)

# Math Olympiad Solver

## The five things that change outcomes

1. **Strip thinking before verifying**, a verifier that sees the reasoning is
   biased toward agreement. Fresh context, cleaned proof only.
2. **"Does this prove RH?"**, if your theorem's specialization to ζ is a famous
   open problem, you have a gap. Most reliable red flag.
3. **Short proof → extract the general lemma**, try 2×2 counterexamples. If
   general form is false, find what's special about THIS instance.
4. **Same gap twice → step back**, the case split may be obscuring a unified
   argument. Three lines sometimes does what twelve pages couldn't.
5. **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.

---

## When to use which approach

The rest: https://github.com/anthropics/claude-plugins-official/blob/HEAD/plugins/math-olympiad/skills/math-olympiad/SKILL.md