Quant and Mathematical Puzzles

Concepts — Sample spaces, conditional probability, Bayes' theorem, and why base rates wreck intuition · Linearity of expectation (the single most overpowered trick in the discipline) and indicator variables · Expected value via first-step / recursive conditioning (E[steps to absorbing state]) and Markov-chain setup · Geometric, binomial, Poisson distributions from first principles; memorylessness · Symmetry and clever counting arguments to avoid brute computation · Classic teasers as a canon: Monty Hall, two-children/boy-girl, ants-on-a-polygon, 100 prisoners and boxes, gambler's ruin, expected number of coin flips for a pattern (HH vs HT), the drunk-passenger/airplane-seat problem · Random walks on a line and gambler's ruin as a recurring template; reflection principle and first-passage intuition

Read — Fifty Challenging Problems in Probability with Solutions (Mosteller) · Heard on the Street: Quantitative Questions from Wall Street Job Interviews (Crack) · Brainstellar — Probability puzzles (Green/Easy, then Medium) · A Practical Guide to Quantitative Finance Interviews ('The Green Book', Zhou) — Brain Teasers & Probability chapters · Blitzstein & Hwang — Introduction to Probability (free PDF + Harvard Stat 110)

Watch — 3Blue1Brown — Bayes' theorem, and making probability intuitive · 3Blue1Brown — Why probability is counterintuitive / Monty Hall framing · Harvard Stat 110 (Joe Blitzstein) — full probability lecture series

Problems

• medium Expected number of coin flips to first see HH vs HT — The canonical 'why are these different?' problem. Forces you to set up states and Markov-chain expectation correctly — a template you'll reuse forever. Generalize it to an arbitrary length-k pattern via Conway's leading-number algorithm.
• hard 100 prisoners and 100 boxes (the cyclic-permutation puzzle) — One of the most beautiful counterintuitive results in probability — the strategy lifts survival from ~0% to ~31%. Then prove ~31% is asymptotically optimal (no strategy beats 1 - ln 2): that proof is the real checkpoint.
• hard Drunk passenger / airplane-seat problem and the broken-stick triangle — Symmetry arguments that collapse a scary-looking computation to one line. Trains the 'is there a slick argument?' reflex before you grind algebra.
• medium Gambler's ruin: probability of reaching N before 0 from k (fair AND biased) — The foundational random-walk result. Derive both cases by hand AND the expected duration — you'll need it for every betting/Kelly problem later.
• hard ABRACADABRA / pattern-waiting time via martingale (optional stopping) — The slick martingale solution to expected waiting time for a string is a genuine level-up: it kills HH-vs-HT and ABRACADABRA in one stroke and previews the tools of stage 3.

Done when — Solve 40+ of the Fifty Challenging Problems and clear all Brainstellar 'Easy' + half of 'Medium' probability puzzles, each written up cleanly with the reasoning (not just the number). You can derive gambler's ruin (both ruin probability and expected duration) and the HH-vs-HT expectation from scratch on a whiteboard with no reference, and explain why the 100-prisoners strategy works via cycle lengths.

Concepts — Inclusion-exclusion, stars-and-bars, the pigeonhole principle as a proof weapon · Generating functions as a bookkeeping machine for counting and recurrences · Bijective proofs and double counting · Combinatorial game theory: Nim, Sprague-Grundy theorem, P-positions vs N-positions, computing Grundy numbers for novel variants · Backward induction and minimax; solving finite games from the end state · Zero-sum games, mixed strategies, and the minimax theorem (Nash for 2-player zero-sum); solving small games via LP · Adversarial / worst-case puzzles: weighing coins (information-theoretic bounds), prisoners-and-hats, guessing with an adversary · Invariants and monovariants (coloring/parity arguments) to prove impossibility or termination · The probabilistic method: prove existence by showing a random object works with positive probability

Read — Green Book — Combinatorics & Probability chapters (deeper, harder pass) (Zhou) · Brainstellar — Discrete Maths & Strategy puzzle albums · Thinking Strategically (Dixit & Nalebuff) · Winning Ways for Your Mathematical Plays, Vol. 1 (Berlekamp, Conway, Guy) · CP-Algorithms — Sprague-Grundy theorem & games on graphs · Art of Problem Solving — community & combinatorics resources

Watch — MIT 6.042J Mathematics for Computer Science (Spring 2015) — full OCW lectures · Numberphile — Nim and combinatorial game theory · 3Blue1Brown — clever counting & the probabilistic-method flavor of problems

Problems

