Discrete Mathematics 2

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

5 out of 5
(279 students enrolled)
Instructor: Hania Uscka-Wehlou
Last Update:
Language: English

Key Takeaways — Course Overview

The following summarizes all verified data points for Discrete Mathematics 2, including pricing, duration, instructor, and coupon validity. All data is sourced directly from Udemy and verified by CoursesWyn on .

Course Title: Discrete Mathematics 2

Platform: Udemy (listed via CoursesWyn)

Instructor: Hania Uscka-Wehlou

Coupon Verified:

Difficulty Level: All Levels

Category: Teaching & Academics

Subcategory: Discrete Math

Duration: 66h 30m of on-demand video

Language: English

Access: Lifetime access to all course lectures and updates

Certificate: Official certificate of completion issued by Udemy upon finishing all course requirements

Top Learning Outcomes: Students who complete Discrete Mathematics 2 will be able to: 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)

Price: $9.99 with coupon / Regular Udemy price: $174.99. Applying this coupon saves you $165.00 (94% OFF).

Important:

This coupon may not function properly in private/incognito browsing mode. Use a standard browser window and temporarily disable ad blockers or VPN services before clicking the redemption link to ensure the discount is applied correctly.

What You'll Learn

Completing Discrete Mathematics 2 gives you the following verified skills and competencies in Teaching & Academics:

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

Requirements

The following background knowledge and tools are recommended before starting Discrete Mathematics 2. Students without these prerequisites may still enroll but should expect a steeper learning curve.

  • 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

The following is the full official course description for Discrete Mathematics 2 as published on Udemy by instructor Hania Uscka-Wehlou. It covers the curriculum structure, teaching methodology, and topic scope for this Teaching & Academics course.

Discrete Mathematics 2

Mathematics from high school to university

S1. Introduction to the course
You will learn: about this course: its content and the optimal way of studying it together with the book.

S2. Combinatorics: the art of counting, cont. from DM1
You will learn: a continuation of topics started in DM1 (permutations, variations, combinations; mathematical modelling), some new stuff (some problems left from DM1, counting functions, counting integer solutions to equations, a generalisation of the Inclusion-exclusion principle, counting derangements), and an introduction to some advanced topics (partitions, multinomial coefficients, Stirling numbers, Twelvefold Way); combinatorial problem solving.


S3. Combinatorial (and not only) proofs
You will learn: various types of proofs of binomial identities, including direct proofs, proofs by induction, proofs by telescoping sums, and combinatorial proofs; this topic was already started in DM1, but now you will see more of it.

S4. A very brief introduction to (discrete) probability
You will learn: how Combinatorics can be applied for (discrete) Probability; this is not a formal course in Probability, just a demonstration of applications of some combinatorial methods for computing probabilities of events; some concepts (briefly) covered in the lectures: experiment, outcome, sample space, event, favourable event (all these were already covered in V9, here you get more examples involving coin toss, rolling dice, drawing balls from an urn, and playing poker), combining events (union and intersection of events), mutually exclusive events, complementary events, independent and dependent events, conditional probability, random variable and its expected value (just enough about it to fulfil the promise from V49 and V59).

S5. An introduction to Number Theory
You will learn: divisibility, prime factorisation, finding primes (sieve of Eratosthenes), Euclid's algorithm for multiple purposes (finding the gcd [greatest common divisor] and lcm [least common multiple] of two natural numbers, solving Diophantine equations, and solving linear equations in modular arithmetic [in Section 6]), Euler's totient function, the sum-of-all-divisors formula, number representation in different position systems (decimal, binary, etc), converting numbers from decimal to other bases (and back). This is not a complete course in Number Theory (which is a huge branch of Maths!), just a basic introduction to some of its topics, the ones that are usually a part of DM courses.

S6. Modular arithmetic
You will learn: the basics of modular arithmetic: addition, subtraction, multiplication, raising to a power; properties of modular arithmetic; relation modulo n as an equivalence relation, equivalence classes and their representatives; tests for divisibility (by 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16); solving congruences, systems of congruences (with a reference to Chinese Remainder Theorem), linear equations, and systems of linear equations in Z_n for different numbers n; Fermat's Little Theorem with several proofs, one of them really exciting (combinatorial); Euler's Totient Theorem; some earlier problems are revisited and solved with new methods.

