Fermat Primality Test - Algorithm and Running Time

Algorithm and Running Time

The algorithm can be written as follows:

Inputs: n: a value to test for primality; k: a parameter that determines the number of times to test for primality Output: composite if n is composite, otherwise probably prime repeat k times: pick a randomly in the range if, then return composite return probably prime

Using fast algorithms for modular exponentiation, the running time of this algorithm is O(k × log2n × log log n × log log log n), where k is the number of times we test a random a, and n is the value we want to test for primality.

Read more about this topic:  Fermat Primality Test

Famous quotes containing the words running and/or time:

    “The shallowest still water is unfathomable. Wherever the trees and skies are reflected, there is more than Atlantic depth, and no danger of fancy running aground.”
    —Henry David Thoreau (1817–1862)

    “Gather ye rosebuds while ye may:
    Old Time is still a-flying;
    And this same flower that smiles today,
    Tomorrow will be dying.”
    —Robert Herrick (1591–1674)