Miller–Rabin primality test: Difference between revisions
→Standard Probabilistic
(Undo revision 287079 by Nigel Galloway (talk)) |
|||
Line 4,392:
=={{header|Ruby}}==
===Standard Probabilistic===
From 2.5 Ruby has fast modular exponentiation built in. For alternatives prior to 2.5 please see [[Modular_exponentiation#
<lang ruby>
def miller_rabin_prime?(n, g)
Line 4,429:
puts miller_rabin_prime?(103130593592068072608023213244858971741946977638988649427937324034014356815504971087381663169829571046157738503075005527471064224791270584831779395959349442093395294980019731027051356344056416276026592333932610954020105156667883269888206386119513058400355612571198438511950152690467372712488391425876725831041,1000)
</lang>
===Deterministic for integers < 3,317,044,064,679,887,385,961,981===
It extends '''class Integer''' to make it simpler to use.
| |||