Lecturer(s)


Tlustý Pavel, prof. RNDr. CSc.

Course content

1. Relations and operations. 2. Basic algebraic structures. 3. Natural numbers 4. Divisibility 5. Primes. Prime factorisation. The greatest common divisor 6. The least common multiply 7. Euclidean algorithm 8. Kongruence 9. Euler's Theorem 10. Wilson Theorem 11. Number systeme 12. Divisibility kriteria 13. Diofant equations. Applications. 14. Revision

Learning activities and teaching methods

Monologic (reading, lecture, briefing), Work with text (with textbook, with book), Projection, Elearning
 Class attendance
 56 hours per semester

Learning outcomes

Relations and operations, Basic algebraic structures, group, ring, field. Divisibility, congruence and its properties, Diofant equations and its applications. Euclidian algorithm, Eisenstein criterion.
The student acquires the basic concept of the number theory and is capable of solving simple problems.

Prerequisites

none

Assessment methods and criteria

Oral examination, Written examination
Oral examination, Written examination,

Recommended literature


Crandell, R., Pomerance, C. Prime numbers: a computational perspective,.

Menezes, J. A.:. Handbook of applied cryptography, CRC Press, Boca Raton 1997.

Rosen, K. H.:. Elementary Number Theory and Its Applications, AddisonWesley, 1999.

Tlustý. Obecná algebra pro učitele. České Budějovice. ISBN 8070408286.
