Maia

Ready to start

Discrete

Discrete Mathematics

Logic, sets, counting, graphs, modular arithmetic. Later headings open after the one before. Prove and compute with logic, sets, combinatorics, graphs, and modular arithmetic as a CS discrete-math course does.

  • 6 headings
  • Ladder
  • Test out a heading you have
Start Discrete Mathematics free

Free to start. Sign in with Google or email.

A class on this path

Logic and proof · First class

Live tutor
Materials for this classReadingPodcastLecture

Pick where you want to start

Each heading is its own course. Later ones open when you finish — or skip — the one before. A later course does not reteach earlier bands.

  1. Logic and proof

    Start here

    Translate English into propositions and predicates, and write a direct, contrapositive, or induction proof.

  2. Sets and functions

    After Logic and proof — test out to unlock

    Work unions, images, and injections/surjections, and count a finite set with inclusion-exclusion when needed.

  3. Combinatorics

    After Sets and functions — test out to unlock

    Choose permutations vs combinations, including with repetition, on a worded counting problem.

  4. Graphs

    After Combinatorics — test out to unlock

    Use degree, paths, trees, and bipartite checks, and run BFS/DFS on a small graph by hand.

  5. Recurrence

    After Graphs — test out to unlock

    Set up a recurrence from a process and unwind or solve a linear one.

  6. Modular arithmetic

    After Recurrence — test out to unlock

    Compute with mod, inverses, and a simple RSA-style or hashing example.

What this is for

  1. 01

    Translate English into propositions and predicates, and write a direct, contrapositive, or induction proof.

  2. 02

    Work unions, images, and injections/surjections, and count a finite set with inclusion-exclusion when needed.

  3. 03

    Choose permutations vs combinations, including with repetition, on a worded counting problem.

Why a path, not a playlist

Logic, sets, counting, graphs, modular arithmetic. Later headings open after the one before.

Each heading is its own course with a tutor. Later headings open when you finish — or test out of — the one before.

After you sign in

  • You land on this map — every heading is already there.
  • Take the open class, or test out of a later heading to unlock it.
  • Each heading is one shared course — same syllabus and first class for everyone. Later classes continue on your copy.

Discrete

Start Discrete Mathematics free

Free to start. Sign in with Google or email.