Anonymous user
Miller–Rabin primality test: Difference between revisions
→This is a correct M-R test implementation for using bases > input.
Line 4,594:
}
end
# 10 digit prime
n = 2147483647
puts "\n number = #{n} is prime? is #{n.primemr?}"
# 18 digit non-prime
n = 844674407370955389
puts "\n number = #{n} is prime? is #{n.primemr?}"
# 19 digit prime
n = 9241386435364257883
puts "\n number = #{n} is prime? is #{n.primemr?}"
# 20 digit prime; largest < 2^64
n = 18446744073709551533
puts "\n number = #{n} is prime? is #{n.primemr?}"
# 58 digit prime
| |||