AMC 10 Step by Step

Formulas & Facts Cheat Sheet

Items marked (must) should be instant recall. Everything here appears repeatedly in AMC 10 problems 1–20.

Algebra

  • (must) Vieta for ax2+bx+cax^2+bx+c: roots sum to b/a-b/a, multiply to c/ac/a. Discriminant b24acb^2-4ac; a perfect square means rational roots.
  • (must) (a+b)2=a2+2ab+b2(a+b)^2 = a^2+2ab+b^2, a2b2=(ab)(a+b)a^2-b^2=(a-b)(a+b), a3±b3=(a±b)(a2ab+b2)a^3 \pm b^3 = (a \pm b)(a^2 \mp ab + b^2), (a+b+c)2=a2+b2+c2+2(ab+bc+ca)(a+b+c)^2 = a^2+b^2+c^2+2(ab+bc+ca).
  • Simon's Favorite Factoring Trick: xy+ax+by=(x+b)(y+a)abxy + ax + by = (x+b)(y+a) - ab.
  • a2+b2=(a+b)22ab=(ab)2+2aba^2+b^2 = (a+b)^2 - 2ab = (a-b)^2 + 2ab; 1a+1b=a+bab\frac{1}{a}+\frac{1}{b} = \frac{a+b}{ab}.
  • (must) Arithmetic series: n(first+last)2\frac{n(\text{first}+\text{last})}{2}; 1+2++n=n(n+1)21+2+\dots+n = \frac{n(n+1)}{2}; 12++n2=n(n+1)(2n+1)61^2+\dots+n^2 = \frac{n(n+1)(2n+1)}{6}.
  • (must) Geometric series: arn1r1a\frac{r^n-1}{r-1}; infinite a1r\frac{a}{1-r} for r<1|r|<1.
  • Telescoping: 1k(k+1)=1k1k+1\frac{1}{k(k+1)} = \frac{1}{k}-\frac{1}{k+1}.
  • Rate problems: work == rate ×\times time; combined rates add; average speed == total distance / total time (never the average of speeds).
  • Percent change compounds multiplicatively: up 20% then down 20% is ×0.96\times 0.96.
  • AM-GM: a+b2ab\frac{a+b}{2} \ge \sqrt{ab}, equality iff a=ba=b; product fixed → sum minimized when equal.
  • Absolute value: xa<r|x-a| < r means ar<x<a+ra-r < x < a+r; x|x| graphs are V-shapes; split into cases at the zeros.
  • Exponents: aman=am+na^m a^n = a^{m+n}, (am)n=amn(a^m)^n = a^{mn}, an=1/ana^{-n} = 1/a^n; ab=ab\sqrt{a}\sqrt{b} = \sqrt{ab}; logbx=y    by=x\log_b x = y \iff b^y = x.

Number theory

  • (must) Number of divisors of p1e1pkekp_1^{e_1}\cdots p_k^{e_k} is (e1+1)(ek+1)(e_1+1)\cdots(e_k+1); sum of divisors is piei+11pi1\prod \frac{p_i^{e_i+1}-1}{p_i-1}.
  • (must) gcd(a,b)lcm(a,b)=ab\gcd(a,b)\cdot\text{lcm}(a,b) = ab. Euclidean algorithm: gcd(a,b)=gcd(b,amodb)\gcd(a,b) = \gcd(b, a \bmod b).
  • (must) Divisibility rules: 2, 4, 8 (last 1, 2, 3 digits); 3, 9 (digit sum); 5, 10; 6 (2 and 3); 11 (alternating digit sum); 7 (double last digit, subtract from the rest).
  • Primes under 100: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 (25 of them). To test n<121n < 121 for primality, check divisibility by 2, 3, 5, 7 only.
  • Consecutive integers: product of kk consecutive integers is divisible by k!k!. A perfect square has an odd number of divisors and is 0\equiv 0 or 1(mod4)1 \pmod 4.
  • Last digits cycle: powers of 2 → 2,4,8,6; of 3 → 3,9,7,1; of 7 → 7,9,3,1; of 4 → 4,6; of 9 → 9,1. n5n(mod10)n^5 \equiv n \pmod{10}.
  • Repeating decimals: 0.ab=ab990.\overline{ab} = \frac{ab}{99}; 17=0.142857\frac{1}{7} = 0.\overline{142857}. A fraction in lowest terms terminates iff the denominator has only factors 2 and 5.
  • Base bb: the digits of nn are the remainders on repeated division by bb. Digit sum n(modb1)\equiv n \pmod{b-1}.
  • Squares to memorize: 112=121, 122=144, 132=169, 142=196, 152=225, 162=256, 172=289, 182=324, 192=361, 212=441, 232=529, 252=62511^2=121,\ 12^2=144,\ 13^2=169,\ 14^2=196,\ 15^2=225,\ 16^2=256,\ 17^2=289,\ 18^2=324,\ 19^2=361,\ 21^2=441,\ 23^2=529,\ 25^2=625. Powers of 2 up to 212=40962^{12}=4096. 210=10242^{10} = 1024.

