	Department of Mathematics & Computer Science

Next: MA1251 Chaos and Fractals Up: Level 1 Previous: MA1201 Mathematical Modelling

MA1221 Pure Mathematics at Work

MA1221(=MC148) Pure Mathematics at Work

Credits: 10

Convenor: Dr Nicole Snashall

Semester: 1 (weeks 7 to 12)

Prerequisites:		desirable: MA1101(=MC144), MA1102(=MC145)
Assessment:	Projects and course work: 100%	Examination: 0%

Lectures:	18	Problem Classes:	9
Tutorials:	none	Private Study:	48
Labs:	none	Seminars:	none
Project:	none	Other:	none
Surgeries:	none	Total:	75

Explanation of Pre-requisites

Use is made of the following concepts from the modules MA1101 and MA1102: the notion of proof in general; proof by induction; modular arithmetic.

Course Description

The topics to be covered include: Fibonacci series (plant growth), elementary graph theory (travelling salesperson type problems), convex polyhedra (molecular structure), and secret codes (public encryption keys).

Aims

To introduce and study various aspects of Pure Mathematics which are used in real life situations, to introduce some novel ways to use the Mathematics learned elsewhere and to enhance the understanding of that Mathematics.

At the end of the module you should be able to see that Pure Mathematics is not just a dry academic exercise, but that it has useful every day applications. There are many more such applications making use of more advanced mathematics much of which will be met in later modules of the Mathematics degree.

It is hoped also to show that investigating mathematical problems with a ``real-life'' connection is interesting and fun to do.

Objectives

To gain practice and facility in working with modular arithmetic.

To know the definitions of and understand the key concepts introduced in this module.

To work in a group context.

To write a short project.

Transferable Skills

The ability to investigate a problem from different points of view, to draw conclusions and make conjectures.

The ability to present arguments and solutions in a coherent and logical form.

The ability to use the techniques taught within the module to solve problems.

The ability to apply taught principles and concepts to new situations.

Syllabus

Fibonacci series, elementary graph theory, convex polyhedra, secret codes.

Reading list

Background:

N. L. Biggs, Discrete Mathematics, Oxford University Press.

I. Stewart, The Problems of Mathematics, Oxford University Press.

R. J. Wilson and J. J. Watkins, Graphs (an Introductory Approach), Wiley.

Details of Assessment

Details of assessment to be announced. There will be no examination, although there may be class tests.