Mathematics for computer scientists

Module Link Page:

Note: The first term of the module 06-18189 : Mathematics for Computer Science covers basic aspects of discrete mathematics:

Numbers and arithmetic; elementary set theory, relations and functions; proofs and mathematical induction; elementary counting principles; binomial theorem; graphs and trees.

More details

The lecturer is Mr Brian Philp,

Books: Bibliography

Problem sheets  

Answers available 1 week after tutorial

Sheet 1: answers answers 1.

Sheet 2: answers answers 2.

Sheet 3: answers answers 3.

Sheet 4: answers answers 4.

Sheet 5: answers answers 5.

Sheet 6: answers answers 6.

Sheet 7: answers answers 7.

Sheet 8: answers answers 8.

Sheet 9: answers answers 9.

Sheet 10: answers answers 10.


Current OHP slides from lectures 

OHP slides: Section 1; Section 2; Section 3; Section 4 ; Section 5 ; Section 6; Section 7;

Tests from previous years :

2004    Mid Term test     End Term test

Old OHP slides from lectures


Decimal Notation

Decimal Expansion

Exact Decimals

Square Roots



New sets from old



Set products and power sets

Partions and Equivalence relations (1)

Partions and Equivalence relations (2)

Partial Orders

Linear Orders


Composition and Inverses of Functions

Introduction to Induction

More examples of Induction (including the proof that every natural number greater than 1 is prime or a product of primes, and that every finite partial order can be refined to a linear order)

Combinatorics and counting

More on combinatorics and counting

Please see the PDF notes (given below) on graphs as well.

Additional notes

Algebra of sets

Equivalence relations

Counting and combinatorics


Other information

Lecture Notes











Recommended texts : Discrete Mathematics  by S. Lipshutz  (Schaum Outline Series)

Discrete Mathematics by Amanda Chetwynd and Peter Diggle.

These pages are written by Brian Philp please email me about any inaccuracies you may find in these pages.