W14 · Mastery gates26–30 hrs

Week 14 of 28 · Mastery · due 2026-08-29 · 26–30 hrs

A1/B1 Slot Mastery

A1/B1 Slot Mastery gate complete

Train this week in the trainer →

This week's lesson · 10 min read

not started · read first, then train the gates

A1/B1 slot mastery, and complex numbers take over geometry

A1 and B1 are the exam's front doors: designed to be solved, worth the same ten points as the monsters, and the single highest-leverage slots for a top-200 score. This week trains them as a genre — because they ARE one, with recurring shapes and a designed 'aha' that is usually one observation deep. The new mathematics is complex numbers in geometry: the method that turns rotation arguments into one-line multiplications and makes synthetic configuration problems computable.

Easy slots are a genre with conventions: learn the conventions and A1/B1 become twenty banked points, not two fresh gambles.

Key ideas — the week on one card

  1. A1/B1 problems hide ONE observation a few small cases deep — compute three data points before theorizing.
  2. 'Determine all' is always two proofs: the obstruction AND the construction achieving everything else.
  3. Rotation is multiplication: equilateral (one orientation) is the linear condition $a + \omega b + \omega^2 c = 0$ with $\omega = e^{2\pi i/3}$.
  4. Ceva: cevians concur iff the signed ratio product is $+1$; Menelaus: collinear cuts have product $-1$ — concurrence vs collinearity.

1The A1/B1 genre: what 'easy' actually means

Study the pattern catalog and a shape emerges: A1/B1 problems have SHORT statements, small or concrete objects (a specific year number, a small board, an explicit function), and exactly one hidden observation that collapses them — parity, a telescoping product, a clever pairing, a symmetry, an extreme case. They are engineered so that ANY systematic entry (try $n = 1, 2, 3$; check the extreme case; compute the first few terms) walks into the observation within minutes.

The professional's opening is always the same: MAKE THE PROBLEM CONCRETE. Plug in small values, draw the $n = 3$ case, compute the product for three terms. A1/B1 designers hide the pattern one or two examples deep — the solver who computes three data points and stares beats the solver who theorizes for ten minutes, essentially always.

Time discipline for these slots: target 20-25 minutes including write-up. If a supposed A1 resists for 30, you have either missed the intended observation (reread the EXACT statement — these problems are worded precisely, and 'positive integer', 'distinct', 'nonzero' are usually load-bearing) or you are overcomplicating; the intended solution almost never needs machinery beyond Week 8.

Worked example

(Putnam 2019 A1 type) Determine all possible values of $a^3 + b^3 + c^3 - 3abc$ where $a, b, c$ are nonnegative integers.

  1. Nudge 1

    Factor $a^3+b^3+c^3-3abc$ first, then sweep small triples and record which values refuse to appear.

    Reveal step 1

    Concrete first: the expression factors — $a^3+b^3+c^3-3abc = (a+b+c)(a^2+b^2+c^2-ab-bc-ca) = \frac{1}{2}(a+b+c)\left((a-b)^2+(b-c)^2+(c-a)^2\right)$. Compute small cases: $(0,0,0) \to 0$, $(1,0,0) \to 1$, $(1,1,0) \to 2$, $(2,1,0) \to 9$, $(2,1,1) \to 4$, $(2,2,1) \to 5$... values $0,1,2,4,5,9$ appear; 3 and 6 stubbornly refuse.

  2. Nudge 2

    Chase the refusals mod 9: what happens when $3 \mid a+b+c$?

    Reveal step 2

    Pattern to conjecture: every nonnegative integer EXCEPT those $\equiv 3 \pmod 9$... check: can we rule out 3? Mod 9, cubes are $0, \pm 1$, so $a^3+b^3+c^3-3abc \pmod 9$: the factored form helps more — if $a+b+c \equiv 0 \pmod 3$ then both factors are divisible by 3 (second factor $= (a+b+c)^2 - 3(ab+bc+ca)$), so the product is $\equiv 0 \pmod 9$; if $a+b+c \not\equiv 0$, the value can be anything it hits. So values divisible by 3 but not 9 are IMPOSSIBLE.

  3. Nudge 3

    Near-equal families do the constructing: $(n{+}1,n,n)$, $(n{+}1,n{+}1,n)$, and $(n{+}1,n{-}1,n)$ — compute what each achieves.

    Reveal step 3

    Construct the rest: $(n{+}1, n, n)$ gives $\frac{1}{2}(3n+1)(2) = 3n+1$ and $(n{+}1, n{+}1, n)$ gives $3n+2$ — all values $\not\equiv 0 \pmod 3$. For multiples of 9: $(n{+}1, n{-}1, n)$ gives $\frac{1}{2}(3n)(6) = 9n$. Answer: all nonnegative integers not of the form $9k \pm 3$. Two small-case sweeps, one factorization, one mod check — the complete A1 anatomy.

  4. Answer

    All $n \ge 0$ with $n \not\equiv \pm 3 \pmod 9$: factor, scan small cases, prove the obstruction mod 9, construct everything else with near-equal triples.

