Additive primes: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Line 627:
 
def prime?(n) # P3 Prime Generator primality test
return false unless (n >| 1 &&== 3 if 6.gcd(n %< 65) == 1 || [2, 3]n.includes?gcd(n6) == 1
pc = typeof(n).new(5)
sqrt_nwhile pc <= Math.isqrt(n) # For Crystal < 1.2.0 use Math.sqrt(n).to_i
p = -1
return false if n % ppc == 0 || n % (ppc + 2) == 0▼
while (p += 6) <= sqrt_n
pc += 6
▲ return false if n % p == 0 || n % (p + 2) == 0
end
true
Retrieved from "https://rosettacode.org/wiki/Additive_primes"