Miller–Rabin primality test: Difference between revisions

Content added Content deleted
(added FunL)
(updated FunL)
Line 1,097:
 
def isProbablyPrimeMillerRabin( n, k ) =
n_1d = n - 1
d = n_1
s = 0
 
Line 1,105 ⟶ 1,104:
d /= 2
 
forrepeat _ <- 1..k
a = rnd( 2, n )
x = a^d%n
Line 1,111 ⟶ 1,110:
if x == 1 or x == n - 1 then continue
 
forrepeat _ <- 1..s - 1
x = x^2%n
 
if x == 1 then return false
 
if x == n_1n - 1 then break
else
return false
Retrieved from "https://rosettacode.org/wiki/Miller–Rabin_primality_test"