Skip to main content
Unit of study_

MATH1004: Discrete Mathematics

This unit provides an introduction to fundamental aspects of discrete mathematics, which deals with 'things that come in chunks that can be counted'. It focuses on the enumeration of a set of numbers, viz. Catalan numbers. Topics include sets and functions, counting principles, discrete probability, Boolean expressions, mathematical induction, linear recurrence relations, graphs and trees.

Code MATH1004
Academic unit Mathematics and Statistics Academic Operations
Credit points 3
MATH1904 or MATH1064
Assumed knowledge:
HSC Mathematics or MATH1111. Students who have not completed HSC Mathematics (or equivalent) are strongly advised to take the Mathematics Bridging Course (offered in February).

At the completion of this unit, you should be able to:

  • LO1. identify combinatorial objects involved in counting problems
  • LO2. understand how to construct switching circuits representing Boolean functions
  • LO3. factor numbers using sieve methods and use the Euclidean algorithm to compute greatest common divisors
  • LO4. solve linear recurrence relations by using generating functions or characteristic equations.

Unit outlines

Unit outlines will be available 2 weeks before the first day of teaching for the relevant session.