See it first
Every idea starts as a picture or interactive model, then becomes notation.
Math × CS · Intermediate
Discrete Mathematics for Computer Science
Every algorithm is an argument. This course gives you the mathematical language to state those arguments precisely and prove they hold.
9 modules
~36 hours
Intermediate
What you'll be able to do
- Write proofs by induction and contradiction
- Count possibilities without listing them
- Model networks and dependencies as graphs
- Understand binary, bits and modular arithmetic
Module by module
01Sets and functions
The vocabulary of collections and mappings.
02Predicate logic
Quantifiers — 'for all' and 'there exists' — made concrete.
03Proof techniques
Direct, contrapositive, contradiction, induction.
04Counting
Permutations, combinations and the pigeonhole principle.
05Probability basics
Counting applied to uncertainty.
06Number theory for CS
Divisibility, primes, modular arithmetic and hashing.
07Relations
Equivalence, ordering and what they mean for data.
08Graphs
Paths, cycles, trees and connectivity.
09Recurrences
Describing algorithms that call themselves.
The WyPy way
Reason it through
Guided problems ask you to think and explain, not to copy a method.
Step by step
Short lessons with checkpoints, so each idea is solid before the next.
Who this course is for
Designed for
Computer science students and self-taught programmers who want the mathematics behind algorithms.
Before you start
Mathematical Foundations. Some algebra helps.
Keep going
All courses
More foundations.
Programming
Beginner
Python Foundations with Real Projects
Learn Python by building five real, portfolio-ready projects — with every line understood, not copied.
Computer Science
Intermediate+
DSA Foundations
Data structures and algorithms from first principles — reason about efficiency before you write a line.
Ages 10–14
Foundation
Young Thinkers: Computational Thinking
Puzzles, patterns and playful logic that build a problem-solving mind before the first line of code.