Discrete Mathematics 2 — Udemy Coupon 93% OFF

Quick Verdict: Is This Math Coupon Worth It?

What You'll Learn

Practical takeaways waiting inside this Teaching & Academics 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.

Before you start

• 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.

Is Discrete Mathematics 2 Still Relevant?

The last update landed September 12, 2026 — and for a Teaching & Academics course, freshness is the first thing to verify. An updated date means the instructor still maintains the material; a stale one means you learn last year's version of the tools.

The 4.9 rating from 1,061 learners suggests the content holds up in practice — ratings at that level rarely survive contact with outdated material. The entry bar looks low, which makes this a reasonable first course in the topic rather than a capstone.

What the Course Actually Delivers in 66h 30m

Across 66h 30m of video, you'll work through 30 published outcomes — first up: 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).. Self-paced with lifetime access.

Is the Price Fair After the Coupon Discount?

The real comparison is not list versus coupon, but coupon versus the next-best course at the same sale price — and on ratings-per-dollar, this one compares well. $149.99 is the list price, but Udemy courses at this level almost never sell at list. This coupon brings it to $9.99 — a 93% cut worth $140.00. Spread over the runtime, that is about $0.15 per hour of instruction — cheaper than a coffee per study session.

About This Udemy Course

The official description by Hania Uscka-Wehlou:

Learner Ratings: 4.9★ From 1,061 Learners

4.9 out of 5 from 1,061 learners on Udemy. Estimated split per star below.

* Split estimated from the aggregate score. Source: Udemy. Checked September 12, 2026.

Pros and Cons of This Course

Who Should Enroll (And Who Should Wait)

Enroll now if:

• You want Math skills with a certificate at the end
• You're starting from zero — the entry bar on this one is low
• You trust a 4.9★ learner record over marketing copy
• You want maximum cuts — this code takes 93% off
• You'll actually finish — code seats are limited, collectors waste them

Wait or look elsewhere if:

• You already mastered this topic — the first hours will feel like review
• You need a different language — this course is taught in English
• You collect courses without finishing them — let someone else take the seat

Meet the Instructor

Hania Uscka-Wehlou

Udemy instructor · 1,061+ learners here · ★ 4.9

Full Profile ↗

Hands-on, example-driven teaching around real Teaching & Academics workflows — watch, build alongside, then test yourself with quizzes. Expect around 66h 30m of video.