Pitfall. Skipping the construction half. 'Impossible when $3 \| n$' is half the problem; A1 graders want BOTH the obstruction and the explicit families that achieve everything else. Determine-all problems are always two proofs.

2Complex numbers in geometry: rotation as multiplication

The dictionary: a point is a complex number; translation is addition; rotation by $\theta$ about the origin is multiplication by $e^{i\theta}$; rotation about $p$ is $z \mapsto p + e^{i\theta}(z - p)$. The instant payoffs: three points are collinear iff $\frac{a - b}{a - c} \in \mathbb{R}$; angles at a vertex become arguments of quotients; 'equilateral' becomes the crisp identity $a + \omega b + \omega^2 c = 0$ (for one orientation, with $\omega = e^{2\pi i/3}$) or equivalently $a^2+b^2+c^2 = ab+bc+ca$ covering both.

The method shines when the problem is built from rotations, midpoints, and centroids — squares erected on sides, equilateral triangles on edges (Napoleon configurations), spiral similarities. Each construction is one line of algebra ('the square on $AB$ outward has center $\frac{a+b}{2} + \frac{i}{2}(b-a)$'), and the conclusion is an identity you EXPAND rather than a diagram you stare at. What synthetic geometry calls insight, complex bashing calls collecting terms.

Know when NOT to use it: heavy circle-intersection problems want the unit-circle setup (put the circumcircle at $|z| = 1$, where reflections and feet of perpendiculars have clean formulas: the reflection of $z$ over chord $ab$ is $a + b - ab\bar{z}$) — and problems with many unrelated circles or lengths-only conclusions often stay synthetic or go to coordinates. The Week 14 drill builds the judgment: bash three, do one synthetically, compare costs.

any triangle (gold) — yet the three centers (oxblood) always close equilaterally
Napoleon's theorem, rendered from the actual rotation algebra — change the gold triangle and the oxblood one stays equilateral.

Worked example

Napoleon's theorem: erect equilateral triangles outward on the sides of any triangle $ABC$; show their centers form an equilateral triangle.

  1. Nudge 1

    Encode 'equilateral on segment $BC$' as one linear equation in $\omega$ and solve for the center.

    Reveal step 1

    Set up: let $\omega = e^{2\pi i/3}$, so 'equilateral (one orientation)' is the linear condition $x + \omega y + \omega^2 z = 0$. The outward equilateral triangle on segment $BC$ has apex $p$ with $p + \omega c + \omega^2 b = 0$ — solve: the center is $o_A = \frac{b + c + p}{3} = \frac{b + c - \omega c - \omega^2 b}{3}$.

  2. Nudge 2

    Cycle the formula to write all three centers.

    Reveal step 2

    Write all three centers by cycling: $o_A = \frac{(1-\omega^2)b + (1-\omega)c}{3}$, $o_B = \frac{(1-\omega^2)c + (1-\omega)a}{3}$, $o_C = \frac{(1-\omega^2)a + (1-\omega)b}{3}$.

  3. Nudge 3

    Test the equilateral condition on the centers and let $\omega^3 = 1$ collapse every bracket.

    Reveal step 3

    Test the equilateral condition: $o_A + \omega o_B + \omega^2 o_C = \frac{1}{3}\left[a(\omega(1-\omega) + \omega^2(1-\omega^2)) + b((1-\omega^2) + \omega^2(1-\omega)) + c((1-\omega) + \omega(1-\omega^2))\right]$. Each bracket collapses using $\omega^3 = 1$: the $b$-coefficient is $1 - \omega^2 + \omega^2 - \omega^3 = 1 - 1 = 0$, the $a$-coefficient $\omega - \omega^2 + \omega^2 - \omega^4 = \omega - \omega = 0$, the $c$-coefficient likewise. Zero — equilateral, for EVERY starting triangle, with no diagram consulted.

  4. Answer

    $o_A + \omega o_B + \omega^2 o_C = 0$ identically: a celebrated theorem reduced to $\omega^3 = 1$ applied three times.

