math-olympiad

Solve competition math problems with rigorous proofs and verified solutions.

Updated Apr 13, 2026

Search Tags:#counterexample #adversarial reasoning #olympiad #laTeX #proof verification #competition math

Ready to run

npx skills add https://github.com/Wizarck/eligia-skills --skill math-olympiad-wizarck

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: math-olympiad
Source: https://github.com/Wizarck/eligia-skills/tree/main/claude-plugins-official/plugins/math-olympiad/skills/math-olympiad
Command: npx skills add https://github.com/Wizarck/eligia-skills --skill math-olympiad-wizarck

SYSTEM DOCUMENTATION & REQUIREMENTS

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

What problem does it solve?

This Skill helps you solve and verify competition math problems without bluffing, especially when the answer depends on a rigorous proof, a careful counterexample, or a calibrated refusal to guess.

Core Features & Use Cases

Proof solving: Work through IMO, Putnam, USAMO, and similar olympiad problems with structured reasoning.
Adversarial verification: Re-check proofs from a fresh perspective to catch hidden gaps, wrong interpretations, and misleading shortcuts.
Honest abstention: When a problem is not fully solved, it preserves partial results instead of inventing certainty.
Presentation cleanup: After a proof is verified, it can be rewritten into a cleaner final form for sharing or publication.

Quick Start

Ask the math olympiad skill to solve the attached competition problem and return a verified proof with a confidence assessment.

Frequently Asked Questions about math-olympiad

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

FAQPage Schema

How do I verify competition math proofs for IMO or Putnam problems?▼

Verifying competition math proofs requires applying pure reasoning and adversarial fresh-context checks to catch hidden gaps or misleading shortcuts. The proof is re-examined from a new perspective to ensure rigorous validation before returning a confidence assessment.

Can I get a counterexample for an olympiad inequality problem?▼

Finding a counterexample for olympiad inequalities involves applying adversarial reasoning to test if a proposed statement fails under specific conditions. This approach identifies precise scenarios where the inequality breaks down, replacing unverified guesses with concrete disproof.

How do I solve USAMO and AIME contest problems step by step?▼

Solving USAMO and AIME contest problems involves producing structured proofs through pure reasoning, followed by adversarial verification to confirm validity. When a problem resists full solution, honest abstention preserves partial results instead of inventing false certainty.

What is adversarial verification in proof checking?▼

Adversarial verification in proof checking re-evaluates a completed proof from a fresh context to expose hidden gaps, wrong interpretations, and misleading shortcuts. This rigorous re-check ensures the contest math solution holds up under strict scrutiny before final confirmation.

Does proof verification support LaTeX presentation for sharing?▼

Proof verification supports optional LaTeX presentation after a proof is confirmed and polished. This presentation cleanup rewrites the verified solution into a cleaner final form suitable for sharing or publication, ensuring mathematical formatting is precise.

Why does my competition math solver return a partial result instead of an answer?▼

Partial results instead of final answers occur through calibrated abstention, which preserves honest partial findings when a problem is not fully solved. This mechanism prevents inventing false certainty in competition math proofs, ensuring rigorous integrity over bluffing.