S7. An introduction to algebraic structures
You will learn: you will get a glimpse into the wonderful world of Abstract Algebra, the domain of mathematics that studies structures such as groups, rings, fields, vector spaces, etc, their properties and relations between them; basic concepts such like binary operations on sets, their associativity and commutativity, neutral elements and inverse elements with respect to the operations; sets with two operations (rings, fields) and the property that binds these operations (distributivity), additive and multiplicative inverses; the concept of a subgroup; cyclic groups; direct (Cartesian) product of structures; groups of permutations and the geometrical interpretation of some of their subgroups; homomorphisms and isomorphisms between structures; Lagrange's Theorem; various examples and illustrations.

Note: This is the second part of our trilogy in Discrete Mathematics. The following subjects will be covered in the next course: sequences (recurrences, generating functions, etc), an introduction to Graph Theory, chosen applications of Discrete Mathematics.

Make sure that you check with your professor what parts of the course you will need for your final exam. Such things vary from country to country, from university to university, and they can even vary from year to year at the same university.

A detailed description of the content of the course, with all the 222 videos and their titles, and with the texts of all the 412 problems solved during this course, is presented in the resource file

“001 List_of_all_Videos_and_Problems_Discrete_Mathematics_2.pdf”

under Video 1 ("Introduction to the course"). This content is also presented in Video 1.

Udemy Coupons Guide

A step-by-step guide explaining how to find and apply 100% OFF Udemy coupons — including when they expire and how to maximize savings.

Read Guide ↗

Compare Similar Courses

The courses below are in the same Discrete Math subcategory on Udemy. Compare ratings, prices, and topics to select the best fit for your learning goals.

View all →

Is This Course Worth It?

Expert review by Andrew Derek, Lead Course Reviewer at CoursesWyn. Last updated: .

Based on analysis of the curriculum structure, student engagement metrics, and verified rating data, Discrete Mathematics 2 is a high-value resource for learners seeking to build skills in Teaching & Academics. Taught by Hania Uscka-Wehlou on Udemy, the 66h 30m course provides a structured progression from foundational concepts to advanced Discrete Math techniques — making it suitable for learners at all levels. The current coupon reduces the price by 94%, from $174.99 to $9.99, removing the primary financial barrier to enrollment.

What We Like (Pros)

The following advantages were identified during our review of Discrete Mathematics 2:

  • Verified 94% price reduction makes this course accessible to learners on any budget.
  • Aggregate student rating of 5 out of 5 indicates high learner satisfaction.
  • Includes an official Udemy completion certificate and lifetime access to all future content updates.

Keep in Mind (Cons)

The following limitations should be considered before enrolling in Discrete Mathematics 2:

  • The depth of Discrete Math coverage may be challenging for absolute beginners without the listed prerequisites.
  • Lifetime access is contingent on the continued operation of the Udemy platform.
  • Hands-on projects and quizzes require additional time investment beyond video watch time.

Andrew Derek

Lead Course Reviewer, CoursesWyn

View credentials →

"Given the 94% price reduction and verified 5-star rating, Discrete Mathematics 2 represents one of the strongest value propositions currently available in Teaching & Academics on Udemy. Enrollment is strongly recommended while this coupon remains active."

Final Verdict: Worth It

Course Rating Summary

Discrete Mathematics 2 holds an aggregate rating of 5 out of 5 based on 279 student reviews on Udemy. The distribution below shows the approximate percentage of students who gave each star rating.

5

279 Verified Ratings

5 stars
95%
4 stars
10%
3 stars
3%
2 stars
1%
1 star
1%

* Rating distribution is approximated from the aggregate score. Sourced from Udemy. Last verified: .

Instructor Profile

The following section provides background information on Hania Uscka-Wehlou, the instructor responsible for creating and maintaining Discrete Mathematics 2 on Udemy.

