Testování prvočíselnosti

Abstract

This thesis describes the most famous primality tests. The first two chapters are about basic terms, definitions and proofs. The third chapter describes Fermat-Euler theorem, which was later used in the derivation of Fermat and Miller-Rabin primality test. The other chapters are about probabilistic and deterministic primality tests, specifically about their theoretical basis, derivation and description. These chapters also contain algorithm, which is deployed in Matlab and Maple.