W18 · Mastery gates29–33 hrs

Week 18 of 28 · Mastery · due 2026-09-26 · 29–33 hrs

Advanced Analysis: Feynman + Abel

Advanced Analysis: Feynman + Abel gate complete

Train this week in the trainer →

This week's lesson · 10 min read

not started · read first, then train the gates

Feynman and Abel at full power: parameters, tails, and the A3/B3 door

You met Feynman's trick in Week 8 and Abel in Week 9 as single moves. This week they become STRATEGIES: parameters chosen with intent, differentiated twice when once is not enough, combined with symmetry of the integration domain; Abel driving asymptotic estimates, not just convergence verdicts. And the A3/B3 door opens — first exposure to the middle slots, where the two-move anatomy of A2 grows a third act.

Advanced technique is the same technique with a plan: the parameter placed where differentiation will cancel the hard part, the summation-by-parts aimed at the factor whose partial sums you can actually control.

Key ideas — the week on one card

  1. Place the Feynman parameter one level BELOW the ugly factor ($x^t$ under a $\ln x$) so differentiation produces it.
  2. A derivative that re-expresses through the original integral is an ODE win — solve it from an anchor value.
  3. Symmetry-generated functional equations ($2I(t) = I(t^2)$) can replace integration outright — but iterating them needs a continuity step.
  4. Summation by parts turns partial-sum bounds into asymptotics; keep $H_N = \ln N + \gamma + O(1/N)$ and Stirling on tap with their error terms.
  5. A3 moves are judged by structure exposed, not visual simplicity — the page often looks WORSE one act before it pays off.

1Feynman beyond one derivative

