Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Home / Get Math Help

    Adleman-Rumely Primality Test

    Definition

    A modified Miller's primality test which gives a guarantee of primality or compositeness. The algorithm's running time for a number n has been proved to be as O((ln n)^(c ln ln ln n)) for some c>0. It was simplified by Cohen and Lenstra, implemented by Cohen and Lenstra, and subsequently optimized by Bosma and van der Hulst.

    Related term

    Miller's primality test

    Associated person

    Carl Pomerance

    Back to List | POWERED BY THE WOLFRAM LANGUAGE