Course - Number Theory - MA1301
Number Theory
About
About the course
Course content
This course gives an introduction to elementary number theory. Topics included are: greatest common divisor, Euclidean algorithm, linear diophantine equations, elementary prime number theory, linear congruences, Chinese reminder theorem, Fermat's little theorem, Euler's phi-function, Euler's theorem with application to cryptografi. Topics that may change from one year to another are number theoretical functions, Fermat's last theorem for n = 4, continued fractions, rational approximations, Pell's equations, quadratic reciprocity and generation of random numbers.
Learning outcome
The aim of the course is to give an introduction to elementary number theory, and to show how certain number theoretical theorems can be applied within cryptography.
Learning methods and activities
Lectures, compulsory exercises and mid-semester examination. Portfolio assessment is the basis for the grade awarded in the course. This portfolio comprises a written final examination 80% and the semester assignment 20%. The mid-semester examination only counts if it has a positive effect on the total assessment. The results for the constituent parts are to be given in %-points, while the grade for the whole portfolio (course grade) is given by the letter grading system.
Recommended previous knowledge
There are no prerequesities except grammar school mathematics.
Course materials
Will be announced at the start of the course.
Credit reductions
| Course code | Reduction | From |
|---|---|---|
| MA6301 | 7.5 sp | |
| MNFMA104 | 6 sp | |
| TMA4155 | 3 sp |
Subject areas
- Mathematics