Pitfall. Orientation errors. $x + \omega y + \omega^2 z = 0$ encodes ONE rotational orientation; the other is $x + \omega^2 y + \omega z = 0$. 'Outward' vs 'inward' triangles differ exactly here — fix the convention with one concrete check (an actual equilateral triangle with known vertices) before trusting the algebra.

3Ceva, Menelaus, and the triangle toolbox

Ceva's theorem: cevians $AD, BE, CF$ of a triangle concur iff $\frac{BD}{DC} \cdot \frac{CE}{EA} \cdot \frac{AF}{FB} = 1$ (signed ratios). Menelaus: a line cuts the (extended) sides in points with the same product equal to $-1$. Mnemonic that keeps them straight: Ceva is about CONCURRENCE (three cevians through one point), Menelaus about COLLINEARITY (one line through three sides). Both convert incidence statements into ratio bookkeeping.

The trig form of Ceva ($\prod \frac{\sin \angle BAD}{\sin \angle DAC} = 1$) handles cevians specified by angles — bisectors, isogonals, symmedians — without ever finding the feet. Between the two forms, most 'show these three lines meet' problems on the exam become mechanical: name the ratios, multiply, cite the theorem.

Inversion earns a recognition-level entry (full drills come later): it is the map $z \mapsto \frac{r^2}{\bar{z}}$ fixing a circle, exchanging lines-through-center with circles-through-center. The cue is a configuration drowning in circles through a common point — inverting AT that point turns them all into lines. For now, learn to SPOT the cue; execution reps are scheduled with the geometry intensive.

Worked example

Prove the medians of a triangle concur, by Ceva.

  1. Nudge 1

    Medians hit midpoints — write each Ceva ratio.

    Reveal step 1

    Medians hit midpoints: $D, E, F$ are the midpoints of $BC, CA, AB$, so each ratio $\frac{BD}{DC} = \frac{CE}{EA} = \frac{AF}{FB} = 1$.

  2. Nudge 2

    Multiply the three ratios and quote the theorem.

    Reveal step 2

    The Ceva product is $1 \cdot 1 \cdot 1 = 1$; the cevians concur — at the centroid.

  3. Nudge 3

    The same three-line script proves bisectors and altitudes concur — note the template.

    Reveal step 3

    The point of the exercise is the TEMPLATE, not the theorem: angle bisectors ($\frac{BD}{DC} = \frac{AB}{AC}$ by the bisector ratio, product telescopes to 1) and altitudes (ratios via right-triangle cosines) fall to the identical three-line script. One theorem, whole families of concurrence.

  4. Answer

    All three ratios are 1; Ceva closes it. The same script proves bisectors and altitudes concur — learn it as a template.

Pitfall. Dropping signs when points leave the segments. Menelaus REQUIRES a negative product ($-1$) with signed ratios — an external division you treated as internal silently flips the verdict. Draw the configuration once, mark which divisions are external, then compute.

Before you open the gates

  • A1/B1 opening: concrete cases first, exact wording second, machinery last. Target 20-25 minutes with write-up.
  • 'Determine all' = obstruction proof PLUS construction — every time.
  • Rotation-built configurations (squares/equilaterals on sides, spiral similarity) → complex numbers; expand, don't stare.
  • Fix the $\omega$-orientation convention with a concrete check before the algebra, not after.
  • Concurrence → Ceva (trig form for angle-specified cevians); collinearity → Menelaus with signs; circles through a common point → note inversion as the future tool.

Check yourself

1. The single most reliable opening move on an A1/B1 is:

2. DISTINCT points $a, b, c$ in the plane form an equilateral triangle (either orientation) iff:

3. Ceva vs Menelaus, in one line:

Practice ladder — three rungs, rising

Each rung: attempt cold, one hint if stuck, worked resolution only after a real try.

Rung 1 (roots of unity, direct). Let $a, b, c$ be three distinct points on the unit circle $|z|=1$. Prove that they form an equilateral triangle if and only if $a+b+c=0$.

One hint

For ($\Leftarrow$) use $|w|^2=w\bar w$: from $a+b=-c$ compute $|a+b|^2=1$ to pin $\operatorname{Re}(a\bar b)$, then get $|a-b|^2$. For ($\Rightarrow$) the circumcenter of points on $|z|=1$ is the origin, and an equilateral triangle's circumcenter is its centroid.

Worked resolution

