Discrete Mathematics 1 — 94% OFF Discount Coupon

Your first course in DM and mathematical literacy: logic, sets, proofs, functions, relations, and intro to combinatorics

★4.9 out of 5
2,106 students
Created by Hania Uscka-Wehlou
English
Updated May 2026

Quick Facts — Course Summary

Here's a quick overview of everything you need to know about Discrete Mathematics 1 before you enroll:

•Course Name: Discrete Mathematics 1
•Platform: Udemy
•Instructor: Hania Uscka-Wehlou
•Coupon Last Verified: May 2, 2026
•Level: All Levels
•Topic: Teaching & Academics
•Subtopic: Discrete Math
•Total Time: 61h of video content
•Language: English
•Access Type: Unlimited lifetime access + updates
•Certificate: Included upon completion from Udemy
•Main Skills: How to solve problems in chosen Discrete-Mathematics topics (illustrated with 395 solved problems) and why these methods work, step by step. · Elementary Logic, including proving tautologies that involve implications, conjunctions, and disjunctions; necessary and sufficient conditions. · Elementary Set Theory, including working with intersections and unions of sets, and other set-related topics.
•Requirements: Basic high school mathematics (mainly arithmetic) · 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.
•Current Price: $9.99 (was $174.99). You save $165.00 with 94% discount.
•How to Apply: Click the coupon button to activate your discount automatically
💡
Tip:For best results, apply the coupon in a regular browser window rather than incognito/private mode.

Skills You'll Master

By the end of Discrete Mathematics 1, you'll have these practical skills:

