math-olympiad

Solve IMO, Putnam, USAMO, and AIME problems with adversarial verification.

Updated Aug 23, 2026
One-click install
npx skills add https://github.com/hgonzalezstahl-blip/claude-arsenal --skill math-olympiad-hgonzalezstahl-blip
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: math-olympiad
Source: https://github.com/hgonzalezstahl-blip/claude-arsenal/tree/main/plugins/marketplaces/claude-plugins-official/plugins/math-olympiad/skills/math-olympiad
Command: npx skills add https://github.com/hgonzalezstahl-blip/claude-arsenal --skill math-olympiad-hgonzalezstahl-blip

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

This skill solves competition math problems (IMO, Putnam, USAMO, AIME) by applying adversarial verification to catch mistakes that slip through standard self-checks.

Core Features & Use Cases

  • Problem interpretation and problem scoping to identify intended readings.
  • Sequential solving with generation, self-improvement, self-verification, and adversarial verification.
  • Preparation for final presentation with LaTeX-ready proof.
  • Adversarial pattern awareness (Pattern #4, #18, #40) to stress-test solutions.

Quick Start

Provide a complete olympiad-style solution following the full workflow from interpretation to presentation.

Frequently Asked Questions about math-olympiad

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I solve olympiad math problems with adversarial verification?

Adversarial verification stress-tests olympiad solutions by applying pattern awareness to catch mistakes that slip through standard self-checks, using a multi-agent iterative revision loop with contingent checks before final presentation.

Can I use this to generate LaTeX proofs for IMO and Putnam problems?

Yes, a dedicated presentation stage prepares verified solutions as LaTeX-ready proofs. This applies to problems from IMO, Putnam, USAMO, and AIME after completing the adversarial verification workflow.

What is adversarial verification for math proofs?

Adversarial verification is a multi-agent iterative revision process that stress-tests solutions using specific pattern awareness to catch mistakes that standard self-checks miss, ensuring robust proof correctness.

Does this approach work for AIME and USAMO competition math problems?

Yes, the workflow explicitly supports AIME and USAMO problems alongside IMO and Putnam, scoping intended readings before generating and adversarially verifying solutions for robust correctness.

How does multi-agent iterative revision improve math olympiad solutions?

Multi-agent iterative revision improves olympiad solutions by cycling through generation, self-improvement, self-verification, and adversarial verification with contingent checks to stress-test proofs before final LaTeX presentation.