Discrete Mathematics 3 — 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 320 solved problems) and why these methods work, with step-by-step explanations.
• The concept of number sequences: how we can define them (in various way: explicitly, recursively, verbally, ...) and depict them (as functions from N to R).
• A general introduction to sequences, with illustrations, guessing their closed formulas based on various descriptions and proving closed formulas by induction.
• Famous sequences (Fibonacci sequence, triangular numbers, tetrahedral numbers, perfect squares, powers of two) and their place in Pascal's Triangle.
• Mathematical modelling and finding recursive formulas.
• Sequences of differences and sequences of partial sums.
• Arithmetic progressions and arithmetic sums.
• Geometric progressions and geometric sums.
• Monotone sequences with some examples (arithmetic and geometric progressions and their monotonicity).
• Periodic sequences with some examples (all of them based on elementary Number Theory and modulus).
• Polynomial sequences and their sequences of differences; a complete characterisation of such sequences and a method of finding their closed formula (Ansatz).
• Solving linear recursion with help of characteristic polynomials: the case of real zeros of various multiplicities; homogenous and non-homogenous.
• An introduction to generating functions for sequences.
• Some identities involving the Fibonacci numbers.
• An elementary introduction to some basic concepts in Graph Theory: isomorphic graphs, subgraphs, induced subgraphs, degree of a vertex, adjacency, cycles.
• Special graphs: trees, complete graphs K_n, paths P_n, cycles C_n, bipartite graphs, complete bipartite graphs K_(m,n), the Tutte Graph, the Petersen Graph.
• Trees and their basic properties.
• Planar graphs: Euler's Formula.
• Euler trails and circuits, Hamilton paths and cycles.
• An introduction to graph coloring; monochromatic triangles.
• Chromatic number (defined by proper vertex coloring with minimal number of colors) of certain graphs.
• Chromatic index (defined by proper edge coloring with minimal number of colors) of certain graphs.
• Relations and graphs (covered in DM1).
• A word about matching in bipartite graphs.
• Some applications of DM: Chinese Remainder Theorem, cryptography, quick arithmetic.
• Sequences in algorithms: polynomial and exponential sequences as studied in Sec. 6&7.
• Some advice for further studies of DM.

Before you start

• Basic high school mathematics (mainly arithmetic)
• Discrete Mathematics 1 (or equivalent: logic, sets, functions, relations, proof techniques, basic combinatorics)
• Discrete Mathematics 2 (or equivalent: combinatorics, number theory, algebraic structures)
• 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 3 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 5.0 rating from 316 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 53h 30m

Total runtime is 53h 30m of video, which you work through self-paced with lifetime access. The published syllabus lists 27 outcomes — headlined by how to solve problems in chosen Discrete-Mathematics topics (illustrated with 320 solved problems) and why these methods work, with step-by-step explanations.; the concept of number sequences: how we can define them (in various way: explicitly, recursively, verbally, ...) and depict them (as functions from N to R).; a general introduction to sequences, with illustrations, guessing their closed formulas based on various descriptions and proving closed formulas by induction..

Is the Price Fair After the Coupon Discount?

$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.19 per hour of instruction — cheaper than a coffee per study session. 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.

About This Udemy Course

The official description by Hania Uscka-Wehlou:

Learner Ratings: 5.0★ From 316 Learners

5.0 out of 5 from 316 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 5.0★ 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 · 316+ learners here · ★ 5.0

Full Profile ↗

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