($\Leftarrow$) Suppose $|a|=|b|=|c|=1$ and $a+b+c=0$. Then $a+b=-c$, so $|a+b|^2=|c|^2=1$. But $|a+b|^2=|a|^2+|b|^2+2\operatorname{Re}(a\bar b)=2+2\operatorname{Re}(a\bar b)$, forcing $\operatorname{Re}(a\bar b)=-\tfrac12$. Hence $|a-b|^2=2-2\operatorname{Re}(a\bar b)=3$. The same computation on the pairs $\{b,c\}$ and $\{c,a\}$ (using $b+c=-a$ and $c+a=-b$) gives $|b-c|=|c-a|=\sqrt3$ as well, so the triangle is equilateral. ($\Rightarrow$) The three points lie on $|z|=1$, whose center $0$ is therefore their circumcenter; for an equilateral triangle the circumcenter coincides with the centroid $\tfrac{a+b+c}{3}$, so $a+b+c=0$. [Source: Andreescu, Complex Numbers from A to Z, Ch. 3-4 — this week's complex-numbers-in-geometry gate (roots of unity and regular polygons).]

Rung 2 (Ceva, applied). Using Ceva's theorem, prove that the three internal angle bisectors of a triangle $ABC$ are concurrent.

One hint

The bisector from $A$ meets $BC$ at $D$ with $\tfrac{BD}{DC}=\tfrac{AB}{AC}$ (angle-bisector theorem). Write the three such ratios with the standard labels $a=BC,\ b=CA,\ c=AB$ and multiply.

Worked resolution

Let $D,E,F$ be the feet on $BC, CA, AB$ of the internal bisectors from $A,B,C$, and set $a=BC,\ b=CA,\ c=AB$. The angle-bisector theorem gives $\tfrac{BD}{DC}=\tfrac{AB}{AC}=\tfrac{c}{b}$, $\tfrac{CE}{EA}=\tfrac{BC}{BA}=\tfrac{a}{c}$, and $\tfrac{AF}{FB}=\tfrac{CA}{CB}=\tfrac{b}{a}$. Their product is $\tfrac{c}{b}\cdot\tfrac{a}{c}\cdot\tfrac{b}{a}=1$, and each foot divides its side internally (all signed ratios positive), so by Ceva's theorem the cevians $AD, BE, CF$ concur — at the incenter. [Source: this week's triangle-toolbox gate — Ceva and Menelaus with signed ratios, applied to a concurrence exactly as the medians example was.]

Rung 3 (complex bash, done solo). On sides $AB$ and $AC$ of triangle $ABC$, erect squares $ABDE$ and $ACFG$ externally (vertices named in order around each square, so $E$ and $G$ are the square-vertices adjacent to $A$). Let $M$ be the midpoint of $BC$. Prove that $EG=2\,AM$ and $EG\perp AM$.

One hint

Put the points in $\mathbb{C}$. Reading each external square's vertices in order encodes $E=A-i(B-A)$ and $G=A+i(C-A)$ (a $90^\circ$ turn each way, opposite senses). Compute $G-E$ and compare with $M-A$.

Worked resolution

Work in $\mathbb{C}$. Reading each square's vertices in order with the squares external, the vertices adjacent to $A$ are the quarter-turns $E=A-i(B-A)$ and $G=A+i(C-A)$; the two turns have opposite sense because the sides $AB$ and $AC$ leave $A$ on opposite rotational sides. Then $G-E=\big(A+i(C-A)\big)-\big(A-i(B-A)\big)=i\big((C-A)+(B-A)\big)=i\,(B+C-2A)$. Since $M=\tfrac{B+C}{2}$, we have $B+C-2A=2(M-A)$, so $G-E=2i\,(M-A)$. Thus the vector $\vec{EG}=2i\,\vec{AM}$: multiplication by $2i$ scales length by $2$ and rotates by $90^\circ$, giving $EG=2\,AM$ and $EG\perp AM$. (Choosing the opposite global orientation replaces $i$ by $-i$ throughout and changes neither conclusion.) [Source: this week's complex-numbers geometry drill — squares erected externally on the sides / spiral similarity (Evan Chen, EGMO Complex Numbers chapter).]

Prove it — constructed response

Prove that three distinct complex numbers $a, b, c$ are the vertices of an equilateral triangle if and only if $a^2 + b^2 + c^2 = ab + bc + ca$. Write $\omega = e^{2\pi i/3}$; make explicit how the two orientations of the triangle enter, and justify the geometric step (the passage between the algebraic condition and an actual $60^\circ$ rotation), not merely the algebra.

The gates

A1/B1 Pattern Catalog (review before drilling)

- Review gate (depth): A1/B1 Pattern Catalog (review before drilling)

sources & assignments (5)

New Topic

New Topic: Complex Numbers in Geometry + Triangle Toolbox (rotation · Ceva/Menelaus · inversion recognition)

- New-topic extension (continuous learning alongside weak-topic review): New Topic: Complex Numbers in Geometry (rotation · regular polygons)

