This course aims to provide a first discovery of number theory using elementary techniques (that is techniques mostly built from scratch during the course). You will learn fundamental results on the divisibility of integers, on prime numbers, on Diophantine equations, and hear about famous conjectures in number theory. You will also practice working with congruences modulo an integer, and solving polynomial congruences and systems of linear congruences. This knowledge will be useful to you if you plan to take a course on abstract algebra, or if you are interested in applications of mathematics to cryptography.
| AUs | 4.0 AUs |
| Grade Type | |
| Prerequisite | MH1300 |
| Not Available To Programme | |
| Not Available To All Programme With | |
| Not Available As BDE/UE To Programme | |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | |
| Not Offered As BDE | |
| Not Offered As Unrestricted Elective | |
| Exam |
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |