Computation of prime numbers by using a probabilistic algorithm

DOI10.1016/0898-1221(88)90037-5zbMath0647.10003OpenAlexW2025867530MaRDI QIDQ1104354

S. H. Smith

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90037-5

zbMATH Keywords

Pascalprobabilistic algorithmprimality testingMiller-Rabin Test

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41)

Cites Work

• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality