Module Details |
The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module. |
Title | Numbers, Groups and Codes | ||
Code | MATH142 | ||
Coordinator |
Dr EJ Russell Mathematical Sciences Ewan.Russell@liverpool.ac.uk |
||
Year | CATS Level | Semester | CATS Value |
Session 2024-25 | Level 4 FHEQ | Second Semester | 15 |
Aims |
|
- To provide an introduction to rigorous reasoning in axiomatic systems exemplified by the framework of group theory. - To give an appreciation of the utility and power of group theory as the study of symmetries. - To introduce public-key cryptosystems as used in the transmission of confidential data, and also error-correcting codes used to ensure that transmission of data is accurate. Both of these ideas are illustrations of the application of algebraic techniques. |
Learning Outcomes |
|
(LO1) Be able to apply the Euclidean algorithm to find the greatest common divisor of a pair of positive integers, and use this procedure to find the inverse of an integer modulo a given integer. |
|
(LO2) Be able to solve linear congruences and apply appropriate techniques to solve systems of such congruences. |
|
(LO3) Be able to perform a range of calculations and manipulations with permutations. |
|
(LO4) Recall the definition of a group and a subgroup and be able to identify these in explicit examples. |
|
(LO5) Be able to prove that a given mapping between groups is a homomorphism and identify isomorphic groups. |
|
(LO6) To be able to apply group theoretic ideas to applications with error correcting codes. |
|
(LO7) Engage in project work to investigate applications of the theoretical material covered in the module. |
Syllabus |
|
- Naive set theory; sets and maps, subsets, union and intersection. Cartesian product. - Modular arithmetic. Euclid's algorithm and Bezout's lemma. Linear congruences and invertibility modulo an integer. Fermat's and Euler's theorems. Public key cryptography. - Bijections, permutations. Cycle notation. Order and sign of permutations. - Axioms of group theory. Simple examples (including symmetry groups of geometric figures including platonic solids). Subgroups and Lagrange's theorem. - Homomorphisms and isomorphisms. Examples from modular arithmetic and symmetry groups of geometric figures. - Error correction and detection for binary codes. |
Recommended Texts |
|
Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module. |
Pre-requisites before taking this module (other modules and/or general educational/academic requirements): |
Co-requisite modules: |
Modules for which this module is a pre-requisite: |
Programme(s) (including Year of Study) to which this module is available on a required basis: |
Programme(s) (including Year of Study) to which this module is available on an optional basis: |
Assessment |
||||||
EXAM | Duration | Timing (Semester) |
% of final mark |
Resit/resubmission opportunity |
Penalty for late submission |
Notes |
Final Assessment | 120 | 50 | ||||
CONTINUOUS | Duration | Timing (Semester) |
% of final mark |
Resit/resubmission opportunity |
Penalty for late submission |
Notes |
Class Test remote open book | 0 | 25 | ||||
Group Project Standard UoL penalty applies for late submission. | 150 | 25 |