Succinct Proofs of Primality for the Factors of Some Fermat Numbers

DOI10.2307/2007482zbMath0478.10005OpenAlexW4247762646WikidataQ56939215 ScholiaQ56939215MaRDI QIDQ3934467

Richard P. Brent

Publication date: 1982

Full work available at URL: https://doi.org/10.2307/2007482

zbMATH Keywords

Monte Carlo methodsfactorizationprimitive rootFermat numbersprimality testing

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Congruences; primitive roots; residue systems (11A07) Software, source code, etc. for problems pertaining to number theory (11-04) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Primes (11A41) Software, source code, etc. for problems pertaining to computer science (68-04)

Related Items

The influence of computers in the development of number theory ⋮ Factorization of the tenth Fermat number

Uses Software

• Algorithm 524