Cognitive science at Stanford trained David to think about how people solve problems — which turns out to be half the battle in contest math, where recognizing *why* you're stuck matters as much as knowing the math itself. He breaks down AMC and MATHCOUNTS problems by coaching students to notice their own reasoning patterns: when they're over-complicating a counting argument, when they're missing a symmetry, or when switching representations would unlock a cleaner path. His 1570 SAT and CS background add computational precision to that metacognitive approach.

Caltech's problem sets are notorious for requiring you to synthesize ideas from multiple fields in a single solution — a habit Brian carried straight into contest math tutoring, where an AMC problem might demand algebra, number theory, and geometric intuition all at once. His dual background in economics and computer science means he naturally approaches problems through optimization and algorithmic reasoning, two lenses that crack open competition questions other strategies miss. He scored a 1580 SAT and was admitted to five of the most selective programs in the country, but contest prep is where his love of creative problem-solving really shows.

Having competed in math competitions throughout high school and scored well, Tracy knows firsthand that contest problems reward creative thinking — not just speed. She teaches the combinatorics shortcuts, number theory tricks, and proof strategies that turn a tough AMC or MATHCOUNTS problem from intimidating into solvable. Her economics background also sharpens the optimization and logic skills that competition math demands.

Kevin's Stanford CS Biocomputation work — building AI systems in Python and C++ — trains exactly the kind of algorithmic thinking that shows up in contest problems disguised as combinatorics or recursive sequences. With a 35 ACT and 1590 SAT, he's no stranger to high-stakes problem-solving under time constraints, and he applies that same precision to breaking down AMC and MATHCOUNTS questions into the logical steps that make unfamiliar problems feel solvable.

Physics at Yale means Ian spends most of his time translating messy real-world scenarios into precise mathematical arguments — a habit that transfers directly to contest problems, where an AMC question might bury a clever geometric insight inside what looks like straightforward algebra. His deep comfort with multivariable calculus and competition math lets him teach students to attack problems from the physics side when pure math stalls: conservation arguments, symmetry reasoning, and dimensional shortcuts that most math-only tutors wouldn't reach for.

Serving as a Course Assistant for Harvard's calculus program means Sanjana regularly fields questions that require thinking sideways — a skill contest math amplifies tenfold, since AMC problems routinely punish students who reach for the standard technique instead of hunting for the elegant one. Her applied math training sharpens that instinct, particularly on problems where a quick modular arithmetic observation or a well-chosen substitution collapses what looks like a ten-step computation into two lines. Rated 5.0 by students.

Dual degrees in physics and math from Yale — plus a PhD in economics — mean Anthony has spent years toggling between abstract proof-writing and applied quantitative reasoning, which is precisely the gear-shifting that AMC and MATHCOUNTS problems demand when they bury a combinatorial insight inside a physics-flavored setup or twist an algebraic identity into something unfamiliar. He teaches students to interrogate a problem's structure before reaching for any formula, building the habit of asking whether a cleverly chosen invariant or a parity argument can replace brute-force computation entirely. Rated 5.0 by students.

Three engineering degrees plus applied mathematics training means Rahi has spent years doing exactly what hard contest problems demand — pulling techniques from algebra, geometry, and number theory simultaneously and figuring out which combination actually cracks the problem. He teaches students to build that same instinct for connecting ideas across topics, which is what separates a student who solves AMC problems from one who just recognizes them.

Materials engineering at Northwestern drilled Michael in the kind of multi-step quantitative reasoning where you have to pull from geometry, algebra, and creative estimation all at once — which is exactly what a tough AMC problem feels like in condensed form. His 34 ACT and 5.0 rating back up the mathematical precision, but it's his instinct for finding elegant shortcuts through messy-looking problems that translates best to contest prep.

Three separate degrees from MIT — Computer Science, Molecular Biology, and Political Science — meant Stephanie spent undergrad constantly translating between formal proofs, experimental reasoning, and argumentative logic, which is the kind of mental versatility that pays off when a contest problem disguises a combinatorics question as geometry or buries a number theory trick inside an algebraic identity. She teaches students to map each problem to the right domain before picking up a pencil, a habit that turns chaotic AMC time pressure into a structured decision process. Rated 5.0 by students.

Molecular biology might seem far from contest math, but Agustin's 1560 SAT and deep calculus background (through AP Calculus BC) reflect the kind of precise, rapid problem-solving that AMC questions demand — especially when a problem buries a combinatorial insight inside what looks like straightforward algebra. He teaches students to stress-test their first instinct on a problem, training them to ask whether a more elegant path exists before committing to computation.

MIT's computer science curriculum drills the kind of algorithmic and discrete reasoning — graph theory, combinatorial proofs, recursive structures — that shows up constantly in contest problems wearing different disguises. Brice applies that training to competition prep by teaching students to decompose an intimidating AMC problem into smaller, recognizable subproblems, the same way a programmer breaks a complex function into modular pieces. His perfect 1600 SAT and 4.9 rating speak to the precision he brings to high-stakes problem-solving.