MAT1830

Lecturers: Dr Daniel Horsley, Dr John Head

1.1

What this subject is about

1.3

Discrete mathematics studies objects which

have distinct separated values (e.g. integers),
as opposed to objects which vary smoothly
(e.g. real numbers). You can think of it as
being digital mathematics rather than analogue mathematics.

A proof
ment th
As wel
somethi
have a p

Discrete mathematics is particularly important in computer science and the two fields are
very closely linked.

1.4

This course covers a wide range of topics in

discrete mathematics including the following:

As we m
science
this cou
puter sc

Numbers

Numb

Discrete mathematics is particularly important in computer science and the two fields are
very closely linked.
This course covers a wide range of topics in
discrete mathematics including the following:
Numbers
Logic
Induction and recursion
Sets, functions and relations
Graph theory
Cryptography

1.2

What to expect

What we do here might be a bit different to a

1.4

As we m
science a
this cou
puter sc

Numb
enable
ficatio

Logic
progra

Induc
algori

Funct
progra
datab

Graph

 Cryptography

1.2

What to expect

What we do here might be a bit different to a

lot of the maths youve done in the past. Well
be concentrating on really understanding the
concepts, rather than simply learning how to
solve certain types of questions.
For a lot of the questions we ask, there wont
be a single fixed procedure you can apply to
get the answer. Instead, youll have to think
carefully about what the question is asking and
try to work out what is really going on. Dont
be afraid to try different things, play around,
and look at examples.
Well also be emphasising the importance of
proving results.

Functions
programmi
database th

Graph the
solves alloc

Questions

1.1 What ma
would co
count as
grey area

1.2 Why mig

ematicia

1.3 Can you

maths an

1. Wheres the proof?

which
egers),
oothly
f it as
n ana-

imporlds are

pics in
owing:

1.3

Proofs

A proof is essentially just a water-tight argument that a certain statement must be true.
As well see, even if you are pretty sure that
something is true, it can be really useful to
have a proof of it, for a number of reasons.

1.4

Maths in computer science

As we mentioned above, maths and computer

science are very closely related. The topics in
this course all have many applications to computer science. For example:

1. Wheres the proof?

which
egers),
oothly
f it as
n ana-

imporlds are

pics in
owing:

1.3

Proofs

A proof is essentially just a water-tight argument that a certain statement must be true.
As well see, even if you are pretty sure that
something is true, it can be really useful to
have a proof of it, for a number of reasons.

1.4

Maths in computer science

As we mentioned above, maths and computer

science are very closely related. The topics in
this course all have many applications to computer science. For example:

mathematics including the following:

1.3 discrete
Proofs

A proof is essentially just a water-tight argu Numbers

ment that a certain statement must be true.
As well
see, even if you are pretty sure that
Logic
something is true, it can be really useful to

Induction
and
have a proof of it,
forrecursion
a number of reasons.
Sets, functions and relations

1.4 Graph
Maths
in computer science
theory
As we
mentioned above, maths and computer
Cryptography
science are very closely related. The topics in
this course all have many applications to computer
science.
For example:
1.2
What
to expect

puter science. For example:

Number theory is used in cryptography to
enable secure communication, identity verification, online banking and shopping etc.
Logic is used in digital circuit design and in
program control flow.
Induction and recursion are used to study
algorithms and their effectiveness.
Functions are important in the theory of
programming and relations are vital in
database theory and design.

What we do here might be a bit different to a

Number
theory is used in cryptography to
lot of the maths youve done in the past. Well
enable
secure communication,
identity veri- the
be concentrating
on really understanding
fication,
online
banking
and shopping
concepts,
rather
than simply
learningetc.
how to

Graph theory is used in software which

solves allocation and scheduling problems.

solveiscertain
of questions.
Logic
used intypes
digital
circuit design and in
program control flow.
For a lot of the questions we ask, there wont
be a single
procedure
you can
apply to
Induction
andfixed
recursion
are used
to study
get the answer.
Instead,
youll have to think
algorithms
and their
effectiveness.
carefully about what the question is asking and
Functions
areout
important
in the
theory
of
try to work
what is really
going
on. Dont
programming
anddifferent
relations
are play
vitalaround,
in
be afraid to try
things,
database
and design.
and looktheory
at examples.

Questions

Graph
theory
used in software
which of
Well also
be is
emphasising
the importance
solves
allocation
proving
results. and scheduling problems.

1.3 Can you think of other links between

maths and computer science.

1.1 What maths that youve done in the past

would count as discrete? What would
count as continuous instead? Are there
grey areas?
1.2 Why might proofs be important to mathematicians and computer scientists?

Example: Kidney donation

Example: Kidney donation

mathematics including the following:

1.3 discrete
Proofs

A proof is essentially just a water-tight argu Numbers

ment that a certain statement must be true.
As well
see, even if you are pretty sure that
Logic
something is true, it can be really useful to

Induction
and
have a proof of it,
forrecursion
a number of reasons.
Sets, functions and relations

1.4 Graph
Maths
in computer science
theory
As we
mentioned above, maths and computer
Cryptography
science are very closely related. The topics in
this course all have many applications to computer
science.
For example:
1.2
What
to expect

puter science. For example:

Number theory is used in cryptography to
enable secure communication, identity verification, online banking and shopping etc.
Logic is used in digital circuit design and in
program control flow.
Induction and recursion are used to study
algorithms and their effectiveness.
Functions are important in the theory of
programming and relations are vital in
database theory and design.

What we do here might be a bit different to a

Number
theory is used in cryptography to
lot of the maths youve done in the past. Well
enable
secure communication,
identity veri- the
be concentrating
on really understanding
fication,
online
banking
and shopping
concepts,
rather
than simply
learningetc.
how to

Graph theory is used in software which

solves allocation and scheduling problems.

solveiscertain
of questions.
Logic
used intypes
digital
circuit design and in
program control flow.
For a lot of the questions we ask, there wont
be a single
procedure
you can
apply to
Induction
andfixed
recursion
are used
to study
get the answer.
Instead,
youll have to think
algorithms
and their
effectiveness.
carefully about what the question is asking and
Functions
areout
important
in the
theory
of
try to work
what is really
going
on. Dont
programming
anddifferent
relations
are play
vitalaround,
in
be afraid to try
things,
database
and design.
and looktheory
at examples.

Questions

Graph
theory
used in software
which of
Well also
be is
emphasising
the importance
solves
allocation
proving
results. and scheduling problems.

1.3 Can you think of other links between

maths and computer science.

1.1 What maths that youve done in the past

would count as discrete? What would
count as continuous instead? Are there
grey areas?
1.2 Why might proofs be important to mathematicians and computer scientists?