Fast Primality Tests for Numbers Less Than 50 ⋅10 9

DOI10.2307/2008007zbMath0594.10001OpenAlexW2053754425MaRDI QIDQ3724396

Daniel Shanks, G. C. Kurtz, Hugh C. Williams

Publication date: 1986

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

computational number theoryPerrin sequencecubic recurrencesdivisibility properties of sequencesfast primality test

Mathematics Subject Classification ID

Recurrences (11B37) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41)

Related Items (2)

Frobenius pseudoprimes ⋮ On the Number of Elliptic Pseudoprimes

This page was built for publication: Fast Primality Tests for Numbers Less Than 50 ⋅10 9