Discrete Mathematics 2 is taught by Hania Uscka-Wehlou, a Udemy instructor specializing in Teaching & Academics. For the full instructor biography, professional credentials, and a complete list of their courses, visit the official instructor profile on Udemy.

  • Instructor Name: Hania Uscka-Wehlou

  • Subject Area: Teaching & Academics

  • Teaching Approach: Practical, project-based instruction focused on real-world application of Discrete Math skills (as described in the course curriculum on Udemy).

Coupon Help Center

A step-by-step walkthrough showing exactly how to apply a Udemy coupon at checkout — including common issues and how to resolve them.

How to Redeem ↗

Frequently Asked Questions

The following questions and answers cover the most common queries about Discrete Mathematics 2, its coupon code, pricing, and enrollment process. All answers are based on verified data from Udemy as of .

Is there a verified discount coupon for Discrete Mathematics 2?

Yes. A verified Udemy coupon for Discrete Mathematics 2 is available on this page, reducing the price from $174.99 to $9.99 — a saving of $165.00 (94% OFF). The coupon was last verified on March 18, 2026.

How do I apply the Discrete Mathematics 2 coupon code?

Click the "Redeem Coupon" button on this page. The 94% discount is automatically applied to the Udemy checkout link. No manual coupon entry is needed.

How long is the Discrete Mathematics 2 course on Udemy?

Discrete Mathematics 2 consists of 66h 30m of on-demand video. Udemy provides lifetime access to enrolled students, allowing you to revisit all content at any time after purchase.

What skills will I gain from Discrete Mathematics 2?

Discrete Mathematics 2, taught by Hania Uscka-Wehlou on Udemy, covers the following competencies: 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). . These skills are delivered through 66h 30m of structured Discrete Math content, enabling learners to apply knowledge immediately after each module.

What is the Discrete Mathematics 2 Udemy course?

Discrete Mathematics 2 is a 66h 30m online course on Udemy, created and taught by Hania Uscka-Wehlou. It covers Teaching & Academics topics and holds a 5-star rating from 279 enrolled students. Use the verified coupon on this page to access it at $9.99 (94% OFF the regular $174.99 price).
Andrew Derek

Andrew Derek

Expert Reviewer

Andrew Derek is a lead editor and course analyst at CoursesWyn with over 8 years of experience in online education and digital marketing. He meticulously audits every Udemy coupon and course syllabus to ensure students get the highest quality learning materials at the best possible price.

Contact Andrew Verified by CoursesWyn Editorial Team

The following Teaching & Academics courses on Udemy currently have active verified coupons. These are the most recently updated deals in this category.

View All
Certified AI Project Scheduling Masterclass (with ChatGPT)
★ Top Rated
3h 30m
Feb 10, 2026 Project Scheduling

Certified AI Project Scheduling Masterclass (with ChatGPT)

By Advanced Innovation Group Pro Excellence (AIGPE)

Certified AI Project Scheduling Specialist with ChatGPT. Master Scheduling, Timelines, Milestones, Dependencies using AI

4.8
797+
$199.99 $9.99
95% OFF Verified
A deep understanding of AI large language model mechanisms
★ Top Rated
91h
Feb 5, 2026 Large Language Models (LLM)

A deep understanding of AI large language model mechanisms

By Mike X Cohen

Build and train LLM NLP transformers and attention mechanisms (PyTorch). Explore with mechanistic interpretability tools

4.8
9,937+
$99.99 $9.99
90% OFF Verified
Python for Mechanical Engineers
12h 30m
Oct 23, 2025 Python

Python for Mechanical Engineers

By Shriram K

Learn Python to solve problems in mechanical fields.

4.2
7,427+
$119.99 $9.99
92% OFF Verified
GMAT Focus Verbal:Reading+Critical Reasoning| GMAT 760 Tutor
★ Top Rated 🔥 Popular
16h 30m
Nov 29, 2025 Reading Comprehension

GMAT Focus Verbal:Reading+Critical Reasoning| GMAT 760 Tutor

By Jackson Kailath

GMAT Focus | GMAT Verbal Complete Prep | GMAT Reading Comprehension | GMAT Critical Reasoning | GMAT Question Types

4.7
15,380+
$99.99 $9.99
90% OFF Verified