• hard Compute Grundy numbers for a Nim variant you've never seen — derive the winning strategy AND prove it — Sprague-Grundy is the master key to a huge class of impartial games. Being able to compute Grundy numbers for a novel variant (and code a verifier) is a real skill checkpoint.
• hard 12 coins, one fake (heavier or lighter), find it AND its type in 3 weighings — non-adaptively — The definitive information-theoretic puzzle: 3 weighings give 3^3 outcomes for 24 hypotheses, so the bound is tight. Designing the fixed (non-adaptive) weighing scheme is brutal and beautiful — then generalize to (3^k - 3)/2 coins.
• hard 100 hats / prisoners-and-hats family with an adversary (parity and modular-sum strategies) — A whole family — sees-everyone-ahead, parity guesses, the 7-hats-mod-7 problem, infinite hats with the axiom of choice. Trains constructing a strategy that provably beats an adversary.
• brutal Putnam combinatorics/game problem with a full, gap-free proof (invariant or coloring) — Your first taste of Putnam. Pick a combinatorics-flavored problem; even one complete solution is a milestone. Invariant/parity arguments live here — and the median Putnam score is famously near zero, so a clean write-up means something.
• brutal Olympiad combinatorics from the IMO Shortlist (C-problems) — The shortlist C-problems are the gold standard for elegant hard combinatorics and the probabilistic method. Attempt cold, then read the community discussion — this is where proof taste is forged.

Done when — Clear all Brainstellar Strategy + Discrete Maths puzzles, solve the 12-coins puzzle non-adaptively and at least one novel Nim variant with a written proof and a code verifier, and produce one complete, rigorous solution to a Putnam combinatorics problem. You can reach for inclusion-exclusion, generating functions, parity invariants, backward induction, and the probabilistic method without prompting.

Concepts — Expected value of imperfect information; value of a free peek / optimal stopping (secretary problem and prophet inequalities) · Kelly criterion: deriving the log-optimal bet fraction, fractional Kelly, and why over-betting drives growth negative · Variance, risk-adjusted return, Sharpe-style thinking; why max-EV is not max-utility · Market-making basics: bid/ask spread, inventory risk, adverse selection ('if they're hitting my bid, why?') · Pricing simple derivatives by expectation and no-arbitrage; risk-neutral intuition (the coin-flip / binomial-tree view) · Poker/blackjack as EV labs: pot odds, equity, expected value of a decision, card counting as Bayesian updating · Auctions and the winner's curse; bidding under uncertainty; common-value vs private-value · Brownian motion / random-walk intuition for prices (qualitative, leading into stochastic calculus later)

Read — Green Book — Finance, Stochastic Processes & Brain Teasers about Trading chapters (Zhou) · Fortune's Formula (William Poundstone) · A Man for All Markets (Edward Thorp) · Thorp — 'The Kelly Criterion in Blackjack, Sports Betting, and the Stock Market' (full paper PDF) · The Theory of Poker (David Sklansky)

Watch — Jane Street — Tech Talks & market-making / electronic trading talks · MIT 15.401 / Robert Shiller's Financial Markets (Yale, free) — risk-neutral pricing & no-arbitrage · Edward Thorp — interviews & talks on Kelly, blackjack, and markets

Problems

• hard Derive the Kelly fraction f* = edge/odds, then simulate over/under-betting to ruin — Derivation + simulation together turn an abstract formula into lived intuition for why position sizing is the whole game. Plot growth rate vs. fraction and watch it go negative past 2x Kelly.
• hard Secretary problem / optimal stopping (the 1/e rule) — derive, then beat it with the prophet inequality — The cleanest 'value of information + when to commit' problem. Reconstruct the 1/e threshold on demand, then learn why the prophet inequality (1/2 of the max) is a different, deeper guarantee.
• hard Price a bet/option on a binomial tree by no-arbitrage; explain why the risk-neutral P(up) is not the real-world probability — The risk-neutral pricing 'aha' — the single most important conceptual leap from probability to trading. Extend to a 2- and 3-step tree and watch it converge toward Black-Scholes.
• brutal Market-making EV under adverse selection: quote a two-sided market on a hidden value; an informed counterparty trades against you — what spread protects you? — THE quant-trading interview archetype: reason about who you're trading against and price the information asymmetry, not just fair value. This is the Glosten-Milgrom intuition in puzzle form.
• hard Make a market on a random variable you must estimate (e.g. sum of digits of a random page), then defend bid/ask against a counterparty who can pick which side to hit — Trains the live 'make me a market' reflex under an adversary — tight estimate, calibrated spread, and a verbal justification you can deliver in seconds.

Done when — Build a working EV calculator (poker hand or blackjack decision) and a Kelly betting simulator from scratch, derive the secretary-problem 1/e rule and the Kelly fraction by hand, and articulate risk-neutral pricing and adverse selection clearly enough to teach them. You can answer a 'make me a market on X' prompt with a justified bid, ask, and spread, and explain how an informed counterparty should widen it.

Concepts — Open-ended problem decomposition: when there's no template, generate structure (small cases, invariants, symmetry, computer search) · Computational problem-solving: brute force + prune + verify; meet-in-the-middle; constraint propagation; DP on huge / bitmasked state spaces · Number theory at speed: modular exponentiation, CRT, Mobius inversion, multiplicative and totient functions, fast sieves (Project Euler's bread and butter) · Proof writing under adversarial scrutiny (Putnam-grade rigor) — a 'mostly right' proof scores 1/10 · Hybrid solving: use code to explore/conjecture (OEIS lookups, small-case enumeration), then prove or verify the closed form · Estimation and Fermi reasoning for sanity-checking computational answers · Knowing when to abandon a line of attack — and how to log partial progress so it compounds across attempts

