Discrete Mathematics for Computer Science: Algorithms and Recursion

HKUST connects arithmetic and algorithmic thinking through modular operations, greatest common divisors and a cryptographic application. Induction and recursion then provide ways to define and justify procedures. It suits learners who want to see how discrete mathematics supports computer-science reasoning, rather than treat a working algorithm as sufficient evidence that it is correct.

What you will learn

• Work with modular arithmetic and greatest common divisors.
• Connect arithmetic with introductory cryptographic ideas.
• Use induction and recursion to reason about algorithms.

Who this suits

Beginners with preparation in logic, sets and elementary counting; review those foundations first if the notation is unfamiliar.

Before you enroll

Work through examples with a written argument rather than relying on an answer alone. Check definitions, quantifiers and boundary cases, and distinguish a model’s assumptions from the situation it represents. These courses take different routes through discrete mathematics; compare their preparation requirements and topic coverage before choosing a starting point.

Coursera offers paid enrollment or subscription access. Check the enrollment screen for assessment and certificate terms, trials and any financial-aid options. Provider access terms can change; review them before paying.

Put it into practice

Trace a recursive procedure on a small input and state its base case. Explain why each step makes progress and write an induction argument for a simple property.

Source and review

This overview is based on the provider's published information, checked on 12 October 2026. It is an editorial assessment, not a claim that we completed the resource. Time filters are approximate study ranges; projects and exercises can take longer.

View the curriculum and current access options at Coursera.

How YellowCourse describes and checks learning resources.