Discrete mathematics plays a key role in machine learning and algorithms. You can use it to find the shortest path (graph theory), encrypt files, compress data, and many other things.
We’ve just posted a careful math course on the Freakodcamp.org YouTube channel. Krol Coric teaches this course. He is a former math teacher and senior Python developer.
The field is constantly evolving along with the development of its key application: computer science. This course is an introduction to this group of mathematical sciences, and we will focus on the main issues on which other branches of discrete mathematics are based: combinatorics, number theory, prime numbers, and several selected topics: the pigeonhole principle, the stars and bars principle, Stilling’s number, and the Chinese remainder theorem.
At the end of the course, there are tips and encouragement for further exploration of the field.
The sections of this course are:
Introduction to Discrete Mathematics
Permits: Definition and Examples
Permit applications
Allow cycles and multi-sets
Computational Permutation: Formulas
Defined in Python with Atertools
A custom Python function to compute permutations
Heap’s algorithm
K-permutations and K-tuples
Product rule
The sum rule
Exercises: Rule of products and sums
Rule of Inclusion Exclusion
Exercises: Inclusion-Exclusion Principle
Arithmetic notation (sigma and pi)
Equilibrium and countable sets
Prove that rational numbers are countable
The Sieve of Prime Numbers and Ertostanes
Basic number generation in Python
Advanced properties of prime numbers
GCD and LCM (greatest common distribution and least common multiple)
Co-prime no
Assemblies (modular math)
Binomial coefficients and Pascal’s triangle
combination
Solving a complex combination problem
Sterling no
Bell no
Chinese remainder theorem
Conclusion and what’s next
View the full course on the freecodecamp.org YouTube channel (9 hour clock)