Read — Jane Street Puzzles — Archive (every past monthly with solutions) · Jane Street — Current Puzzle (submit a real answer each month) · The Putnam Archive (Kedlaya) — all problems & solutions (1985-present) · Project Euler — Archived Problems (target the hard tier) · Putnam and Beyond (Gelca & Andreescu), 2nd ed. · OEIS — The On-Line Encyclopedia of Integer Sequences

Watch — Jane Street — puzzle-related Tech Talks & community solution walkthroughs · Michael Penn — Putnam & olympiad problem solutions · Project Euler / number-theory-for-PE walkthroughs

Problems

• brutal Solve a Jane Street monthly puzzle end-to-end and submit the correct answer — The defining achievement of this path. One correct monthly submission is worth more than a hundred easy puzzles solved.
• brutal Fully solve 3+ Putnam problems with rigorous, gap-free proofs (across A and B sets) — Putnam median is famously near zero. A complete solution is a hard, objective signal that your proof-writing has reached competition grade.
• brutal Clear 10+ Project Euler problems rated 40%+ difficulty (then push toward 70%+) — Forces the math-plus-code hybrid: the naive approach times out, so you must find the structural insight (often via OEIS or a number-theoretic identity). The hard tier is genuinely punishing.
• brutal Reproduce a Jane Street archive puzzle's answer with your own constraint-search solver + independent verifier before reading the solution — Building the solver yourself (constraint propagation + verification) is the project-grade version of solving — and a portfolio piece. Many monthlies reduce to a grid/SAT-style search.

Done when — Submit at least one correct answer to a live Jane Street monthly puzzle, write up 3+ complete Putnam solutions that would survive grading, and clear 10+ Project Euler problems in the 40%+ difficulty tier — with all code and write-ups in a public repo. Failing a hard problem no longer rattles you; it's just data.

