Course MAT-40-13-K-7
Algorithmic Number Theory (4V+2U, 9.0 LP)
Course Type
SWS | Type | Course Form | CP (Effort) | Presence-Time / Self-Study | |
---|---|---|---|---|---|
- | K | Lecture with exercise classes (V/U) | 9.0 CP | ||
4 | V | Lecture | 56 h | 124 h | |
2 | U | Exercise class (in small groups) | 28 h | 62 h | |
(4V+2U) | 9.0 CP | 84 h | 186 h |
Basedata
Contents
- LLL algorithm,
- Algebraic number fields, rings of integers, units, class groups,
- Behaviour of decomposition of prime numbers,
- Algorithmic computation of these values.
Literature
- H. Cohen: A Course in Computational Algebraic Number Theory,
- M. Pohst, H. Zassenhaus: Algorithmic Algebraic Number Theory,
- M. Pohst: Computational Algebraic Number Theory,
- D. Marcus: Number Fields.
Materials
Further literature will be announced in the lecture; Exercise material is provided.
Registration
Registration for the exercise classes via the online administration system URM (https://urm.mathematik.uni-kl.de)
Requirements for attendance (informal)
Basic properties of Dedekind rings from the course [MAT-40-11-K-4] are used. Knowledge of the module [MAT-40-29-M-4] is desirable and helpful.
Modules:
Courses
- [MAT-12-11-K-2] Algebraic Structures (2V+2U, 5.5 LP)
- [MAT-12-22-K-3] Introduction to Algebra (2V+1U, 4.5 LP)
Requirements for attendance (formal)
None
References to Course [MAT-40-13-K-7]
Module | Name | Context | |
---|---|---|---|
[MAT-40-13-M-7] | Algorithmic Number Theory | P: Obligatory | 4V+2U, 9.0 LP |