New Skill Forged: Mathematics for Computer Science

Skill Forge web

New Skill Forged

Mathematics for Computer Science by Eric Lehman & Tom Leighton. 340 pages.

MIT’s discrete mathematics course textbook — proof techniques (induction, contradiction), number theory (modular arithmetic, Fermat/Euler), graph theory (trees, coloring, planar, Hall’s theorem), recurrences (Master Theorem, linear recurrences), counting (combinations, inclusion-exclusion, pigeonhole), probability (Bayes, independence, birthday paradox), random variables (binomial, geometric), expected value (linearity), and tail bounds (Markov, Chernoff).

What this skill teaches Claude to do:

  • Apply induction (simple and strong) to prove algorithm correctness
  • Use Fermat’s Little Theorem and Euler’s Theorem to compute modular inverses
  • Analyze graphs: connectivity, trees, bipartiteness, planarity, Hall’s theorem
  • …and 6 more

Browse the full skill at /skills/mathematics-for-computer-science

Forged from 4,939 books. Auto-generated by the Skill Forge pipeline.

view the full skill → /skills/mathematics-for-computer-science