This module is not currently running in 2024 to 2025.
Can we square a circle? Can we trisect an angle? These two questions were studied by the Ancient Greeks and were only solved in the 19th century using algebraic structures such as rings, fields and polynomials. In this module, we introduce these ideas and concepts and show how they generalise well-known objects such as integers, rational numbers, prime numbers, etc. The theory is then applied to solve problems in Geometry and Number Theory. This part of algebra has many applications in electronic communication, in particular in coding theory and cryptography.
Total contact hours: 42
Private study hours: 108
Total study hours: 150
Assessment 1 (10-15 hrs) 20%
Assessment 2 (10-15 hrs) 20%
Examination (2 hours) 60%
Reassessment methods:
Like-for-like
R. Allenby, Rings, fields and groups: an introduction to abstract algebra, Oxford: Butterworth/Heinemann, Second edition, 1991 (reprinted 2003).
J. Howie, Fields and Galois Theory, Springer, 2006.
A. Knapp, Basic Algebra, Birkhäuser, 2006
See the library reading list for this module (Canterbury)
The intended subject specific learning outcomes. On successfully completing the module students will be able to:
1 demonstrate knowledge and critical understanding of the well-established principles within abstract algebra and its applications;
2 demonstrate the capability to use a range of established techniques and a reasonable level of skill in calculation and manipulation of the material to solve problems in the
following areas: rings, fields and polynomials;
3 apply the concepts and principles in basic abstract algebra in well-defined contexts beyond those in which they were first studied, showing the ability to evaluate critically
the appropriateness of different tools and techniques.
University of Kent makes every effort to ensure that module information is accurate for the relevant academic session and to provide educational services as described. However, courses, services and other matters may be subject to change. Please read our full disclaimer.
