Miller–Rabin primality test: Difference between revisions

Line 1,042:
# Compute b**e mod m
private def powmod(b, e, m)
r, b = 1, b.to_big_i
b = b.to_big_i % m
while e > 0
r = (rb * br) % m if e.odd?
b = (b * b) % m
e >>= 1
Line 1,123 ⟶ 1,122:
# Compute b**e mod m
private def powmod(b, e, m)
r, b = 1, b.to_big_i
b = b.to_big_i % m
while e > 0
r = (rb * br) % m if e.odd?
b = (b * b) % m
e >>= 1
Anonymous user