Analysis
Limits as derivatives (), as Riemann sums (), as exponentials (); Stolz–Cesàro; Taylor with Lagrange remainder; the three series (, , ) and their derivatives; , ; telescoping with lag; Cauchy condensation; Abel summation .
Rewrite limits as one of the three shapes; expand in Taylor series to second order; swap sums and integrals only after stating the justification (absolute/uniform convergence, monotone or dominated convergence).
Feynman: ; Dirichlet and ; Gaussian and ; King ; Queen/Jack folding; Glasser ; the reflection; Frullani ; Gamma , , ; Beta ; ; log-sine ; ; ; Fresnel ; Wallis ; Weierstrass ; series expansion and swap.
Order of attack: symmetry (, ) → parameter (Feynman) → named shape (Frullani, Beta, Gamma, Dirichlet) → substitution (tangent, Weierstrass) → series. Never start with parts.
AM–GM, Cauchy–Schwarz (sums and integrals), Jensen, rearrangement, power means; Hermite–Hadamard for convex ; tangent-line trick; MVT-derived bounds (, , ).
Identify the equality case first; convert integral inequalities to their sum versions mentally, then apply the same proof.
Algebra
Matrix determinant lemma and ; Vandermonde ; circulant eigenvalues by DFT; tridiagonal Toeplitz eigenvalues ; , ; Cayley–Hamilton; rank–nullity, ; polynomial-entry matrices have rank ; ; spectral theorem and Rayleigh quotient; for all implies nilpotent.
Row-reduce two rows before any expansion. Look for identity-plus-low-rank. Move to the spectrum for anything involving powers or polynomials of a matrix.
Vieta and Newton; roots of unity filter; auxiliary polynomial with known roots for values at integers; Chebyshev; Eisenstein; . Orders and CRT; LTE; Legendre/Kummer; QR supplements and reciprocity; Wilson; multiplicative functions and ; bounding between squares. Lagrange's theorem; cyclic-group counts ( elements of order , one subgroup per divisor); orders in as lcm of cycle lengths; a polynomial over a field has at most roots; finite closed subsets are subgroups.
For values of a polynomial at consecutive integers, build the auxiliary polynomial. For group questions, use only closure, Lagrange, and counting — nothing heavier is expected.
Combinatorics, Probability & Geometry
Bijections; PIE; derangements; Catalan and the reflection principle; generating functions and ; Erdős–Szekeres; Mantel/Turán, Hall, Euler; extremal and pigeonhole; games (P/N, Nim, strategy stealing). Linearity with indicators; tail-integral ; order statistics ; coupon collector ; gambler's ruin , duration ; random walk returns ; first-step analysis.
Write indicator sums before distributions. For "expected time," write first-step equations. For random geometry, draw the region and integrate.
Pick's theorem; lattice points on a segment; Minkowski; Gauss circle count ; complex numbers (rotation, collinearity via real ratios, equilateral criterion ); point-to-line/plane distances; convexity (Helly, Carathéodory); continuous-motion IVT arguments.
Count lattice points by rows; prove existence by sweeping a parameter and invoking the IVT; reach for complex numbers when rotations appear.
Read twice. Restate the goal in your own words. List the givens. Pick a representation. Try small cases. Look for symmetry, an invariant, or an extremal object. Compute, then CHECK against a second method or a sanity bound.
At AMC 10/12 and AIME level, the second method is what separates a -second guess from a -second certainty: compute a probability two ways (complement and direct), a length via two theorems, a count via a recurrence and a formula. Casework must be organized by a stated criterion so nothing is double-counted; algebra must be checked by substituting back.