Miller–Rabin primality test: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,675: / Line 1,675: @@
 =={{header|Ruby}}==
 <lang ruby>def miller_rabin_prime?(n,k)
-  return true if n == 2
-  return false if n < 2 or n % 2 == 0
   d = n - 1
   s = 0
@@ Line 1,697: / Line 1,695: @@
 end
-p primes = (1..100).find_all {|i| miller_rabin_prime?(i,10)}</lang>
+p primes = (3..1000).step(2).find_all {|i| miller_rabin_prime?(i,10)}
+</lang>
 {{out}}
-<pre>[2, 3, 5, 7, 11, 13, 17, ..., 971, 977, 983, 991, 997]</pre>
+<pre>[3, 5, 7, 11, 13, 17, ..., 971, 977, 983, 991, 997]</pre>
 =={{header|Run BASIC}}==