Discrete structures.
Continuous progress.
Master the mathematics of computer science. We're building the ultimate learning environment, starting with bijections, proofs, and discrete foundations.
Master the mathematics of computer science. We're building the ultimate learning environment, starting with bijections, proofs, and discrete foundations.
Logic, set theory, combinatorics, graph theory, and proof techniques. The foundation of computer science.
Limits, derivatives, and the fundamental theorem. The mathematics of continuous change.
Coming soon · Fall 2026Vectors, matrices, eigenvalues, and transformations. The language of data and AI.
Coming soon · Winter 2027Integration techniques, series, polar coordinates, and parametric equations.
Coming soon · Spring 2027Algorithms for approximation, root-finding, interpolation, and numerical integration.
Coming soon · Summer 2027Rigorous treatment of limits, continuity, differentiation, and integration on the real line.
Coming soon · Fall 2027A function $f: X \to Y$ is called bijective if it is both:
$$|X| = |Y| \iff \text{exists a bijection between finite sets}$$
⟹ Exercise: Prove that the composition of two bijections is a bijection.
Hint: Show injectivity and surjectivity separately. Let $f: A \to B$ and $g: B \to C$ be bijections. Consider $g \circ f: A \to C$.
Next up: combinatorics — counting principles, permutations, and combinations.
Every concept is introduced with rigorous proofs, building mathematical maturity.
Practice with carefully designed problems that reinforce understanding.
Complex ideas explained through clear diagrams and visual representations.
Learn at your own speed with structured content that builds sequentially.