Counting & probability

  • (must) n!n!, P(n,k)=n!(nk)!P(n,k) = \frac{n!}{(n-k)!}, (nk)=n!k!(nk)!\binom{n}{k} = \frac{n!}{k!(n-k)!}, (nk)=(nnk)\binom{n}{k}=\binom{n}{n-k}, k(nk)=2n\sum_k \binom{n}{k} = 2^n.
  • (must) Arrangements with repeats: n!a!b!\frac{n!}{a!\,b!\,\cdots}. Circular arrangements of nn: (n1)!(n-1)!. Necklaces (flips allowed): (n1)!/2(n-1)!/2.
  • (must) Stars and bars: nonnegative solutions of x1++xk=nx_1+\dots+x_k = n number (n+k1k1)\binom{n+k-1}{k-1}; positive solutions (n1k1)\binom{n-1}{k-1}.
  • (must) Inclusion-exclusion: AB=A+BAB|A\cup B| = |A|+|B|-|A\cap B|; three sets add back the triple intersection.
  • Complementary counting: "at least one" == total - "none". Adjacent objects: glue them into a block.
  • Lattice paths from (0,0)(0,0) to (m,n)(m,n) with right/up steps: (m+nm)\binom{m+n}{m}.
  • Probability: P=favorabletotalP = \frac{\text{favorable}}{\text{total}} when outcomes are equally likely; independent events multiply; P(A or B)=P(A)+P(B)P(A and B)P(A \text{ or } B) = P(A)+P(B)-P(A\text{ and }B).
  • Expected value is linear: E[X+Y]=E[X]+E[Y]E[X+Y] = E[X]+E[Y] even when dependent. Expected number of successes in nn trials with probability pp is npnp.
  • Two dice: 36 outcomes; sum ss has 6s76-|s-7| ways. Geometric probability: favorable region / total region.
  • Handshakes among nn people: (n2)\binom{n}{2}. Diagonals of an nn-gon: n(n3)2\frac{n(n-3)}{2}.

Geometry

  • (must) Triangle area: 12bh=12absinC=rs=s(sa)(sb)(sc)\frac{1}{2}bh = \frac{1}{2}ab\sin C = rs = \sqrt{s(s-a)(s-b)(s-c)} (Heron, ss = semiperimeter). Equilateral side aa: area 34a2\frac{\sqrt3}{4}a^2, height 32a\frac{\sqrt3}{2}a.
  • (must) Special right triangles: 4545-4545-9090 sides 1:1:21:1:\sqrt2; 3030-6060-9090 sides 1:3:21:\sqrt3:2. Pythagorean triples: (3,4,5), (5,12,13), (8,15,17), (7,24,25), (9,40,41), (20,21,29) and multiples.
  • (must) Similar triangles: corresponding sides in ratio kk, areas in ratio k2k^2; parallel line through a triangle cuts off a similar triangle.
  • Triangle inequality: a+b>ca+b>c. Angle bisector theorem: the bisector from AA divides BCBC in ratio AB:ACAB:AC. Medians meet at the centroid, which divides each median 2:12:1.
  • Right triangle altitude to the hypotenuse: h2=pqh^2 = pq, a2=pca^2 = pc (segments p,qp, q of the hypotenuse cc). Inradius of a right triangle: r=a+bc2r = \frac{a+b-c}{2}.
  • (must) Circles: circumference 2πr2\pi r, area πr2\pi r^2, arc length θ3602πr\frac{\theta}{360}\cdot 2\pi r, sector area θ360πr2\frac{\theta}{360}\pi r^2. Inscribed angle is half the central angle; angle in a semicircle is right; tangent \perp radius; two tangents from a point are equal.
  • Power of a point: PAPB=PCPDPA\cdot PB = PC \cdot PD for chords through PP; tangent-secant PT2=PAPBPT^2 = PA\cdot PB.
  • Polygon angles: sum (n2)180(n-2)\cdot 180^\circ; each exterior angle of a regular nn-gon is 360/n360^\circ/n. Regular hexagon of side aa: area 332a2\frac{3\sqrt3}{2}a^2.
  • Trapezoid area (b1+b2)2h\frac{(b_1+b_2)}{2}h; rhombus/kite area d1d22\frac{d_1 d_2}{2}. Shoelace for (x1,y1),(x_1,y_1),\dots: 12(xiyi+1xi+1yi)\frac12|\sum (x_i y_{i+1} - x_{i+1} y_i)|.
  • Coordinates: distance (Δx)2+(Δy)2\sqrt{(\Delta x)^2+(\Delta y)^2}; midpoint averages; perpendicular slopes multiply to 1-1; distance from (x0,y0)(x_0,y_0) to ax+by+c=0ax+by+c=0 is ax0+by0+ca2+b2\frac{|ax_0+by_0+c|}{\sqrt{a^2+b^2}}.
  • Solids: prism/cylinder volume == base area ×\times height; pyramid/cone 13\frac13 of that; sphere V=43πr3V=\frac43\pi r^3, S=4πr2S = 4\pi r^2; cube diagonal a3a\sqrt3; cone slant height r2+h2\sqrt{r^2+h^2}, lateral area πr\pi r \ell.
  • Reflections: shortest path that touches a line → reflect the endpoint across the line and draw a straight segment.

Statistics, logic, time

  • Mean == sum / count, so "mean is an integer" is a divisibility condition. Median of an even count averages the two middle values. Mode must appear most often (unique mode: strictly more).
  • Adding a value vv to a set of nn numbers with mean mm changes the mean by vmn+1\frac{v-m}{n+1}.
  • Clock hands: the minute hand moves 66^\circ per minute, the hour hand 0.50.5^\circ; they overlap every 72011\frac{720}{11} minutes. Angle at h:mh{:}m is 30h5.5m|30h - 5.5m|.
  • Calendar: 365 days =52= 52 weeks +1+ 1 day, so the same date moves one weekday forward per year (two after a leap day). Leap years: divisible by 4, except centuries not divisible by 400.