Primality by Wilson's theorem: Difference between revisions

m
Line 182:
 
=={{header|Julia}}==
<lang julia>function modfactiswilsonprime(n, p)
(p < 2 || (p > 2 && iseven(p))) && return false
ret = one(n)
modfact, n = one(p), p - 1
while n > 0
m = n % p
for i in 1:m
retmodfact = (retmodfact * i) % p
end
isodd(n ÷= p) && (retmodfact = p - retmodfact)
end
return retmodfact == p - 1
end
 
iswilsonprime(n) = (n < 2 || (n > 2 && iseven(n))) ? false : modfact(n - 1, n) == n - 1
 
function nwilsonprimesabove(N, bottom=1)
4,108

edits