math-olympiad

Solves competition math problems using parallel solvers and adversarial multi-pass proof verification.

1|Updated Jul 6, 2015
One-click install
npx skills add https://github.com/ksolomon/dotfiles --skill math-olympiad-ksolomon
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: math-olympiad
Source: https://github.com/ksolomon/dotfiles/tree/main/AI/.claude/plugins/marketplaces/claude-plugins-official/plugins/math-olympiad/skills/math-olympiad
Command: npx skills add https://github.com/ksolomon/dotfiles --skill math-olympiad-ksolomon

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) and references (resource) components.

What problem does it solve? Competition math proofs (IMO, Putnam, USAMO, AIME) often contain subtle errors that self-verification misses, and AI solvers frequently bluff confident but wrong answers. This Skill orchestrates parallel solving agents with fresh-context adversarial verification to produce rigorously checked proofs or honest abstentions. ## Core Features & Use Cases - Parallel candidate generation: Launches 8-12 solver agents with varied starting angles, each internally iterating solve, self-improve, and self-verify cycles. - Adversarial verification: Fresh-context verifiers attack cleaned proofs using 12 specific failure patterns (tautological reductions, proves-too-much, one-line lemmas) with asymmetric 4-confirm/2-refute voting and early exit. - Calibrated abstention and deep mode: Says "no confident solution" rather than guessing, with an optional deep-mode agent allowing bounded local computation before abstaining. - Use Case: Given an IMO problem statement, the Skill generates multiple candidate proofs, strips reasoning traces, runs adversarial verification passes, revises holes up to 3 cycles, and compiles the verified proof into a LaTeX PDF. ## Quick Start Ask the assistant to solve this IMO problem and verify the proof adversarially before presenting it as a PDF.

Frequently Asked Questions about math-olympiad

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

FAQPage Schema
How do I verify a competition math proof for hidden errors?▼

Submit the problem statement and proof for adversarial verification, where fresh-context verifiers attack it using 12 specific failure patterns like tautological reduction and proves-too-much checks. A proof is confirmed only after 4 independent HOLDS verdicts and refuted by 2 HOLE FOUND verdicts.

How does this solve IMO or Putnam problems step by step?▼

It launches 8-12 parallel solver agents with different starting angles, each iterating solve, self-improve, and self-verify cycles. The best candidate is cleaned of reasoning traces, adversarially verified, revised up to 3 times if holes are found, then formatted into LaTeX.

Can it handle AIME numeric-answer problems?▼

Yes, numeric-answer problems skip the proof machinery entirely. It runs 5-7 solvers with varied approaches and takes a majority vote on the answer, verifying the top 2 candidates by substitution if no majority emerges.

Does it require LaTeX to produce output?▼

No, LaTeX is optional. The check_latex.sh script detects pdflatex or xelatex availability, and compile_pdf.sh compiles the verified proof into a PDF only when a compiler is present; otherwise the proof is delivered as LaTeX source.

What happens when it cannot solve a problem?▼

It abstains with a calibrated "no confident solution" verdict after 3 failed revise cycles, reporting what was tried, which partial results survived verification, and where the proof breaks. A deep-mode agent with bounded local computation runs once before the abstention is finalized.

Why does it forbid web search during solving?▼

Web lookup is banned because finding a solution on AoPS or a blog is not solving the problem and misrepresents actual capability. Only bounded local computation like modular arithmetic and small-case enumeration is permitted in deep mode.