|
Lecturer(s)
|
-
Koucký Miroslav, doc. RNDr. CSc.
-
Jirsák Čeněk, Mgr.
|
|
Course content
|
Divisibility theory (Euclid's algorithm, GCD, LCM, continued fractions, primes, congruence relation). Groups, finite fields and their applications.
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing)
- Class attendance
- 16 hours per semester
- Preparation for exam
- 65 hours per semester
- Home preparation for classes
- 29 hours per semester
|
|
Learning outcomes
|
Students will learn fundamentals of divisibility and selected parts of algebra.
Theoretical knowledge and ability to apply them.
|
|
Prerequisites
|
Knowledge of the secondary level mathematics
|
|
Assessment methods and criteria
|
Combined examination
Active participation in seminars, credit, knowledge accordant with syllabus.
|
|
Recommended literature
|
-
Adámek, J. Kódování. SNTL, Praha, 1989.
-
Bečvář J. Úvod do algebry. Skripta MFF UK, SPN, Praha 1984..
-
Bican, L. Algebra (pro učitelské studium). Praha, Academia, 2001. ISBN 80-200-0860-8.
-
Hankerson, D., Hoffman, D. Coding Theory and Cryptography: The Essentials.. Mrcel Dekker, 2000. ISBN 0-8247-0465-7.
|