Miller–Rabin primality test: Difference between revisions

updated FunL
(updated FunL)
(updated FunL)
Line 1,106:
repeat k
a = rnd( 2, n )
x = a^d% mod n
 
if x == 1 or x == n - 1 then continue
Anonymous user