CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search The Miller–Rabin primality test or Rabin–Miller primality test is a primality test : an algorithm which determines whether a given number is prime , similar to the Fermat primality test and the Solovay–Strassen primality test . Its original version, due to Gary L. Miller , is deterministic , but the determinism relies on the unproven generalized Riemann hypothesis ; [ 1 ] Michael O. Rabin modified it to obtain an unconditional probabilistic algorithm . [ 2 ] 1 Concepts 2 Example 3 Least strong pseudoprime to base n 4 Algorithm and running time 5 Accuracy of the test 6 Deterministic variants of the test 7 Notes 8 External links Concepts [ edit ] Just like the Fermat and Solovay–Strassen tests, the Miller–Rabin test relies on an equality or set of equalities that hold true f...