The Week 8 pattern was: embed, differentiate once, integrate back from an anchor. The advanced repertoire adds three gears. SECOND derivatives, when one differentiation simplifies but does not close — $I''(t)$ sometimes satisfies a differential equation with $I$ itself (the classic $I(t) = \int_0^\infty e^{-x^2}\cos(tx)\,dx$ gives $I'(t) = -\frac{t}{2}I(t)$, an ODE whose solution $I(t) = \frac{\sqrt\pi}{2}e^{-t^2/4}$ evaluates a whole family). Learn to see 'my derivative re-expresses in terms of me' as a WIN, not a failure to simplify.

PARAMETER PLACEMENT is the real skill: put $t$ where differentiation kills the ugliest factor. A $\ln x$ in the integrand wants $x^t$ (since $\partial_t x^t = x^t \ln x$ — the log APPEARS under differentiation, so start one level below it); an $\arctan$ wants its argument parameterized; a stubborn $\frac{1}{x^2 + a^2}$ invites differentiating in $a$ to generate higher powers. You are choosing the family so that the $t$-derivative is the member with the closed form.

The third gear is domain symmetry composed with parameters: substitutions like $x \mapsto \frac{\pi}{2} - x$ or $x \mapsto \frac{1}{x}$ (Week 6's reflection trick) often turn $I(t)$ into $I(\text{something}(t))$, giving a FUNCTIONAL EQUATION for $I$ that replaces integration entirely. The famous $\int_0^{\pi/2} \ln(\sin x)\,dx = -\frac{\pi}{2}\ln 2$ falls to exactly this: reflection plus the double-angle identity yields an equation in the integral itself.

01tt⁴t⁸t¹⁶squaring marches t to 0 while each hop halves I — so I(t) = I(0)/2ⁿ → 0
The squeeze from the worked example: 2I(t) = I(t²) iterated — the argument runs to 0 and continuity finishes the proof.

Worked example

Evaluate $I(t) = \int_0^{\pi} \ln(1 - 2t\cos x + t^2)\,dx$ for $|t| < 1$.

  1. Nudge 1

    Before differentiating, hunt symmetry: compute $I(t) + I(-t)$ and simplify the product inside the log.

    Reveal step 1

    Hunt a functional equation before differentiating. Compute $I(t) + I(-t) = \int_0^\pi \ln\left[(1 - 2t\cos x + t^2)(1 + 2t\cos x + t^2)\right] dx$, and the product is $(1 + t^2)^2 - 4t^2\cos^2 x = 1 - 2t^2\cos 2x + t^4$.

  2. Nudge 2

    Substitute $u = 2x$ and recognize the result as $I$ evaluated somewhere new.

    Reveal step 2

    Substitute $u = 2x$ in $\int_0^\pi \ln(1 - 2t^2 \cos 2x + t^4)\,dx = \frac{1}{2}\int_0^{2\pi} \ln(1 - 2t^2\cos u + t^4)\,du = \int_0^{\pi}\ln(1 - 2t^2\cos u + t^4)\,du$ (the integrand over $[\pi, 2\pi]$ mirrors $[0, \pi]$ via $u \mapsto 2\pi - u$). That last integral is $I(t^2)$.

  3. Nudge 3

    Iterate the functional equation and finish with continuity at 0 — that sentence is part of the proof.

    Reveal step 3

    Also $I(-t) = I(t)$ (substitute $x \mapsto \pi - x$). So $2I(t) = I(t^2)$: iterate to get $I(t) = \frac{1}{2^n} I\left(t^{2^n}\right)$. Since $t^{2^n} \to 0$ and $I$ is continuous at $0$ with $I(0) = 0$, the right side tends to $0$. Hence $I(t) = 0$ for $|t| < 1$ — no antiderivative ever appeared.

  4. Answer

    $I(t) = 0$ for $|t| < 1$: two symmetries give $2I(t) = I(t^2)$, and iteration squeezes $I$ to $I(0) = 0$. Functional equations can replace integration outright.

Pitfall. Iterating $2I(t) = I(t^2)$ without the continuity step. The telescoped identity $I(t) = 2^{-n} I(t^{2^n})$ needs $I(t^{2^n}) \to I(0)$, which is continuity at 0 plus boundedness — one sentence, but the proof is incomplete without it (and for $|t| > 1$ the answer is different: $2\pi \ln|t|$, via pulling out $t^2$).

2Abel as an asymptotic engine

Week 9 used Abel for convergence verdicts; the advanced use is ESTIMATION. Summation by parts converts $\sum_{n \le N} a_n f(n)$ into $A(N)f(N) - \int_1^N A(t) f'(t)\,dt$ (the integral form, with $A(t) = \sum_{n \le t} a_n$) — so any estimate on the partial sums $A(t)$ converts into an estimate on weighted sums against SMOOTH weights. This is how 'the average of $a_n$ is $c$' upgrades to asymptotics for $\sum \frac{a_n}{n}$, $\sum a_n \ln n$, and every similar cousin.

The companion is the integral comparison you already trust, sharpened: for monotone $f$, $\sum_{n=1}^N f(n) = \int_1^N f + O(|f(1)| + |f(N)|)$, and one more order of precision comes from the trapezoid/Euler-Maclaurin correction $\frac{f(1) + f(N)}{2}$. Harmonic numbers ($H_N = \ln N + \gamma + O(1/N)$) and Stirling ($\ln n! = n\ln n - n + \frac{1}{2}\ln(2\pi n) + O(1/n)$) are the two outputs used so often they should be reflexes with their error terms attached.

A5/B5-grade problems love hiding an Abel summation inside a limit: 'evaluate $\lim \frac{1}{N}\sum_{n \le N} a_n b_n$' where $a_n$ oscillates and $b_n$ drifts slowly. The template: partial-sum bound on the oscillator, summation by parts to move the drift's derivative into an integral, and the limit drops out of the leading term. When you see mixed oscillation-and-drift, Abel is not one option — it is the designed route.

Worked example

Show $\sum_{n=2}^{N} \frac{1}{n \ln n} = \ln \ln N + C + o(1)$ for some constant $C$.

  1. Nudge 1

    Compare against the integral of the SAME monotone function with honest endpoint bookkeeping.

    Reveal step 1

    Integral comparison with the monotone function $f(t) = \frac{1}{t \ln t}$: compare the sum against $\int_2^{N+1} \frac{dt}{t\ln t} = \ln\ln(N+1) - \ln\ln 2$, using the exact decomposition $\sum_{n=2}^{N} f(n) - \int_2^{N+1} f(t)\,dt = \sum_{n=2}^{N} \left[ f(n) - \int_n^{n+1} f \right]$ — each bracket lies in $[0,\, f(n) - f(n+1)]$ because $f$ decreases.

  2. Nudge 2

    Bound each bracketed error by $f(n) - f(n+1)$, then telescope that upper bound to prove convergence.

    Reveal step 2

    The error sum telescopes: $\sum_{n=2}^{N} [f(n) - f(n+1)] = f(2) - f(N+1) \le f(2)$, so the bracketed errors have monotone bounded partial sums and converge to some limit $E$ as $N \to \infty$. Define $C = E - \ln\ln 2$.

  3. Nudge 3

    Convert $\ln\ln(N+1)$ to $\ln\ln N$ with an explicit $o(1)$.

    Reveal step 3

    Assemble: $\sum_{n=2}^{N} \frac{1}{n\ln n} = \ln\ln(N+1) + C + o(1)$, and $\ln\ln(N+1) = \ln\ln N + o(1)$ (the difference is $O\left(\frac{1}{N\ln N}\right)$), giving $\ln\ln N + C + o(1)$. This 'comparison + telescoping error' argument is exactly how $\gamma$ is born from $H_N$ — same proof, different $f$.

  4. Answer

    $\ln\ln N + C + o(1)$: integral comparison gives the main term, and the sawtooth errors telescope to a convergent constant — the Euler-constant argument as a template.

Pitfall. Writing $\sum f(n) \approx \int f$ without tracking WHICH endpoint convention and error size you are using. The exam's asymptotics problems hide their difficulty in the error term; the main term is usually free.

3A3/B3 entry: the third act

A3/B3 problems extend the A2 anatomy by one act: transform, transform AGAIN, then finish — or one transformation plus a genuinely creative construction. First exposure this week comes with modified rules: untimed first attempts, 45-minute soft cap, and the goal is ARC RECOGNITION, not solve rate. A 30% solve rate on first-contact A3s at this stage is on-curve for the December target; what must be 100% is producing a real attack, because partial credit at this level pays 2-4 points and the difference between 0 and 3 across four sessions is a placement band.

The new behavior at this level: problems stop confirming your progress. On A1, a correct move visibly simplifies things; on A3, the correct first move often makes the page LOOK worse (a substitution that doubles the symbols, a generalization that seems gratuitous) and pays off two moves later. The discipline is evaluating moves by structural promise — did it expose symmetry, create an invariant, make an induction possible? — rather than by visual simplicity.

Study protocol for the misses (most first attempts will miss): before reading the solution, write your best partial idea down. Then read ONLY until the solution's first real idea, stop, and try to finish alone. Full-solution reading is a last resort — the interrupted-read protocol trains the skill you actually need, which is CONTINUING from a foothold, and it is how the deep-study gates this phase are designed to be used.

Worked example

Arc anatomy on a real A3 shape: 'Show that $\sum_{k=1}^{n} \frac{(-1)^{k+1}}{k}\binom{n}{k} = 1 + \frac12 + \cdots + \frac{1}{n}$.'

  1. Nudge 1

    Represent $\frac1k$ as an integral and let the binomial theorem collapse the sum.

    Reveal step 1

    Act one — represent the awkward factor: $\frac{1}{k} = \int_0^1 x^{k-1} dx$. The sum becomes $\int_0^1 \frac{1}{x}\sum_{k \ge 1} \binom{n}{k}(-x)^{k} \cdot (-1) \, dx = \int_0^1 \frac{1 - (1-x)^n}{x}\,dx$ (binomial theorem collapses the sum). Note the page briefly looked worse — an integral appeared — before it looked much better.

  2. Nudge 2

    Reflect the integration variable — the integrand becomes a finite geometric sum.

    Reveal step 2

    Act two — substitute $x \mapsto 1 - x$: $\int_0^1 \frac{1 - x^n}{1 - x}\,dx$, and the integrand is the finite geometric sum $1 + x + \cdots + x^{n-1}$.

  3. Nudge 3

    Integrate term by term and name the resulting sum.

    Reveal step 3

    Act three — integrate term by term: $\sum_{j=0}^{n-1} \frac{1}{j+1} = H_n$. Three acts: integral representation, reflection, geometric collapse — each individually a Week 6-8 move, and the A3 difficulty was CHAINING them without confirmation along the way.

  4. Answer

    $H_n$ — represent $\frac1k$ as an integral, reflect, recognize the geometric sum. A3 = familiar moves, longer chain, no applause between acts.

Pitfall. Abandoning a correct move because the page got messier. At A3 depth, evaluate moves by structure exposed (symmetry, telescoping shape, known sum) — visual simplicity returns one act later than you want it to.

Before you open the gates

  • Place the Feynman parameter one level BELOW the ugly factor, so differentiation produces it ($x^t$ under a $\ln x$).
  • A derivative that re-expresses through the original integral is an ODE win — solve with the anchor.
  • Try symmetry-generated functional equations ($2I(t) = I(t^2)$) before grinding antiderivatives; remember the continuity step when iterating.
  • Oscillation × slow drift → summation by parts; monotone sums → integral comparison with telescoping sawtooth errors ($H_N$, Stirling as reflexes).
  • A3 protocol: untimed first contact, judge moves structurally, and on misses use the interrupted-read — solution's first idea only, then finish alone.

Check yourself

1. In $I(t) = \int_0^\infty e^{-x^2}\cos(tx)\,dx$, differentiating and integrating by parts yields $I'(t) = -\frac{t}{2} I(t)$. The right reaction is:

2. Summation by parts (integral form) turns $\sum_{n \le N} a_n f(n)$ into $A(N)f(N)$ minus:

3. At A3 depth, a candidate move should be evaluated by:

Practice ladder — three rungs, rising

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

Rung 1 (Feynman, one derivative). For $a \ge 0$ evaluate $I(a) = \int_0^1 \frac{x^a - 1}{\ln x}\,dx$ by differentiating under the integral sign in the parameter $a$.

One hint

The $\ln x$ downstairs is the obstacle — place the parameter as $x^a$, since $\partial_a x^a = x^a \ln x$ cancels it. Differentiate, integrate the clean result in $a$, and anchor with $I(0) = 0$.

Worked resolution

Differentiate under the integral sign: $I'(a) = \int_0^1 \frac{\partial}{\partial a}\frac{x^a-1}{\ln x}\,dx = \int_0^1 \frac{x^a \ln x}{\ln x}\,dx = \int_0^1 x^a\,dx = \frac{1}{a+1}$. (For $a \ge 0$ this is licensed: the $a$-derivative of the integrand is $x^a$, and $0 \le x^a \le 1$ on $(0,1)$ is an integrable dominator independent of $a$; the integrand itself extends continuously to $[0,1]$, with value $0$ at $x = 0$ and $a$ at $x = 1$.) Since $I(0) = \int_0^1 \frac{1-1}{\ln x}\,dx = 0$, integrating over $[0,a]$ gives $I(a) = \int_0^a \frac{ds}{s+1} = \ln(a+1)$. [Source: The Feynman parameter-placement move ($x^a$ under a $\ln x$) from this week's 'Feynman beyond one derivative' section (Maths 505 Feynman set; MIT 18.A34 sum_integrals.pdf).]

Rung 2 (reflection + double angle). Prove $\int_0^{\pi/2} \ln(\sin x)\,dx = -\frac{\pi}{2}\ln 2$ using the reflection $x \mapsto \frac{\pi}{2} - x$ and the identity $\sin 2x = 2\sin x\cos x$, with no antiderivative of $\ln\sin x$.

One hint

Let $I$ be the integral. Reflection gives $I = \int_0^{\pi/2}\ln\cos x\,dx$, so $2I = \int_0^{\pi/2}\ln(\sin x\cos x)\,dx$. Substitute $\sin x\cos x = \tfrac12\sin 2x$, then $u = 2x$, and recover $I$ on the right.

Worked resolution

Let $I = \int_0^{\pi/2}\ln(\sin x)\,dx$; it converges (an improper integral only at $0$, where $\ln\sin x \sim \ln x$ is integrable), so every step below manipulates finite quantities. The substitution $x \mapsto \tfrac{\pi}{2}-x$ sends $\sin$ to $\cos$, so $I = \int_0^{\pi/2}\ln(\cos x)\,dx$ too. Adding, $2I = \int_0^{\pi/2}\ln(\sin x\cos x)\,dx = \int_0^{\pi/2}\ln\left(\tfrac12\sin 2x\right)dx = -\tfrac{\pi}{2}\ln 2 + \int_0^{\pi/2}\ln(\sin 2x)\,dx$. In the last integral put $u = 2x$: $\int_0^{\pi/2}\ln(\sin 2x)\,dx = \tfrac12\int_0^{\pi}\ln(\sin u)\,du = \tfrac12\cdot 2\int_0^{\pi/2}\ln(\sin u)\,du = I$, where $\int_0^\pi = 2\int_0^{\pi/2}$ uses the symmetry of $\sin$ about $u = \tfrac{\pi}{2}$. Thus $2I = -\tfrac{\pi}{2}\ln 2 + I$, giving $I = -\tfrac{\pi}{2}\ln 2$ — integration replaced entirely by a functional equation. [Source: The domain-symmetry / functional-equation gear named explicitly in this week's 'Feynman beyond one derivative' section (the $\int_0^{\pi/2}\ln\sin x\,dx$ example), re-derived solo.]

Rung 3 (integral comparison, done solo). Prove that $\sum_{n=1}^{N}\frac{1}{n} = \ln N + \gamma + o(1)$ as $N \to \infty$ for some constant $\gamma$ — the harmonic-number instance of this week's $\sum\frac{1}{n\ln n}$ template.

One hint

Set $d_n = \frac1n - \int_n^{n+1}\frac{dt}{t} = \frac1n - \ln\frac{n+1}{n}$. Bound $0 \le d_n \le \frac1n - \frac1{n+1}$ from monotonicity of $\frac1t$, telescope to prove $\sum d_n$ converges, then reassemble.

Worked resolution

For each $n$ set $d_n = \frac1n - \int_n^{n+1}\frac{dt}{t} = \frac1n - \ln\frac{n+1}{n}$. Because $\frac1t$ decreases on $[n,n+1]$, $\frac1{n+1} \le \int_n^{n+1}\frac{dt}{t} \le \frac1n$, so $0 \le d_n \le \frac1n - \frac1{n+1}$. These upper bounds telescope: $\sum_{n=1}^{N}\left(\frac1n - \frac1{n+1}\right) = 1 - \frac1{N+1} \le 1$, so the partial sums $\sum_{n=1}^N d_n$ are nondecreasing and bounded above, hence converge to a limit $\gamma = \sum_{n=1}^\infty d_n$, with tail $\sum_{n>N} d_n \to 0$. Now $\sum_{n=1}^N d_n = \sum_{n=1}^N \frac1n - \int_1^{N+1}\frac{dt}{t} = H_N - \ln(N+1)$, so $H_N = \ln(N+1) + \gamma + o(1) = \ln N + \gamma + o(1)$, since $\ln(N+1) - \ln N = \ln\left(1 + \tfrac1N\right) = o(1)$. [Source: The integral-comparison-plus-telescoping-error template from this week's 'Abel as an asymptotic engine' section, which names this as exactly how $\gamma$ is born from $H_N$ (Evan Chen, Summation).]

Prove it — constructed response

Let $I(t) = \int_0^\infty e^{-x^2}\cos(tx)\,dx$. Prove that $I(t) = \frac{\sqrt\pi}{2}\,e^{-t^2/4}$ for all real $t$. Write the full argument: justify differentiating under the integral sign, derive the differential equation $I$ satisfies, solve it, and pin the constant with the value at $t = 0$.

The gates

Technique Resources — Feynman's trick + Abel summation (study before the reinforcing problems)

Learning support for this week's reinforcing IMO/Putnam problems. Read/watch these before (and after) attempting the Feynman's trick + Abel summation problems so each attempt has a source to learn the method and to check your write-up against.

why this gate: the lesson's §1 Feynman beyond one derivative is what it trains

sources & assignments (4)

Advanced Reading

Advanced Reading

- Read: CMU 04-Calculus advanced examples · Rudin Ch. 8 section section 8.5–8.7 (revisit) - Watch: Maths 505 Feynman integration — 3 videos · Jago Alexander hard integrals — 2 videos

sources & assignments (5)

Archive Block — A2/B2

Archive Block — A2/B2

- Archive: 5 Putnam A2/B2 · Analysis · any slot · 20 min each

sources & assignments (5)
  • Problems Archive BrowserPutnam 2009 A2, 2005 A2 · Analysis · 20 min eachPutnam

archive pull: 2 problems · Analysis · A2/B2 · Challenge · 20 min

A3/B3 Entry

A3/B3 Entry (first exposure — not nightmare pace) accelerated only

- Archive: 2 Putnam A3/B3 · Analysis · any slot · 30 min each - After each: write what you got, what you missed, which tool was needed

why this gate: the lesson's §3 A3/B3 entry: the third act is what it trains

sources & assignments (5)
  • Problems Archive BrowserPutnam 2000 B3 · Analysis · 30 min eachNightmare

archive pull: 1 problems · Analysis · A3/B3 · Nightmare · 30 min

A1/B1 Maintenance

A1/B1 Maintenance

- Archive: 4 Putnam A1/B1 · mixed topics · 10 min each

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

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

Stretch

Stretch (only after required work) accelerated only

- Do: Berkeley Problems in Mathematics Analysis chapter — 2 problems

sources & assignments (5)
  • Problems BerkeleyBerkeley Problems in Mathematics Analysis chapter — 1 problem (second slot displaced to the Taylor-with-remainder drill in Deep Study)Putnam

Spiral Reinforcement

Spiral Reinforcement

- Archive: 2 · Algebra A2 + 1 · Combinatorics A2 · any slot

sources & assignments (5)
  • Problems Archive BrowserPutnam 2001 A2 · AlgebraPutnam

archive pull: 1 problems · Algebra · A2 · Challenge · 20 min

Deep Study — Uniform convergence + special functions

Deep Study — Uniform convergence + special functions (Rudin Ch. 7–8)

Mastery-phase learning gate: Rudin Ch. 7 was read in Week 7 for convergence; this pass is the interchange-of-limits layer the advanced problems actually use.

Ritual: Output: lim-swap conditions card + Γ(n+1)=n! derivation.

sources & assignments (12)
  • Problems Taylor-with-remainder drill(1) State Taylor's theorem with the Lagrange remainder; use it to bound the error of sin x ≈ x − x³/6 explicitly on |x| ≤ 1/2 (remainder at most (1/2)^5/120). (2) Prove e is irrational from the tail bound of e = Σ 1/k!. (3) One limit where Taylor beats l'Hopital: lim x→0 (x − sin x)/x³ = 1/6 — name the order of expansion needed BEFORE computing. Time comes from the Berkeley stretch gate (trimmed 2 → 1).Putnam

USAMO/IMO Bridge — IMO 2008/4

USAMO/IMO Bridge — IMO 2008/4 (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 (5)
  • Source IMO 2008/4 — AoPS wiki (statement + solutions + discussion link) — Find all f:(0,∞)→(0,∞) with (f(w)²+f(x)²)/(f(y²)+f(z²)) = (w²+x²)/(y²+z²) when wx = yz. A real functional equation under constraints — substitution discipline from the analysis week. Time cap 60 min — do not scroll to the Solutions section until the attempt is over.
  • Source Generating-functions lecture series — Lecture companion for “USAMO/IMO Bridge — IMO 2008/4 (stretch)” — full treatment; pause at each theorem statement and predict the proof's first move before it plays.
  • Source WildEgg (Wildberger) — Generating Functions — Problem-session companion for “USAMO/IMO Bridge — IMO 2008/4 (stretch)” — watch one worked problem, stop, finish it yourself on paper, then compare.
  • Source MIT 18.100B Lecture 8 — Convergence Tests; Power Series (OCW) — Intuition companion for “USAMO/IMO Bridge — IMO 2008/4 (stretch)” — the picture behind the machinery; afterwards write one sentence connecting the visual to this gate's exercises.
  • Problems IMO 2008/4Find all f:(0,∞)→(0,∞) with (f(w)²+f(x)²)/(f(y²)+f(z²)) = (w²+x²)/(y²+z²) when wx = yz — full writeup to the Evan Chen standard, 60 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: the orbit-stabilizer theorem (≈2 hrs)

Ritual: Thread: Abstract Algebra. Required ~2-hr continuation swapped from LTE-II — the orbit-stabilizer theorem is the lever behind every counting-under-symmetry problem.

sources & assignments (7)
  • Source UCLA ORMC LTE handout (Lifting the Exponent) — Continuation-lane companion for: NT: lifting the exponent II (≈2 hrs). Reused from the verified pool — watch/read with this week's lens.
  • Source Yufei Zhao — Lifting the Exponent (olympiad handout) — Continuation-lane companion: both LTE lemmas with proofs — reconstruct them closed-book before the reps.
  • Source Generating-functions lecture series — Lecture companion for “Continuation — NT: lifting the exponent II (≈2 hrs)” — full treatment; pause at each theorem statement and predict the proof's first move before it plays.
  • Source WildEgg (Wildberger) — Generating Functions — Problem-session companion for “Continuation — NT: lifting the exponent II (≈2 hrs)” — watch one worked problem, stop, finish it yourself on paper, then compare.
  • Source MIT 18.100B Lecture 8 — Convergence Tests; Power Series (OCW) — Intuition companion for “Continuation — NT: lifting the exponent II (≈2 hrs)” — the picture behind the machinery; afterwards write one sentence connecting the visual to this gate's exercises.
  • 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 Algebra(1) State and prove the orbit-stabilizer theorem: for a group G acting on a set X and x ∈ X, |orbit(x)|·|stab(x)| = |G| (construct the bijection between left cosets of stab(x) and the orbit). (2) Apply it to the rotation group of a cube acting on its 6 faces — show |G| = 24. (3) Apply it to the 4 vertices of a square under D₄ to set up next week's Burnside count. Displaces the LTE-II continuation — LTE stays warm in the W17 valuations/LTE keep-warm rotation.Standard

Keep-Warm Rotation — asymptotics · inequalities · polynomials

Keep-Warm Rotation — asymptotics · inequalities · polynomials (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 Abel as an asymptotic engine is what it trains

sources & assignments (2)
  • Problems Keep-warm rotationThree 10-minute micro-reps, no notes: (1) asymptotics — one bound via weak Stirling, or re-derive log n! ≈ n log n − n by integral comparison; (2) inequalities — one A1/B1-band inequality rep, or closed-book re-derivation of Cauchy–Schwarz with equality case; (3) polynomials — one polynomial rep (Vieta or interpolation), or re-derive the finite-difference degree test. The dormancy rule: no tool family sleeps longer than 2 weeks — these are the three most overdue right now.Standard

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

Multivariable Calculus

Multivariable Calculus: Load (double integrals · Lagrange · partials)

Multivariable calculus was absent (the analysis spine stopped at Rudin Ch. 8). ~2.4–5% of the Putnam — often accessible B-problems (order-swap, polar, Lagrange optimization).

sources & assignments (3)
  • Source Rudin PMA Ch. 9 — Functions of Several Variables — total derivative, inverse & implicit function theorems (§9.1–9.3 + the differentiation section).
  • Source MIT OCW 18.02 — Multivariable Calculus — Double/iterated integrals (switch order of integration, polar) + the Lagrange-multipliers unit.
  • Source Putnam multivariable recognition — When to switch order of integration, convert to polar, or apply Lagrange multipliers for constrained optimization.

Multivariable Calculus: Drill (archive replays)

unlocks after: Multivariable Calculus: Load (double integrals · Lagrange · partials)

Drill the recognition: order-swap, polar, Lagrange. Reachable points many candidates skip.

sources & assignments (3)
  • Problems MAA archivePutnam 2003 A3 · 1987 A3 (iterated/double integrals — order-swap, polar)Putnam
  • Problems MAA archivePutnam 2019 B4 · 2022 A6 (multivariable)Nightmare
  • Problems MIT OCW 18.02Lagrange-multiplier problem set — 2 constrained-optimization problemsPutnam

archive pull: 2 problems · Analysis · Putnam,Nightmare · 30 min

Track A∗ — Analysis

Track A∗ — Analysis (parallel mastery track): Improper & parameter integrals (differentiate under the sign)

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 1988 A2 — work it with the reading open; one clean write-up.Putnam
  • Problems Analysis (reach)Putnam 1967 A4 — 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): Trace & determinant as invariants (Axler Ch. 10)

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 1991 A2 — work it with the reading open; one clean write-up.Putnam
  • Problems Linear Algebra (reach)Putnam 1987 B5 — 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): p-adic valuations & Lifting-the-Exponent

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 2006 A2 — work it with the reading open; one clean write-up.Putnam
  • Problems Number Theory (reach)Putnam 1988 B3 — 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): Recurrences & the companion-matrix toolkit

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: Recurrences & the companion-matrix toolkit. Set up and solve linear recurrences; characteristic roots; transfer method. 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 1996 B1 — cold re-solve with the reading open; one clean write-up.Putnam
  • Problems Combinatorics (reach)Putnam 1994 A6 — 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): Combinatorics — Generating functions

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.

sources & assignments (3)
  • Source Wilf — generatingfunctionology (free) — This week’s focus: Generating functions. Encode a sequence as a GF and extract a coefficient; the root-of-unity filter.
  • Source Combinatorics keep-warm — Lower-cadence topic on a guaranteed weekly rotation (Toolkit Track F model). 1 problem this week; Combinatorics comes round again every 3rd week.
  • Problems Combinatorics (F∗)Putnam 1985 B3 — generating functions; full attempt + one clean write-up.Putnam

FE Micro-Spine — constrained FE reach touch

FE Micro-Spine — constrained FE reach touch

Added because FE cannot be a one-week topic; pattern exposure must recur after the W6 load.

Ritual: Write the substitution table before any solution check. Every FE rep must name the first move and the trap it avoided.

sources & assignments (2)
  • Source 100 Functional Equations / Putnam FE repair spine — Micro-rep source for repeated FE pattern exposure: special values, symmetry, injective/surjective forcing, Cauchy/Jensen, iteration, and polynomial-degree comparison.
  • Problems Functional equations micro-repIMO 2008/4 — after the existing bridge attempt, extract the FE-style invariant/substitution move and write the transferable pattern card.Putnam

A-Session Mock — A1–A6, one continuous sitting

A-Session Mock — A1–A6, one continuous sitting (180 min)

First full A-session pressure appears before the existing W20 half-Putnam.

Ritual: Postmortem: time map, clean solves, reach lemmas, and one rule for when to abandon A4+.

sources & assignments (2)
  • Source A-session mock protocol — Full A-session rehearsal: six A problems from one year, 180 minutes continuous, no split across days.
  • Problems A-session mockOne full A-session (A1–A6) from a single year you have NOT drilled this program — pull it via the archive button (the least-touched recent years are cleanest). 180 minutes continuous, no notes; score A1/A2 clean, A3+ reach points/lemmas honestly. A calibration mock is only valid on unseen problems.Nightmare

archive pull: 6 problems · Mixed Putnam · A1/A2/A3/A4/A5/A6 · Putnam · 180 min

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 (14)
  • Problems PnBPnB section 3.2–3.3 probs 1–4 (Feynman/Abel)Putnam
  • Problems Problems in Real AnalysisRiemann-integral ch. parameter-integral probs 1–3Putnam
  • Problems Concrete MathConcrete Mathematics Ch. 2 summation-by-parts ex 5–7Putnam
  • Problems KedlayaPutnam 1999 A3,B3Nightmare
  • Problems Putnam ArchivePutnam 2010 A2 - 18 min clean-solve; write the final proof and fatal-slip check.Putnam
  • Problems Putnam ArchivePutnam 1986 B2 - 22 min clean-solve; write the final proof and fatal-slip check.Putnam
  • Problems Putnam ArchivePutnam 2009 A3 - 35 min lemma hunt; record one rigorous lemma even if the full proof does not close.Nightmare
  • Problems Putnam ArchivePutnam 2007 B3 - 35 min lemma hunt; compare to official solution after the attempt.Nightmare
  • Problems Putnam Slot 2 EqualizerSlot-2 Equalizer Set 5: Putnam 2019 A2, Putnam 2020 A2, Putnam 1985 A2 - clean-solve focus; write final proofs and fatal-slip checks.Putnam
  • Problems Putnam Slot 4 EqualizerSlot-4 Equalizer Set 5: Putnam 2014 B4, Putnam 2015 B4, Putnam 2016 B4 - reach/lemma focus; extract the first invariant or structure before reading solutions.Nightmare
  • Problems AMC/AIME Fluency OpenerOptional 5-minute opener: solve the three linked AMC/AIME reps before Putnam work; stop at 15 minutes total.AMC/AIME · archive: AIME II2022 AIME IAIME standard
  • Problems Slot 2 Pair BalancerPutnam 2021 A2, Putnam 2021 B2, Putnam 2022 A2, Putnam 2022 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 13: Putnam 2007 A1, Putnam 2007 A2, Putnam 2007 A3, Putnam 2007 A4, Putnam 2007 A5, Putnam 2007 A6, Putnam 2007 B1, Putnam 2007 B2, Putnam 2007 B3, Putnam 2007 B4, Putnam 2007 B5, Putnam 2007 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 14: Putnam 2008 A1, Putnam 2008 A2, Putnam 2008 A3, Putnam 2008 A4, Putnam 2008 A5, Putnam 2008 A6, Putnam 2008 B1, Putnam 2008 B2, Putnam 2008 B3, Putnam 2008 B4, Putnam 2008 B5, Putnam 2008 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

- Standard ---

Ritual: Pick one advanced-analysis solve (Feynman/Abel). Close all notes and the solution. Rewrite the full solution from memory, then compare with the original — what did you miss or reorder? Write one pattern note: "When I see [pattern], do [first move]."

sources & assignments (4)

Verify: audit one proof before closing

unlocks after: Reflect: reconstruct and log the pattern

- Standard ---

Ritual: Pick one solution. Re-check for: (1) a false claim, (2) a missing case, (3) a wrong bound. Extra check for analysis: is every limit/integral swap licensed by a named theorem (uniform convergence, dominated bound)?

sources & assignments (4)

Exit contract — Week 18

Verification remaining

  • reading progress…

Carry-forward repairs

  • reading queue…

Next week opens with

W19 · Advanced Algebra: Root-of-Unity Filter + Newton's Identities + Interpolation
the exam follows the final taper week

Train Week 18 in the trainer →