Formula For Primes - Recurrence Relation

Recurrence Relation

Another prime generator is defined by the recurrence relation

where gcd(x, y) denotes the greatest common divisor of x and y. The sequence of differences an + 1 − an starts with 1, 1, 1, 5, 3, 1, 1, 1, 1, 11, 3, 1, 1 (sequence A132199 in OEIS). Rowland (2008) proved that this sequence contains only ones and prime numbers.

Read more about this topic:  Formula For Primes

Famous quotes containing the words recurrence and/or relation:

    “Forgetfulness is necessary to remembrance. Ideas are retained by renovation of that impression which time is always wearing away, and which new images are striving to obliterate. If useless thoughts could be expelled from the mind, all the valuable parts of our knowledge would more frequently recur, and every recurrence would reinstate them in their former place.”
    —Samuel Johnson (1709–1784)

    “A theory of the middle class: that it is not to be determined by its financial situation but rather by its relation to government. That is, one could shade down from an actual ruling or governing class to a class hopelessly out of relation to government, thinking of gov’t as beyond its control, of itself as wholly controlled by gov’t. Somewhere in between and in gradations is the group that has the sense that gov’t exists for it, and shapes its consciousness accordingly.”
    —Lionel Trilling (1905–1975)