Topics Prime numbers, the Euclidean Algorithm, congruences, the Chinese remainder theorem, Fermat's little theorem, applications to cryptography Literature:
Dates
Lecture: Monday 12:15 - 13:45, HS III (E.2)
Exercise session 1 (Widenka) : Wednesday 14:00 - 15:30, seminar room 2 (E2.4);
Office hours: Friday 11:00-12:00, E2.4 room 220
Exercise session 2 (Klein): Thursdays 14:15 - 15:45 seminar room 9 (E2.4);
Office hours: Thursdays: 11-12 in the group working room
|