MAT1130

Graphs, logic and numbers

Coordinator: Associate Professor John Stillwell

6 points
* Three 1-hour lectures and 1 hour of tutorial work per week
* First/second semester
* Clayton
* Prerequisites: At levels 3 and 4, VCE Mathematical Methods
* Prohibitions: GAS1614, MAT1077, MAT1470, MAT1830

Objectives On the completion of this subject students will understand what a proof is; be able to construct proofs using modus ponens, contradiction and mathematical induction; be able to represent information using numbers, relations, functions and graphs.

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.

Assessment Examination (3 hours): 85%
* Assignments and/or practicals: 15%

Recommended texts

Grossman P A Discrete mathematics for computing Macmillan, 1995