why this gate: the lesson's §2 Complex numbers in geometry: rotation as multiplication is what it trains

sources & assignments (8)
  • Problems AndreescuComplex Numbers from A to Z — Ch. 3 probs 1, 4 (prob 7's slot displaced to the triangle toolbox)Putnam
  • Problems Triangle toolbox (self-contained)(1) Ceva + Menelaus: state both with signed ratios; prove Ceva via the area-ratio argument; apply Ceva once to show the medians concur. (2) Inversion, recognition only: define inversion about a circle of radius r (P ↦ P' with OP·OP' = r²); write the image table (line through center ↦ itself; line not through center ↦ circle through center; circle through center ↦ line; other circles ↦ circles); one sentence on the recognition trigger — tangency and circles-through-a-common-point collapse under inversion. No inversion problem reps assigned: recognition, not a course. (3) Statement ledger, ~10 min: write from memory the law of sines (with the circumradius form a/sin A = 2R), the law of cosines, and Heron's formula; one recognition line on barycentric coordinates (what they are, when they beat synthetic — cevian-heavy configurations); note that the polyhedral Euler characteristic V − E + F = 2 is the same theorem as W7's planar Euler formula via the sphere projection. Also, recognition-level: (a) a degree-n complex polynomial has exactly n roots with multiplicity (fundamental theorem of algebra), and non-real roots of a real polynomial come in conjugate pairs; (b) a Möbius transformation z ↦ (az+b)/(cz+d) maps lines-and-circles to lines-and-circles — recognition trigger: configurations of circles through a common point.Putnam

AMC/AIME Speed Warmup

AMC/AIME Speed Warmup (build pattern recognition + speed)

- AMC/AIME speed warmup — fast pattern-recognition reps; not full Putnam difficulty.

sources & assignments (5)
  • Source Spivak — Calculus — Week reference — this gate applies this week's lead material (“Deep Study — Analysis foundations under contest pressure (new depth, not review)”). If an attempt stalls, the repair source is here.
  • Source MIT 18.100B Lecture 11 — Extreme & Intermediate Value Theorems (OCW) — Week reference — this gate applies this week's lead material (“Deep Study — Analysis foundations under contest pressure (new depth, not review)”). If an attempt stalls, the repair source is here.
  • Source MIT 18.100B Lecture 16 — Rolle, MVT, Taylor Expansion (OCW) — Week reference — this gate applies this week's lead material (“Deep Study — Analysis foundations under contest pressure (new depth, not review)”). If an attempt stalls, the repair source is here.
  • Source Supplemental — Lupu TTU MATH 4000, Lecture 6 (direct) — Writeup companion for “AMC/AIME Speed Warmup (build pattern recognition + speed)” — attend to how each claim is justified aloud; steal one justification phrase for this gate's written artifact.
  • Problems Archive (hand-picked)3 AMC/AIME geometry speed reps (open each below) · ~8 min eachAMC/AIME · archive: 2021 AMC 10 BAMC 12 AAMC 12 B

Archive Block — A1/B1 Speed

Archive Block — A1/B1 Speed

- Do: 10 Putnam A1 · all topics · rotate topic each problem · 10 min each - Do: 10 Putnam B1 · all topics · rotate topic each problem · 10 min each

sources & assignments (8)
  • Problems 10 Putnam A1 · all topics · rotate topic eachPutnam 2018 A1, 2017 A1 · mixed · 10 min eachPutnam
  • Problems 10 Putnam B1 · all topics · rotate topic eachPutnam 2024 B1, 2022 B1 · mixed · 10 min eachPutnam

Spiral Reinforcement

Spiral Reinforcement

- Archive: 2 · Analysis + 2 · Combinatorics + 2 · NT + 2 · Geometry + 2 · LA · A1/B1 · 10 min each

sources & assignments (5)
  • Problems Archive BrowserPutnam 2014 B1 · Analysis · 10 min eachPutnam

archive pull: 1 problems · Analysis · A1/B1 · Standard · 10 min

USAMO/IMO Bridge — IMO 1959/1

USAMO/IMO Bridge — IMO 1959/1 (stretch) accelerated only

Ritual: Self-grade 0–7 against the AoPS/official solution: 7 = complete and rigorous · 5–6 = right idea, rigor gaps · 3–4 = key lemma proven · 1–2 = nontrivial progress · 0 = none. Log the score and the single biggest missing idea in the verify box.

sources & assignments (6)
  • Problems IMO 1959/1Prove 21n+4 / 14n+3 is irreducible for every natural n — full writeup to the Evan Chen standard, 45 min cap. Self-grade 0–7 against the AoPS/official solution: 7 = complete and rigorous · 5–6 = right idea, rigor gaps · 3–4 = key lemma proven · 1–2 = nontrivial progress · 0 = none. Log the score and the single biggest missing idea in the verify box.USAMO bridge

Continuation — Abstract Algebra

Continuation — Abstract Algebra: permutations & the symmetric group (≈2 hrs)

Ritual: Thread: Abstract Algebra (reinstated lane). A required ~2-hr continuation, swapped from NT-QR-II for permutation-group depth — new material, problem-first.

sources & assignments (6)
  • Source MIT 18.A34 — cong.pdf (Yufei Zhao) — Continuation-lane companion for: NT: Quadratic Residues II (≈2 hrs). Reused from the verified pool — watch/read with this week's lens.
  • Source Michael Penn — Number Theory v2 (playlist) — Continuation-lane companion for: NT: Quadratic Residues II (≈2 hrs). Reused from the verified pool — watch/read with this week's lens.
  • Source Supplemental — Lupu TTU MATH 4000, Lecture 6 (direct) — Pacing companion for “Continuation — NT: Quadratic Residues II (≈2 hrs)” — note when the presenter abandons a line; compare with your own bail rule before starting this gate's timed work.
  • Source Supplemental — Lupu TTU MATH 4000, Recitation 6 (direct) — Writeup companion for “Continuation — NT: Quadratic Residues II (≈2 hrs)” — attend to how each claim is justified aloud; steal one justification phrase for this gate's written artifact.
  • Source Michael Penn — Abstract Algebra (playlist) — Companion lecture series for this week's abstract-algebra rep — watch the relevant 1–2 videos, then do the written rep below. Watch-for: this playlist opens with set-theory / proof-writing videos — skip to the 'Abstract Algebra |' entries for the group/ring/field content this gate needs.
  • Problems Continuation lane — Abstract AlgebraWork in Sₙ: (1) write (1 3 5)(2 4) and (1 2 3 4 5) in cycle notation, compute their product and its order; (2) decompose a given permutation into transpositions and determine its sign (parity); (3) prove the sign map Sₙ → {±1} is a well-defined homomorphism (any two transposition decompositions of the same permutation have equal parity); (4) find the subgroup of S₄ generated by (1 2) and (1 2 3 4) and identify its order. Displaces the Quadratic-Residues-II continuation — QR stays warm in the W12/W17 rotations.Standard

Keep-Warm Rotation — complex / roots of unity · asymptotics · orders / FLT

Keep-Warm Rotation — complex / roots of unity · asymptotics · orders / FLT (30 min)

Ritual: If any micro-rep took over 10 minutes or failed, that family goes on this week's repair list — it was rusting.

why this gate: the lesson's §2 Complex numbers in geometry: rotation as multiplication is what it trains

sources & assignments (2)
  • Problems Keep-warm rotationThree 10-minute micro-reps, no notes: (1) complex / roots of unity — one roots-of-unity filter rep, or re-derive the sum of the n-th roots of unity; (2) asymptotics — one bound via weak Stirling, or re-derive log n! ≈ n log n − n by integral comparison; (3) orders / FLT — one rep where 'consider the order of a mod p' is the key. The dormancy rule: no tool family sleeps longer than 2 weeks — these are the three most overdue right now.Standard

archive pull: 1 problems · Algebra/Analysis/Number Theory · A1/B1 · Putnam · 10 min

Verify

Verify: audit one proof before closing

- After every 5 problems: re-check one solution for (1) false claim (2) missing case (3) wrong bound

Ritual: - After every 5 problems: re-check one solution for (1) false claim (2) missing case (3) wrong bound

sources & assignments (4)

Deep Study — Analysis foundations under contest pressure

Deep Study — Analysis foundations under contest pressure (new depth, not review)

Mastery-phase learning gate: this is NEW depth to solidify the toolkit, not review. The consistency drills stay primary; this gate is the 30-40 min/day study block.

Ritual: Output: 3 theorem-trigger cards + 1 closed-book re-derivation (ratio test or alternating bound) checked against the text.

sources & assignments (8)

Geometry Drill: Complex Numbers Method (rotation · spiral similarity)

unlocks after: New Topic: Complex Numbers in Geometry + Triangle Toolbox (rotation · Ceva/Menelaus · inversion recognition)

W14 introduces the complex-numbers-in-geometry topic but had no dedicated rep set. This drills rotation / spiral similarity / collinearity until the method is automatic.

why this gate: the lesson's §2 Complex numbers in geometry: rotation as multiplication is what it trains

sources & assignments (6)
  • Source Evan Chen — EGMO, Complex Numbers chapter — Points as complex numbers: rotation by e^{iθ}, the spiral-similarity/ratio test, collinearity & concyclicity criteria, the shoelace area in ℂ.
  • Source Complex-number geometry cheat sheet — Rotation about p: z ↦ p + (z−p)e^{iθ}. Collinear a,b,c ⇔ (a−b)/(a−c) ∈ ℝ. Concyclic ⇔ cross-ratio ∈ ℝ. Equilateral ⇔ a+ωb+ω²c=0.
  • Source Complex numbers in geometry — Rotation, spiral similarity, and the collinearity/concyclicity tests worked on contest problems.
  • Problems EGMOEvan Chen EGMO — Complex Numbers chapter, worked problems 1–4 (rotation / equilateral / collinearity)Putnam
  • Problems Complex drillProve: the centers of squares erected externally on the sides of any quadrilateral form a figure whose diagonals are equal and perpendicular (Van Aubel via complex numbers).Putnam
  • Problems MAA archivePutnam 1972 B2 · 2008 B1 · 2019 A2 (re-solve via coordinates/complex)Putnam

archive pull: 3 problems · Geometry · Putnam · 40 min

Track A∗ — Analysis

Track A∗ — Analysis (parallel mastery track): Sequences & limits — estimation, squeeze, Stolz–Cesàro

Runs EVERY mastery week so Analysis never goes cold — the Toolkit parallel-track model carried into Mastery. One depth problem + one A3–A6 reach problem each week.

sources & assignments (4)
  • Problems Analysis (depth)Putnam 2003 B2 — work it with the reading open; one clean write-up.Putnam
  • Problems Analysis (reach)Putnam 1994 B3 — 45 min; extract one rigorous lemma / reach-point (2–4 of 10), do not force a full solve.Nightmare

Track D∗ — Linear Algebra

Track D∗ — Linear Algebra (parallel mastery track): Determinants I — cofactor expansion, Vandermonde

Runs EVERY mastery week so Linear Algebra never goes cold — the Toolkit parallel-track model carried into Mastery. One depth problem + one A3–A6 reach problem each week.

sources & assignments (4)
  • Problems Linear Algebra (depth)Putnam 2014 B3 — work it with the reading open; one clean write-up.Putnam
  • Problems Linear Algebra (reach)Putnam 1985 B6 — 45 min; extract one rigorous lemma / reach-point (2–4 of 10), do not force a full solve.Nightmare

Track E∗ — Number Theory

Track E∗ — Number Theory (parallel mastery track): Congruence systems & CRT in anger

Runs EVERY mastery week so Number Theory never goes cold — the Toolkit parallel-track model carried into Mastery. One depth problem + one A3–A6 reach problem each week.

sources & assignments (4)
  • Problems Number Theory (depth)Putnam 1985 B2 — work it with the reading open; one clean write-up.Putnam
  • Problems Number Theory (reach)Putnam 1985 A4 — 45 min; extract one rigorous lemma / reach-point (2–4 of 10), do not force a full solve.Nightmare

Track C∗ — Combinatorics

Track C∗ — Combinatorics (parallel mastery track): Counting foundations — bijections & double counting

Continuous Combinatorics mastery spine (Track C∗). Combinatorics is the #1 Putnam genre (~20%); A1–B2 combinatorics is already drilled hard in the slots, so this spine adds the continuous theory ladder plus a weekly A3–A6 reach problem (the real gap). One depth re-solve + one fresh reach each week.

sources & assignments (4)
  • Source Combinatorics spine — Combinatorics text — This week: Counting foundations — bijections & double counting. Count one set two ways; build an explicit bijection; reflection/ballot. Read the matching section, then do the two problems below.
  • Source Combinatorics continuous spine — Runs every Mastery week (parallel-track model) so Combinatorics — the single most frequent Putnam genre (~20%) — never goes cold. 1 depth re-solve + 1 fresh reach problem.
  • Problems Combinatorics (depth)Putnam 1985 A1 — cold re-solve with the reading open; one clean write-up.Putnam
  • Problems Combinatorics (reach)Putnam 1985 A5 — 45 min; extract one rigorous lemma / reach-point (2–4 of 10), do not force a full solve.Nightmare

Track F∗ — Geometry · Combinatorics · Probability

Track F∗ — Geometry · Combinatorics · Probability (parallel maintenance): Geometry — Coordinate / trig / vector bash

Bundled parallel maintenance track so Geometry, Combinatorics, and Probability each get a fixed weekly cadence in Mastery (probability previously had multi-week gaps). Rotates focus; ~1.5 hrs.

why this gate: the lesson's §2 Complex numbers in geometry: rotation as multiplication is what it trains

sources & assignments (3)
  • Source Putnam and Beyond — Geometry & Trigonometry — This week’s focus: Coordinate / trig / vector bash. Set axes to kill symmetry; distance²/dot-product for perpendicularity; Shoelace for area.
  • Source Geometry keep-warm — Lower-cadence topic on a guaranteed weekly rotation (Toolkit Track F model). 1 problem this week; Geometry comes round again every 3rd week.
  • Problems Geometry (F∗)Putnam 1975 B2 — coordinate / trig / vector bash; full attempt + one clean write-up.Putnam

Problem-Solving Reps — weekly homework

Problem-Solving Reps — weekly homework

Standing weekly homework — the problem-solving book stack, every week. Solve ALL listed; write ONE full clean solution (the rest may stay scratch). Up to 2 due re-solves from your review queue surface first. Slot reinforcement supplement: A2/B2 are deliberately overtrained so they become bankable, not occasional exposure. Slot reinforcement supplement: A3/B3 now get repeated lemma-hunt reps so slot 3 is trained as a strong reach tier.

sources & assignments (11)
  • Problems PnBPnB section 1.1 probs 1–4 (A1/B1 method)Putnam
  • Problems Kedlaya + MAAPutnam 2018 A1,B1 · 2019 A1,B1 · 2021 A1,B1 (timed 30 min each)Putnam
  • Problems Putnam ArchivePutnam 2003 A2 - 18 min clean-solve; write the final proof and fatal-slip check.Putnam
  • Problems Putnam ArchivePutnam 2001 B2 - 22 min clean-solve; write the final proof and fatal-slip check.Putnam
  • Problems Putnam ArchivePutnam 2001 A3 - 35 min lemma hunt; record one rigorous lemma even if the full proof does not close.Nightmare
  • Problems Putnam ArchivePutnam 2002 B3 - 35 min lemma hunt; compare to official solution after the attempt.Nightmare
  • Problems Putnam Slot 2 EqualizerSlot-2 Equalizer Set 1: Putnam 2016 A2, Putnam 2021 A2, Putnam 2022 A2 - clean-solve focus; write final proofs and fatal-slip checks.Putnam
  • Problems Putnam Slot 4 EqualizerSlot-4 Equalizer Set 1: Putnam 2010 A4, Putnam 2014 A4, Putnam 2015 A4 - reach/lemma focus; extract the first invariant or structure before reading solutions.Nightmare
  • Problems Slot 2 Pair BalancerPutnam 2010 A2, Putnam 2010 B2, Putnam 2014 A2, Putnam 2014 B2 - timed A2/B2 score-growth reps; write one clean proof and one official-solution autopsy note.Putnam
  • Problems Putnam Full Past ExamFull Past Exam 05: Putnam 1999 A1, Putnam 1999 A2, Putnam 1999 A3, Putnam 1999 A4, Putnam 1999 A5, Putnam 1999 A6, Putnam 1999 B1, Putnam 1999 B2, Putnam 1999 B3, Putnam 1999 B4, Putnam 1999 B5, Putnam 1999 B6 - Primary paper protocol: A-session A1-A6 in one 180-minute block; B-session B1-B6 in one 180-minute block within 48 hours; next day score all 12 slots, tag every miss, and choose three repair pulls.Putnam
  • Problems Putnam Full Past ExamFull Past Exam 06: Putnam 2000 A1, Putnam 2000 A2, Putnam 2000 A3, Putnam 2000 A4, Putnam 2000 A5, Putnam 2000 A6, Putnam 2000 B1, Putnam 2000 B2, Putnam 2000 B3, Putnam 2000 B4, Putnam 2000 B5, Putnam 2000 B6 - Secondary paper protocol: Day 1 bankable sweep A1-A2-B1-B2 in 100 minutes; Day 2 medium/hard sweep A3-A4-B3-B4 in 100 minutes with certified-lemma goal; Day 3 reach scan A5-A6-B5-B6 in 50 minutes; Day 4 score all 12 slots and re-solve one same-family miss.Putnam

Reflect

Reflect: reconstruct and log the pattern

- Reflect: type-recognition log — which A1/B1 topic did you spot fastest vs. slowest? ---

Ritual: type-recognition log — which A1/B1 topic did you spot fastest vs. slowest?

sources & assignments (4)

Exit contract — Week 14

Verification remaining

  • reading progress…

Carry-forward repairs

  • reading queue…

Next week opens with

W15 · A2/B2 Slot Mastery
the exam follows the final taper week

Train Week 14 in the trainer →