MA3X8: Combinatorics

Module Provider:

Mathematics

Number of credits:

10 [5 ECTS credits]

Level:

H (Honours)

Terms in which taught:

Spring and Summer

Module Convenor:

Dr WR Johnstone

Pre-requisites:

MA11A or MA11D

Co-requisites:

Modules excluded:

Current from:

2005/6

Aims:
To give an idea of some elementary combinatorial counting principles.
To describe some issues involved with Combinatorial Designs

Assessable learning outcomes:
By the end of the module students are expected to be able to:

Additional outcomes:

Outline content:
The first part of the course will be devoted to various apects of counting. These will include permutations, combinations, combinations with repetition, generating functions, parity arguments, the pigeon-hole principle and the Principle of Inclusion and Exclusion. The second part of the course will be devoted to a discussion of various Combinatorial Designs, including latin squares, orthogonal latin squares, block designs, finite projective planes and finite afine planes.

Brief description of teaching and learning methods:
Lectures supported by problem sheets

Contact hours:

Assessment:
Coursework
Relative percentage of coursework : 0%
Penalties for late submission
For pieces of work contributing more than 10%: deduction of 10 marks (out of 100) up to one week after the deadline, thereafter a mark of zero.
Examinations
An exam of one and a half hours requiring the answers to two questions from three. This contributes 100% of the overall assessment.
Requirements for a pass
A mark of 40% overall.
Reassessment arrangements
Re-examination in August/September only.