Discrete Math
Introduction
Basic Math Structures
Logic
- Propositional Logic
- Predicates
Proof Basics
- Basic Language
- Overview of Proof Types
- Direct Proofs
- Contraposition
- Contradiction
- Equivalence
- Bad Proofs
Induction Proofs
- Basic Induction
- Strong Induction
- Strengthening the IH
- Bad Induction
Inductive Definitions
- Structures (trees, etc.)
- Recurrence Relations
- Languages/Grammars
Number Theory
- Modular Arithmetic
- Divisors and Primes
- Inverses
- Powers and Fermat's Little Theorem
- Chinese Remainder Theorem
- Cryptograpy
Function Growth
- Asymptotic Notation
- Application: Time Complexity
Graphs
- Definitions
- Properties
- Paths
- Trees and Spanning Trees
- Planarity
- Coloring
Counting
- Basics
- Permutations and Combinations
- Other Scenarios
- Inclusion/Exclusion
Basic Probability
- Probability Spaces
- Events
- Common Distributions
- Expectation
Miscellaneous Math
- Useful Functions
- Powers of Two
Outside Resources

Number Theory

A little number theory and application to cryptography

Note

Material under development.

Where to find us

This website is just one of several places you can find tutorials and content from Logical Learning. Our YouTube channel is the primary source for our video tutorials, and we also release news and information on Instragram and Facebook.

Find us on...

Contact us

Would you like to get in touch with us directly? You can report errors in our tutorials or things you believe can be improved, or even request tutorial topics, via email:

[email protected]