Operations research at the PhD level is essentially applied discrete math — combinatorial optimization, graph algorithms, and logical modeling are Isabella's daily tools at Georgia Tech. Having TA'd college-level math courses at MIT before that, she knows exactly where students stumble on proof by i...

As a computer science major at Duke who has TA'd courses in databases and network architecture, Florence uses discrete math every day — from graph theory and combinatorics to logic and set operations. She unpacks topics like recurrence relations and proof techniques by tying them to the CS applicati...

Winning Duke's DT Stallings Award for sustained tutoring service meant Taariq spent years translating tough mathematical ideas for students who weren't yet comfortable with abstraction — exactly the skill discrete math demands when proof techniques like induction and contradiction replace the equati...

Combinatorics, graph theory, and logical proofs each require a different mode of thinking than the continuous math most students are used to. Shoaib's quantitative economics background gave him extensive practice with set theory, probability counting methods, and formal proof structures — exactly th...

Pre-med students often underestimate how much logical reasoning their science coursework demands — Pratik's biology degree at Cornell, paired with heavy chemistry and physics training, means he's been constructing and evaluating formal arguments across disciplines for years. He applies that same str...

As a computer science major at Harvard, Derek uses discrete math constantly — combinatorics, graph theory, proof techniques, and recurrence relations are woven into nearly every CS course he takes. That daily exposure means he can explain concepts like mathematical induction or the pigeonhole princi...

Graph theory, combinatorics, and proof techniques like induction require a different kind of thinking than the calculus track most math students are used to. Michael digs into the logic-heavy side of discrete math — truth tables, set operations, recurrence relations — with a structured approach shap...

Physics at the theoretical level is essentially applied discrete reasoning — Eamonn's degree in theoretical and mathematical physics means he's spent years constructing the kinds of rigorous logical arguments and combinatorial proofs that discrete math courses demand. He unpacks topics like graph th...

Robotics and control systems at Northwestern mean Michael lives in the world of Boolean logic, state machines, and algorithm design — discrete math concepts that show up in his engineering coursework almost daily. He grounds topics like truth tables and recurrence relations in the signal-processing ...

Computer science at UCLA meant Michael spent serious time with the discrete math that underpins algorithms and data structures — graph traversal, combinatorics, and the logic behind Big-O analysis were woven into nearly every upper-division course. He teaches proof techniques like induction by conne...