Courses / Module

Toggle Print

NUMBER THEORY (E)

Module code: MT613
Credits: 7.5
Semester: 1
Department: MATHEMATICS AND STATISTICS
International:

	Overview
	Module Objective: To give a gentle introduction to number theory. Induction, Euclidean Algorithm, Primes, Diophantine Equations, Number bases, Congruences, Linear Congruences, Chinese Remainder Theorem, Wilson's Theorem, Euler phi function, Fermat's Little Theorem, Cryptography (including the RSA system and the Vigenere cipher). Consideration of how these topics could be taught in a second level classroom.

Overview

Module Objective:
To give a gentle introduction to number theory.

Induction, Euclidean Algorithm, Primes, Diophantine Equations, Number bases, Congruences, Linear Congruences, Chinese Remainder Theorem, Wilson's Theorem, Euler phi function, Fermat's Little Theorem, Cryptography (including the RSA system and the Vigenere cipher). Consideration of how these topics could be taught in a second level classroom.

	Learning Outcomes
	On successful completion of the module, students should be able to: Use proof by induction. Solve systems of linear congruences. State, prove and apply some of the classical theorems of elementary number theory. Encode and decode some simple cryptographic systems. Demonstrate how this topic could be taught in a second level classroom.

Teaching & Learning methods

Assessment

	Autumn Supplementals/Resits
	1.5 hour 'in-house' written examination. Continuous assessment is carried forward to the autumn.

	Timetable
	This timetable is not currently available, please contact the Mathematics And Statistics Department.

Search form

Courses / Module

NUMBER THEORY (E)