Discrete Mathematics 2 — 94% Off Coupon

Your second course in DM: combinatorics (cont. from DM1), Number Theory, modular arithmetic, and algebraic structures

5.0 279 students enrolledCreated by Hania Uscka-WehlouLast updated: 🌐 English

Course Overview — Key Details

A quick-reference summary of the most important course details: provider, instructor, difficulty, duration, and what the coupon covers.

Course Title: Discrete Mathematics 2
Provider: Udemy (listed via CourseSpeak)
Instructor: Hania Uscka-Wehlou
Coupon Verified On: March 18, 2026
Difficulty Level: All Levels
Category: Teaching & Academics
Subcategory: Discrete Math
Duration: 66h 30m of on-demand video
Language: English
Access: Lifetime Access · Mobile & TV compatible
Certificate: Certificate of completion included
Top Learning Outcomes: How to solve problems in chosen Discrete-Mathematics topics (illustrated with 412 solved problems) and why these methods work, with step-by-step explanations. · Combinatorics, continuation from DM1: permutations, variations (with and without repetitions), combinations; some problems formulated (but not solved) in DM1. · More combinatorial topics, including counting multisets (method by sticks and stones) and a generalisation of the Inclusion-exclusion principle (two versions).
Prerequisites: Basic high school mathematics (mainly arithmetic) · Discrete Mathematics 1 (or equivalent: logic, sets, functions, relations, proof techniques, basic combinatorics)
Coupon: Click REDEEM COUPON below to apply discount
⚠️
Important:This coupon may not function properly in private/incognito browsing mode. Please use a standard browser window and consider temporarily disabling any ad blockers or VPN services for optimal performance.

What You'll Learn

Skills and competencies you'll gain from this Udemy course:

How to solve problems in chosen Discrete-Mathematics topics (illustrated with 412 solved problems) and why these methods work, with step-by-step explanations. .
Combinatorics, continuation from DM1: permutations, variations (with and without repetitions), combinations; some problems formulated (but not solved) in DM1. .
More combinatorial topics, including counting multisets (method by sticks and stones) and a generalisation of the Inclusion-exclusion principle (two versions). .
An introduction to some advanced topics: partitions of sets, multinomial coefficients, Stirling numbers, and the Twelvefold-Way group of problems. .
Various types of proofs of binomial identities: direct proofs, using the Binomial Theorem, induction proofs, proofs by telescoping sums, combinatorial proofs. .
A very brief introduction to (discrete) probability, with some typical examples of experiments like tossing a coin, and rolling dice; probability in poker. .
Some basic concepts in Probability: experiment, outcome, sample space, event, favourable event. .
Combining events (union and intersection of events), mutually exclusive events, complementary event. .
Independent and dependent events, conditional probability. .
Random variable and its expected value (just enough for the Secretary problem). .
Basic concept in Number Theory: prime and composite numbers, divisibility, gcd (greatest common divisor) and lcm (least common multiple), quotient, remainder. .
Euclid's algorithm for multiple purpose (finding the gcd and lcm, solving Diophantine equations, and solving linear equations in modular arithmetic [S6], etc). .
The sum-of-all-divisors formula (based on prime factorisation). .
Euler's totient function (number of natural numbers less than n, relatively prime with n). .
Number representation in different positional systems (decimal, binary, etc). .
Modular arithmetic, counting modulo n, an introduction to the rings Z_n. .
Various properties of modular arithmetic; solving simple congruence equations. .
Tests for divisibility (by 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16). .
Fermat's Little Theorem with four proofs (one of which really delightful). .
Euler's Totient Theorem as a generalisation of Fermat's Little Theorem. .
A basic introduction to main algebraic structures (groups, rings, fields, vector spaces) with some nice examples using the theory from S5 and S6. .
Examples of associative and commutative binary operations defined on different sets, also some examples of operations not having these properties. .
The concepts of a subgroup and a cyclic group with some arithmetic and geometric examples. .
The concept of homomorphism and isomorphism with some examples; properties of homomorphisms; isomorphic groups. .
Invertible elements in Z_n; the fields Z_p with addition and multiplication modulo p; the group of units U_n. .
An introduction to (symmetric) groups of permutations and their subgroups; multiplication of permutations. .
Lagrange's Theorem at the end of the course puts together many elements of DM: groups, number theory, equivalence relations, and partitions of sets. .
Direct product of a number of rings Z_n and a natural isomorphism between this ring and Z_N: a preparation for the Chinese Remainder Theorem (planned for DM3). .
Some geometric examples (dihedral groups: isometries of an equilateral triangle and isometries of a square). .
The course contains a bunch of really fun (maths-competition style) problems, mainly in Section 6.

Course Requirements & Prerequisites

Background knowledge or tools recommended before starting this course:

Basic high school mathematics (mainly arithmetic)
Discrete Mathematics 1 (or equivalent: logic, sets, functions, relations, proof techniques, basic combinatorics)
You are always welcome with your questions. If something in the lectures is unclear, please, ask. It is best to use QA, so that all the other students can see my additional explanations about the unclear topics. Remember: you are never alone with your doubts, and it is to everybody's advantage if you ask your questions on the forum.

About This Udemy Course

Full course description including curriculum, tools covered, and learning methodology:

Complete Udemy Coupons Guide

Everything you need to know about Udemy coupons: where to find them, how they work, how to redeem them, and how to avoid expired codes — explained clearly and honestly.

📖 Read Udemy Coupons Guide →

About the Instructor

This course is taught by Hania Uscka-Wehlou. For full instructor bio, credentials, and other courses they teach, visit the instructor profile on Udemy.

Instructor: Hania Uscka-Wehlou
Field: Teaching & Academics
Teaching Style: Practical, project-based learning (as described in course curriculum)

Is the Discrete Mathematics 2 Coupon Worth It?

Discrete Mathematics 2 is a teaching & academics course offered on Udemy by instructor Hania Uscka-Wehlou, spanning 66h 30m of on-demand content. It holds a 5.0/5 rating from over 279 enrolled students.

Through CourseSpeak, you can access this course with a 94% discount coupon. The coupon was last verified on March 18, 2026. Udemy coupons are time-limited and claimed on a first-come basis — we recommend redeeming as soon as possible.

New to redeeming coupons? Visit our How to Redeem Udemy Coupon on CourseSpeak for detailed instructions on how to apply coupon codes.

✓ Our Take: Based on the rating (5.0/5) and enrollment numbers (279 students), this course appears well-regarded in its category. Use the coupon to access it at a significantly reduced price — and judge for yourself using Udemy's 30-day money-back guarantee.

Course Rating Summary

Aggregate rating data sourced from Udemy as of March 2026. For individual student reviews, visit the course page directly.

5.0
279 ratings
5 stars
75%
4 stars
15%
3 stars
6%
2 stars
2%
1 star
2%

* Rating distribution is estimated. For exact per-star counts, visit the Udemy course page.

Frequently Asked Questions

Common questions about enrollment, course access, certification, and how to use the coupon:

About the Author

Josh Smith - Udemy Coupon Expert

Josh Smith

Udemy coupon specialist with 8+ years of experience finding and verifying the best deals. I've helped thousands of students save thousands of dollars on premium courses through carefully curated coupon codes and exclusive discount offers. My mission is making high-quality education accessible and affordable for everyone.

4.8/5 Average Rating
Trusted by 2M+ Students

Follow Us for Daily Coupon Updates

Get notified when we publish new coupon deals and exclusive discount codes.

📖 Visit Our Blog →