Mathematics

Discrete Mathematics Study Guide

Logic, set theory, combinatorics, graph theory, number theory, and the math foundation of computer science.

Core topics in Discrete Mathematics

Discrete math is most CS students' first proof-heavy course. The induction proofs alone derail people who skated through computational math.

Fennie generates induction-proof problems with hidden steps, training you to write the inductive step explicitly.

Yes — at virtually every CS program. Algorithms and theory build on it directly.

Different math. Most CS students find discrete more directly useful than calculus.

Yes — including induction, contradiction, and direct proofs with step-grading.

Upload your notes, syllabus, or textbook. Fennie builds a Daily Plan in under a minute and rebalances daily based on your performance.

Foundational algebra — variables, equations, inequalities, functions, polynomials, and the gateway to higher math.

Euclidean geometry — points, lines, triangles, circles, proofs, and analytic geometry.

Right-triangle and unit-circle trig, identities, equations, and applications to waves and vectors.

Bridge to calculus — advanced functions, sequences and series, limits, conic sections, and analytic trigonometry.