Formulas & Methods

Study Sheet

Formulas & Methods

The USAMO reference: every tool, with the proof-level method that wields it

Algebra & Inequalities

Tip
Inequalities

AM–GM (weighted too); Cauchy–Schwarz and Engel; QM–AM–GM–HM; power means; Jensen; rearrangement and Chebyshev; Schur; SOS; Hölder (ai3)(bi3)(ci3)(aibici)3\left(\sum a_i^3\right)\left(\sum b_i^3\right)\left(\sum c_i^3\right) \ge \left(\sum a_ib_ic_i\right)^3; Muirhead for symmetric sums; tangent-line trick; smoothing.

Locate the equality case; homogenize; choose the inequality whose equality case matches; finish with SOS if stuck. Write the equality condition explicitly in the proof.

Tip
Polynomials and functional equations

Vieta and Newton; abP(a)P(b)a - b \mid P(a) - P(b); rational root theorem; Eisenstein and mod-pp irreducibility; Lagrange interpolation and finite differences; roots of unity filter; Chebyshev polynomials for boundedness. FE: substitutions (00, 11, x-x, 1x\tfrac1x, x=yx = y), Cauchy's equation on Q\mathbb Q and with regularity on R\mathbb R, injectivity/surjectivity lemmas, fixed points, subtracting a particular solution.

Reminder — Vieta's formulas:r1+r2=ba,r1r2=car_1+r_2=-\frac{b}{a},\qquad r_1 r_2=\frac{c}{a}

Verify every FE candidate in the original equation. For polynomials, compare degrees and leading coefficients, count roots, and use integer-value constraints.

Number Theory & Combinatorics

Tip
Number theory

Orders, primitive roots, CRT; Fermat, Euler, Wilson; LTE (all cases); Legendre, Kummer; quadratic residues, Euler's criterion, reciprocity and both supplements; Vieta jumping; infinite descent; Zsigmondy (citable); gcd(am1,an1)\gcd(a^m - 1, a^n - 1); sums over divisors and Möbius inversion; pp-adic valuation bookkeeping; bounding between consecutive powers.

Reduce mod 4,8,9,7,164, 8, 9, 7, 16 first; then valuations; then orders. For "pan+1p \mid a^n + 1", the order of aa must be even. For symmetric quadratic Diophantines, Vieta jump from a minimal solution.

Tip
Combinatorics

Pigeonhole (all forms); extremal principle; invariants and monovariants; colorings and weightings; double counting; bijections; induction on structures; PIE; generating functions; Catalan and reflection; Erdős–Szekeres; graph theory (degrees, trees, bipartite, Mantel/Turán, Hall, Euler's formula); games (backward induction, P/N positions, Nim and XOR, symmetry and strategy stealing).

Ask: what never changes (invariant)? what only decreases (monovariant)? which object is extreme? which two things can I count? If the problem is a game, build the P/N table backward and prove the pattern.

Geometry

Tip
Synthetic and analytic geometry

Angle chasing and cyclic quadrilaterals (opposite angles, equal inscribed angles, the exterior-angle criterion); power of a point and radical axes/center; Ptolemy (and its inequality); Brahmagupta; Ceva and Menelaus (trig forms too); Stewart, Apollonius, angle-bisector length; incircle tangent lengths sas - a; Euler line and nine-point circle; homothety; spiral similarity and Miquel points; inversion; the British flag theorem; complex numbers on the unit circle; barycentric coordinates for cevian-heavy problems.

Find the circle. Then: inscribed angles, power of a point, Ptolemy — in that order. Concurrency: Ceva (trig form for angles). Collinearity: Menelaus or a well-chosen homothety. Bash only when the configuration is tame, and set up coordinates to exploit symmetry.

Concept
The proof-writing method

Restate the claim; fix notation; prove lemmas before use; name every theorem; cover every case (including degenerate ones); state the equality condition; conclude.

A USAMO solution is a piece of technical writing. Numbered steps, one idea per paragraph, every "clearly" replaced by a reason. After writing, read it as a hostile grader looking for the step you skipped.