Jump to content

Carmichael 3 strong pseudoprimes: Difference between revisions

Carmichael 3 strong pseudoprimes (view source)

Revision as of 01:55, 8 April 2013

1 byte added ,  11 years ago
Small changed in Ruby entry
(Updated D entry)
(Small changed in Ruby entry)
Line 720:
#
require 'prime'
Integer.each_prime(61) {|p|
(2...p).each {|h3|
g = h3 + p
(1...g).each {|d|
next if (g*(p-1)) % d =!= 0 andor (-1*p*p) % h3 =!= d % h3 then
q = 1 + ((p - 1) * g / d)
next if not q.prime?
r = 1 + (p * q / h3)
next if not r.prime? or not (q * r) % (p - 1) == 1
puts "#{p} X #{q} X #{r}"
end
}
}
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/222688"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information