• brutal Jane Street Monthly Puzzles (live + full archive) — The flagship arena and the literal source of 'Jane Street energy'. A new brutal puzzle every month — grids, constraints, optimization, probability — with a real submission deadline and leaderboard. Work the archive cold, then submit live monthlies. This is where the hardest accessible puzzles live.
• legendary Putnam Competition (Kedlaya archive, 1985-present) — The hardest undergraduate math competition on Earth: 12 problems, median score frequently 0 or 1 out of 120. Proof-based, no computers. A single complete solution is a real trophy. The combinatorics, probability, and number-theory problems are most on-path.
• brutal Project Euler — hard tier (40%+ and especially 70%+ difficulty) — 990+ problems where the naive solution is hopeless and you must find the structural/number-theoretic insight, then implement it efficiently. The high-difficulty problems are punishing and endlessly replenished. Verifiable: your answer is right or it isn't.
• legendary IMO Shortlist & olympiad combinatorics (AoPS index) — The year-by-year shortlist index: proof-based combinatorics and game theory at the highest level, each problem dissected in deep AoPS community threads. The C-problems are a bottomless well of the most elegant hard problems.
• hard Brainstellar — Hard (red) tier — The red/hard puzzles are real, recent quant-interview screeners — exactly what gets asked at top trading firms. Tighter and more 'interview-shaped' than Putnam, but several are genuinely brutal.
• hard The Green Book — hardest brain-teaser, probability & stochastic-process problems — The toughest problems in the canonical quant-prep book — stochastic processes, dynamic programming, and trading brain teasers that separate offers from rejections at top desks.
• hard Fiddler on the Proof (successor to FiveThirtyEight's The Riddler) — A fresh, well-posed math puzzle every week with a harder 'Extra Credit' variant, plus the full Riddler-era archive of problems. The weekly drip keeps the habit alive and the Extra Credit problems get genuinely hard.
• hard Optiver / IMC / Citadel mental-math & '80 in 8' EV gauntlets — Speed-and-pressure arena: rapid mental arithmetic (Optiver's 80-questions-in-8-minutes test), fast EV estimation, and market-making sims under a clock. A different muscle than Putnam — trains doing hard math fast and out loud.

• Jane Street's blog (https://blog.janestreet.com) — engineering, OCaml, and the culture behind the puzzles; read it to understand how the firm actually thinks.
• Signals & Threads — Jane Street's podcast (https://signalsandthreads.com): deep technical conversations on systems, trading infra, and reasoning under uncertainty. A long-game listen.
• Jane Street Programs & Events (https://www.janestreet.com/join-jane-street/programs-and-events/) — the Estimathon, Electronic Trading Challenge, and INSIGHT/recruiting events: the best live, in-person versions of this whole skillset.
• Edward Thorp — read everything (A Man for All Markets, his Kelly papers); the patron saint of edge, EV, and bet sizing. If betting theory clicks, go deep here.
• Fortune's Formula (Poundstone) → Thorp's gwern-hosted Kelly paper → modern Kelly literature; this rabbit hole runs from blackjack to portfolio theory to information theory.
• 3Blue1Brown (Grant Sanderson) — the gold standard for mathematical intuition; new videos are worth dropping everything for.
• r/quant and r/quantfinance on Reddit — for interview reports, problem discussion, and how the hardest desks actually hire; cross-check with the QuantFinance Stack Exchange (https://quant.stackexchange.com).
• Math Stack Exchange and MathOverflow — search before you ask; the archives already answer most hard-problem questions you'll hit, often with the slick argument.
• Art of Problem Solving community (https://artofproblemsolving.com/community) — the home of competition math; the Olympiad and Putnam forums are where the hardest problems get dissected line by line.
• OEIS (https://oeis.org) — keep it open while solving: enumerate a few terms, look them up, and frequently find the closed form or paper that cracks a Project Euler problem.
• Wilmott forums and QuantNet — old-school but deep quant-finance discussion, interview threads, and book recommendations.
• Numberphile and Mathologer on YouTube — for the joy of hard math and a steady stream of new puzzle rabbit holes.
• Fiddler on the Proof (https://thefiddler.substack.com) and Presh Talwalkar's Mind Your Decisions — a weekly drip of fresh, well-posed puzzles (the Riddler moved here after FiveThirtyEight shut down) to keep the habit alive.
• Competitions to enter as you level up: Jane Street's own events (Electronic Trading Challenge, Estimathon), Putnam (if eligible), Optiver/IMC trading games, and the hidden high-difficulty Project Euler problems.
• People to follow: Edward Thorp, Cliff Asness (AQR, markets side), Sanjoy Mahajan (The Art of Insight, estimation), Tim Roughgarden (algorithmic game theory), Kiran Kedlaya (Putnam), and the Jane Street puzzle setters.
• If this REALLY clicks, the natural next escalations are: stochastic calculus (Shreve's two volumes), algorithmic game theory (Roughgarden's free Stanford course + lecture videos), and competitive programming (Codeforces / USACO) — each is its own multi-year obsession that compounds with this one.
• Keep a public solutions repo + a personal 'puzzle log' (problem, my approach, where I got stuck, the key insight). Over years this becomes both your portfolio and your single most valuable study asset — and the seed for the toolkit project.

• You can submit a correct answer to a live Jane Street monthly puzzle — not every month, but reliably enough that it's not luck.
• Given a 'make me a market on X' prompt, you instantly produce a justified bid, ask, and spread, and can explain how adverse selection should widen it.
• You derive (not recall) gambler's ruin, the Kelly fraction, the secretary 1/e rule, and the HH-vs-HT expectation on a whiteboard with no reference.
• You've written 3+ complete Putnam solutions rigorous enough to survive actual grading, and you can tell the difference between a real proof and hand-waving in your own work.
• When you hit a hard problem with no template, you have a reflex sequence — small cases, symmetry, invariants, computer search, OEIS — and you deploy it calmly instead of freezing.
• You can compute Grundy numbers for a game variant you've never seen, code a verifier for it, and prove who wins.
• You reach for linearity of expectation, indicator variables, and state-based recursion automatically, and you catch base-rate / conditioning traps before they catch you.
• You've cleared 10+ Project Euler problems in the 40%+ difficulty tier, meaning you consistently find the structural insight that makes a brute-force-infeasible problem tractable.
• You can fail a brutal problem, log your partial progress, and walk away without it denting your motivation — the relationship with hard problems is now sustainable, even fun.
• You're teaching it: your write-ups, repo, or explanations are clear enough that other people learn the elegant move from you, not just the answer.