Elementary Number Theory - Introductory Abstract Algebra

This course brings in elementary number theory as a foundation for abstract algebra. We cover divisibility, prime numbers, greatest common divisors, modular arithmetic, and congruences—all with a focus on the ideas that connect naturally to groups, rings, and fields. Clean, intuitive, and designed for learners building a solid entry point into algebra through number theory.

Payment required for enrolment
Enrolment valid for 12 months
This course is also part of the following learning tracks. You may join a track to gain comprehensive knowledge across related courses.
[UI, Ibadan] MAT 211/213: Abstract Algebra
[UI, Ibadan] MAT 211/213: Abstract Algebra
This learning track brings together the essential building blocks of abstract algebra in one clear, structured path. We begin with the fundamentals—set theory, relations, and mappings—to build the logical foundation for working with algebraic systems. Then we move into binary operations, groups, subgroups, and homomorphisms, helping you develop the tools to recognize structure and symmetry. The track wraps up with rings, fields, and key ideas from elementary number theory that tie everything together. Curated for second-year undergraduates in engineering and physical sciences at the University of Ibadan, but equally valuable for any learner stepping into abstract algebra for the first time. Clear, focused, and paced to guide you with both depth and intuition.

This learning track brings together the essential building blocks of abstract algebra in one clear, structured path. We begin with the fundamentals—set theory, relations, and mappings—to build the logical foundation for working with algebraic systems. Then we move into binary operations, groups, subgroups, and homomorphisms, helping you develop the tools to recognize structure and symmetry. The track wraps up with rings, fields, and key ideas from elementary number theory that tie everything together. Curated for second-year undergraduates in engineering and physical sciences at the University of Ibadan, but equally valuable for any learner stepping into abstract algebra for the first time. Clear, focused, and paced to guide you with both depth and intuition.

[OAU, Ife] MTH 205: Introduction to Algebra
[OAU, Ife] MTH 205: Introduction to Algebra
This track offers a clear guide to the core ideas of modern algebra — from the fundamentals of Set Theory, Relations, and Mappings to the study of Groups, their important parts called Subgroups, and the links between them known as Homomorphisms. The material concludes with other key structures like Rings, Fields, and some Elementary Number Theory. Beyond the theory, the courses train you to think logically and solve complex problems. These skills are essential in computer science for areas like cryptography and algorithm design, and they form a basis for higher-level mathematics. MTH 205: Introduction to Algebra is designed for second-year mathematics and computer science students at Obafemi Awolowo University, Nigeria. It is also valuable for other students and professionals who want a solid grasp of abstract mathematics.

This track offers a clear guide to the core ideas of modern algebra — from the fundamentals of Set Theory, Relations, and Mappings to the study of Groups, their important parts called Subgroups, and the links between them known as Homomorphisms. The material concludes with other key structures like Rings, Fields, and some Elementary Number Theory. Beyond the theory, the courses train you to think logically and solve complex problems. These skills are essential in computer science for areas like cryptography and algorithm design, and they form a basis for higher-level mathematics. MTH 205: Introduction to Algebra is designed for second-year mathematics and computer science students at Obafemi Awolowo University, Nigeria. It is also valuable for other students and professionals who want a solid grasp of abstract mathematics.

Course Chapters

1
Introduction

Welcome to the course and review of number systems.

No lesson yet.

2
Divisibility

Definition and Euclidean algorithm, notations, and simple consequences.

No lesson yet.

3
Greatest Common Divisor (GCD)

Definition, computation using Euclidean algorithm.

No lesson yet.

4
Congruence and Residue Systems

Definition, notation, and properties of congruence, complete and reduced residue systems, including examples.

No lesson yet.

5
Polynomials

Polynomials with integer coefficients, polynomial congruence modulo n, and basic operations.

No lesson yet.