Miller–Rabin primality test: Difference between revisions

→‎{{header|Run BASIC}}: base between 2 and n-1; skip loop if x=1 or x=n-1
(Added EchoLisp)
(→‎{{header|Run BASIC}}: base between 2 and n-1; skip loop if x=1 or x=n-1)
Line 3,039:
 
=={{header|Run BASIC}}==
 
''This code has not been
<lang runbasic>input "Input a number:";n
input "Input test:";k
Line 3,074 ⟶ 3,076:
while k > 0
k = k - 1
xbase = (2 + int(rnd(1) * (n-43))^d) mod n
if x = 1(base^d) or x =mod n-1 then
if x <> 1 and x <> n-1 then
for r=1 To s-1
x =(x * x) mod n
Anonymous user