Weekly outline
- General
General
NUMBER THEORY (MEM204) - Spring Semester 2019-20Department of Mathematics and Applied Mathematics - University of Crete
NOTE TO ALL STUDENTS: Please enroll so you will be automatically be updated for any news and, for any question or comment, do not hesitate to use the forum below
Basic Information
Lecturer: Giorgos Kapetanakis (gnkapet@gmail.com) Schedule: Wednesday and Friday 15.00-17.00 (Α214) Office Hours: Wednesday and Friday 14.00-15.00 (Γ212 Zoom link - Password: 2RcQwW) Please contact me via email if you want to arrange a meeting. Grading: Final Exam. Bibliography
- Ι. Αντωνιάδης και Α. Κοντογεώργης, Θεωρία αριθμών και εφαρμογές. Εκδόσεις Κάλλιπος, 2015.
- Μ. Παπαδημητράκης, Θεωρία Αριθμών: Πρόχειρες Σημειώσεις.
- Ν. Τζανάκης, Θεμελιώδης Θεωρία Αριθμών.
- Δ. Πουλάκης, Θεωρία αριθμών, εκδόσεις Ζήτη, 1997.
- T. Apostol, Εισαγωγή στην αναλυτική θεωρία των αριθμών, Gutenberg, 2005. (μετάφραση Α. Ζαχαρίου και Ε. Ζαχαρίου)
- K. Rosen, Elementary Number Theory and Its Applications [6th edition], Pearson, 2011.
- Exams
- 10 February - 16 February
10 February - 16 February
Divisibility, Euclidean division, greatest common divisor, Euclidean algorithm, least common multiple, prime numbers (definition, basic properties, Euclid's theorem), the fundamental theorem of arithmetic. (Paragraphs 2.1-2.7 of [4])
- 17 February - 23 February
17 February - 23 February
We applied the fundamental theorem of arithmetic on divisibility, the greatest common divisor and the least common multiple. We defined arithmetic functions and the Dirichlet product and saw some of its basic properties. We saw some relevant examples and exercises. (Paragraphs 2.8 and 3.1 of [4])
- 24 February - 1 March
24 February - 1 March
We defined (completely) additive and (completely) multiplicative functions. We then focused on multiplicative functions and proved some of their properties. We then focused on the Möbius function, we proved the Möbius inversion formula and we saw the basic properties of Euler's \(\phi\) function. We concluded with some remarks on perfect numbers. (Paragraphs 3.2, 3.4, 3.5 and 3.6 of [4])
- 2 March - 8 March
- 9 March - 15 March
9 March - 15 March
We defined and saw the basic properties of the integers modulo \(n\). We defined the complete and the reduced residue systems modulo \(n\). We proved Wilson's theorem, Euler's theorem and Fermat's little theorem. We defined the order of an integer modulo \(n\) and saw a few relevant exercises. (Paragraphs 4.1-4.6 of [4])
- 16 March - 22 March
- 23 March - 29 March
- 30 March - 5 April
- 6 April - 12 April
6 April - 12 April
Linear congruences and systems of linear congruences. The Chinese Remainder Theorem. We saw a few relevant examples. (Paragraphs 4.7 and 4.8 of [4])
In the original version of the slides, there was a typo in the 10th slide, that also found its way to the video. Please look at the slides for the correct version.
In the original version of the slides, there was a typo in the 10th slide, that also found its way to the video. Please look at the slides for the correct version.
- 13 April - 19 April
13 April - 19 April
We solved the exercises of the 3rd set and saw a few additional examples. We introduced polynomial congruences. (Paragraphs 5.1-5.3 of [4])
In the original version of the slides, there was a numerical error in the 15th slide and a typo in the 4th slide, that also found their way to the video. Please look at the slides for the correct version.
In the original version of the slides, there was a numerical error in the 15th slide and a typo in the 4th slide, that also found their way to the video. Please look at the slides for the correct version.
- 20 April - 26 April
- 27 April - 3 May
27 April - 3 May
Polynomial congruences modulo a prime power. Quadratic residues and the Legendre symbol. The Legendre symbol of -1 and 2, The quadratic reciprocity law. (Paragraphs 5.3, 6.1 and 6.2 of [4])
In the original version of the slides, there was a typo in the 14th slide, that also found its way to the video. Please look at the slides for the correct version.
In the original version of the slides, there was a typo in the 14th slide, that also found its way to the video. Please look at the slides for the correct version.
- 4 May - 10 May
4 May - 10 May
The Jacobi symbol and relevant examples. Further, we answered the 4th set and we saw a few additional exercises. (Paragraph 6.3 of [4])
In the original version of the slides, there was a numerical error in the 7th slide that also found its way to the video. Please look at the slides for the correct version.
In the original version of the slides, there was a numerical error in the 7th slide that also found its way to the video. Please look at the slides for the correct version.
- 11 May - 17 May
11 May - 17 May
We showed that primitive roots modulo \(n\) exist if and only if \(n=2,4,p^r\) or \(2p^r\), where \(p\) is an odd prime. Also, we counted the number of these roots (if they exist). We saw the RSA cryptosystem. (Paragraph 5.4 of [4])
- 18 May - 24 May
18 May - 24 May
Introduction to Diophantine equations. Linear Diophantine equations. Pythagorian triples, Fermat's last theorem. (Paragraphs 8.1-8.4 of [4])
- 25 May - 31 May
25 May - 31 May
The equation \(ax^2 + by^2 + cz^2=0\), Legendre's theorem. We answered the 5th set. (Paragraph 8.5 of [4])
Please ignore the typo on the title page
Please ignore the typo on the title page.
- 1 June - 7 June