Monash University Handbook 2010 Undergraduate - Unit

Synopsis

Topics fundamental to mathematics and computing including elementary number theory, sets, relations and functions; methods of logic and proof, especially proof by induction; recurrence relations and difference equations; trees and other graphs.

Objectives

At the completion of this unit students will:

• have an understanding of sets, relations and functions and associated concepts and their uses in mathematics and computer science;
• be able to use basic methods of proof, particularly induction, to solve problems in graph theory, combinatorics and number theory;
• become familiar with simple first and second order recurrence relations;
• will understand the basic concepts and algorithms of number theory, such as the euclidean algorithm and its role in investigating divisors and primes.

Assessment

Examination (3 hours): 70%; In-semester assessment: 30%

Chief examiner(s)

Dr Daniel Delbourgo

Contact hours

3 hrs lectures/wk, 1 hr tutorial/wk

Prohibitions

MAT1077, MTH1112

Additional information on this unit is available from the faculty at:

http://www.infotech.monash.edu.au/units/mat1830