Get Math Help

GET TUTORING NEAR ME!

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

    Adleman-Pomerance-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.

    Associated person

    Carl Pomerance

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.