Combinatorics: Strategies and Methods for Counting
Updated on
Course overview
- Provider
- Futurelearn
- Course type
- Free trial availiable
- Deadline
- Flexible
- Duration
- 4 hours
- Course author
- Alberto Tonolo
Description
Combinatorics is an area of mathematics primarily concerned with counting. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry.
On this free online combinatorics course, you’ll discover a simple and efficient method to translate a combinatorial problem into counting the elements of a reference mathematical structure.
You’ll learn basic counting principles, and be able to explain the most frequent errors in their misuse. Ultimately, you’ll discover that combinatorics isn’t as difficult as it seems.
Hear from our courses teamYou can sign up at any time. However, if you’d like to take advantage of feedback from the educators and your mentors, you can do so within the following periods:
June 1 - July 15
December 1 - January 15
Similar courses
-
7 hours
-
29 lessonsCertificate
-
5 hours
-
29 lessonsCertificate