✓How to solve problems in chosen Discrete-Mathematics topics (illustrated with 395 solved problems) and why these methods work, step by step. .
✓Elementary Logic, including proving tautologies that involve implications, conjunctions, and disjunctions; necessary and sufficient conditions. .
✓Elementary Set Theory, including working with intersections and unions of sets, and other set-related topics. .
✓An introduction to mathematical theories, with concepts like axiom, theorem, primitive notion, etc. .
✓The concept of function between two discrete sets: injections, surjections, bijections. .
✓The concept of (a binary) relation as a subset of Cartesian product of two sets: RST relations, order relations, etc. .
✓RST relations and the concept of equivalence classes; an illustration for a modulo relation between integers. .
✓Functions as relations; various ways of depicting functions between two discrete sets; equipotent sets. .
✓An introduction to the topic of sequences, only basic concepts that can be needed in Combinatorics; we come back to the topic of sequences in DM3. .
✓Various proof techniques, including direct proofs, proofs by contradiction, proofs by contrapositive, Mathematical Induction, and Pigeonhole Principle. .
✓A preparation for Combinatorics: the concept of index, the sigma sign (with computational rules), n factorial, n choose k, Pascal's Triangle, Binomial Theorem. .
✓A brief introduction to Combinatorics: the art of counting. Permutations, combinations, paths, etc; the topic will be continued in the first sections of DM2. .
✓Playful logical problems and riddles, including the famous Zebra Puzzle (Einstein's Riddle), and some classical riddles about liars and truth tellers. .
✓This is the first course in Discrete Mathematics, so don't worry that neither Number Theory nor Graph Theory are covered; they will be covered in a sequel.

What You Need Before Starting

Before enrolling in Discrete Mathematics 1, make sure you have:

•Basic high school mathematics (mainly arithmetic)
•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 1 as published on Udemy by instructor Hania Uscka-Wehlou:

Discrete Mathematics 1

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. Preliminaries: "paintbrushes and easels"
You will learn: some basics needed for understanding the new topics discussed in this course.

S3. A very soft start: "painting happy little trees"
You will learn: you will get the first glimpse into various types of problems and tricks that are specific to Discrete Mathematics: proving formulas, motivating formulas, deriving formulas, generalising formulas, a promise of Mathematical Induction, divisibility of numbers (by factoring, by analysing remainders / cases), various ways of dealing with problem solving (mathematical modelling, using graphs, using charts, using Pigeonhole Principle, using the Minimum Principle, [always] using logical thinking; strategies); you will also see some problems that we are not able to solve (yet) but which will be solved in Section 12 where we will learn more about counting; nothing here is based on big theories, just logical thinking; treat it as a "smörgåsbord" (Swedish buffet) of Discrete Mathematics.

S4. Logic
You will learn: the meaning of the symbols used in logic; conjunction, disjunction, implication, equivalence, negation; basic rules of logic (tautologies) and how to prove them; two kinds of quantifiers: existential and universal; necessary and sufficient conditions. This section is almost identical to Section 7 in "Precalculus 1: Basic notions"; I have only removed the material covering the epsilon-delta definition of limit, because it is irrelevant for Discrete Mathematics. I have also added several new problems (Videos 87-93) that were not present in the Precalculus course.

S5. Sets
You will learn: the basic terms and formulas from the Set Theory and the link to Logic; union, intersection, set difference, subset, complement; cardinality of a set; Inclusion-exclusion principle. This section is almost identical to Section 8 in "Precalculus 1: Basic notions".


S6. Functions
You will learn: about functions: various ways of defining functions; domain, codomain, range, graph; surjections, injections, bijections, inverse functions, inverse images; bijections and cardinality of sets; compositions of functions; some examples of monotone and periodic functions. You will get an information about other topics relevant for examining functions (in Calculus) and where to find them (in the Precalculus and Calculus series).

S7. Relations
You will learn: about binary relations generally, and specifically about RST (Reflexive-Symmetric-Transitive) relations, equivalence classes, and about order (partial order) relations. This section is almost identical to Section 9 in "Precalculus 1: Basic notions".

S8. Functions as relations
You will learn: definition of a function as relation between sets: domain and co-domain; injections, surjections, bijections, inverse functions. This section is almost identical to Section 10 in "Precalculus 1: Basic notions".

S9. A very brief introduction to sequences
You will learn: you will get an extremely brief introduction to the topic of sequences: just enough for the next sections in this course (proofs and combinatorics; for the latter we only need finite sequences) and to complete the discussion of functions defined on the set of natural numbers (adding and scaling sequences, monotone sequences); the topic of sequences will be covered very thoroughly and from scratch in DM2.

S10. Various proof techniques
You will learn: the meaning of words axiom, definition, theorem, lemma, proposition, corollary, proof; various types of proofs with some examples: direct proof, indirect proof (proof by contradiction, proof by contrapositive), proof by induction, proof by cases; proving or disproving statements (finding counterexamples).

S11. Factorial, n choose k, and Binomial Theorem
You will learn: some important properties of the sigma symbol; the factorial function, binomial coefficients, Pascal's Triangle; the Binomial Theorem (theorem telling you how to raise a sum of two terms to any positive natural power) with a motivation and a formal proof; I will show you (mostly without proving, as this is moved to DM2, where you will see plenty of proofs, both "regular" and combinatorial) several binomial identities and where you can find even more of them; all this will be really important for the next section (Combinatorics).

S12. Combinatorics: the art of counting, an introduction (TBC in DM2)
You will learn: some basic combinatorial concepts like permutation, variation, and combination; an explanation of the name of binomial coefficients ("n choose k"); counting subsets of a finite set; counting paths on a grid; some examples of combinatorial proofs. Much more follows in DM2, I promise.


Note: This is the first part of our trilogy in Discrete Mathematics. The following subjects will be covered in the next courses: an introduction to Number Theory with modular arithmetic, an introduction to algebraic structures (groups, rings, fields, etc), with groups of permutations and really cool geometrical applications (DM2); sequences (recurrences, generating functions, etc), an introduction to Graph Theory (DM3). The topic of Combinatorics will be further (after the introduction done in DM1) discussed in DM2, followed by a very brief introduction to (discrete) probability.

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 272 videos and their titles, and with the texts of all the 395 problems solved during this course, is presented in the resource file

“001 List_of_all_Videos_and_Problems_Discrete_Mathematics_1.pdf”

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

Is the Discrete Mathematics 1 Coupon Worth It?

Expert review by Andrew Derek, Lead Course Analyst at CoursesWyn.•Last updated: May 2, 2026.

Based on analysis of the curriculum structure, student engagement metrics, and verified rating data, Discrete Mathematics 1 is a high-value resource for learners seeking to build skills inTeaching & Academics. Taught by Hania Uscka-Wehlou on Udemy, the 61h course provides a structured progression from foundational concepts to advanced 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)

  • Verified 94% price reduction makes this course accessible to learners on any budget.
  • Aggregate student rating of 4.9 out of 5 indicates high learner satisfaction.
  • Strong enrollment base with over 2,106 students demonstrates course popularity and trust.
  • 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 1:

  • The depth of Teaching & Academics 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.
Final Verdict: Worth It
This course offers exceptional value with current pricing
✓

Course Rating Summary

Discrete Mathematics 1 Course holds an aggregate rating of 4.9 out of 5 based on 2,106 student reviews on Udemy.

4.9
★★★★★
2,106 Verified Ratings
5 stars
75%
4 stars
15%
3 stars
6%
2 stars
2%
1 star
2%

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

Instructor Profile

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

Discrete Mathematics 1 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 Teaching & Academics skills.

Frequently Asked Questions

The following questions and answers cover the most common queries about Discrete Mathematics 1, its coupon code, pricing, and enrollment process.

About the Author

AD

Andrew Derek

Lead Course Analyst at CoursesWyn with 8+ years of experience evaluating online learning platforms. I've analyzed 500+ Udemy courses and helped thousands of learners choose the right courses for their career goals.

⭐4.8/5 Rating
✓Trusted by 10K+ Students

Explore More Resources

Discover related content and navigation options for Teaching & Academics: