 Conway's prime generating algorithm above is essentially a quotient and remainder algorithm within two loops.Given input of the form formula_20 where 0 ≤ "m" < "n", the algorithm tries to divide "n"+1 by each number from "n" down to 1, until it finds the largest number "k" that is a divisor of "n"+1.It then returns 2"n"+1 7"k"-1 and repeats.