Abstract:
It is shown that the problem of testing Fermat numbers for primality is equivalent to the problem of testing some polynomials over $\mathrm{GF}(2)$ or $\mathrm{GF}(3)$ for irreducibility.
Keywords:irreducible polynomial, prime numbers, Fermat numbers.
Fulltext:
PDF file (457 kB)