units

MAT1830

Faculty of Information Technology

18 September 2017
20 October 2019

Monash home | About Monash | Faculties | Campuses | Contact Monash |

Staff directory | A-Z index | Site map |

## 6 points, SCA Band 0 (NATIONAL PRIORITY), 0.125 EFTSLRefer to the specific census and withdrawal dates for the semester(s) in which this unit is offered.
## SynopsisTopics 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.
## AssessmentExamination (3 hours): 70%; In-semester assessment: 30% ## Chief examiner(s)## Contact hours3 hrs lectures/wk, 1 hr tutorial/wk ## ProhibitionsMAT1077, MTH1112 ## Additional information on this unit is available from the faculty at: |