C(n,k), hypergeometric, 'at least one' complement trick.

Fast Bayesian updating under pressure.

2×2 tables. Monty Hall. Medical testing. Mandatory.

Talk out loud. Rate yourself.

k ≈ 1.177√n for 50% collision. E = n·H(n) for coupon.

D(n) ≈ n!/e. Complement for 'at least one'.

HH puzzle. State equations. Stationary distribution.

All probability. Push for streak of 5+.

Write 5 key formulas from memory

E[max dice], coupon, gambler's ruin, geometric E, derangement probability.

All difficulty levels. Strict 90s timer.

Clock angle formula. Last-digit cycles. Fermat's theorem.

Rest & consolidate

Light review of week 1. No new material.

Conway's algorithm — important for sequence questions.