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)
“There is undoubtedly something religious about it: everyone believes that they are special, that they are chosen, that they have a special relation with fate. Here is the test: you turn over card after card to see in which way that is true. If you can defy the odds, you may be saved. And when you are cleaned out, the last penny gone, you are enlightened at last, free perhaps, exhilarated like an ascetic by the falling away of the material world.”
—Andrei Codrescu (b. 1947)