Skoči na glavni sadržaj

Osječki matematički list, Vol. 25 No. 2, 2025.

Stručni rad

Primality tests

Bernadin Ibrahimpašić orcid id orcid.org/0009-0003-5902-7208 ; Pedagoški fakultet, Univerzitet u Bihaću *
Sajra Kasić ; Pedagoški fakultet, Univerzitet u Bihaću

* Dopisni autor.

Puni tekst: hrvatski pdf 452 Kb

str. 161-178

preuzimanja: 130

citiraj

Sažetak

In this paper we describe some primality tests with emphasis on probabilistic algorithms. A primality test is an algorithm for determining whether an input number is prime. A probabilistic primality test is a primality test that outputs "probable prime" or "composite" and has certain of error if the output is "probable prime". We will describe Fermat, Solovay – Strassen and Miller – Rabin primality test.

Ključne riječi

primes, pseudoprimes, primality tests

Hrčak ID:

341423

URI

https://hrcak.srce.hr/341423

Datum izdavanja:

10.12.2025.

Podaci na drugim jezicima: hrvatski

Posjeta: 446 *