Wieferich primes: Difference between revisions

m
→‎{{header|Julia}}: simpler version
m (→‎{{header|Julia}}: simpler version)
Line 36:
<lang julia>using Primes
 
is_weiferichprintln(filter(p) =-> (big"2"^(p - 1) - 1) % p^2 == 0, primes(5000))) # [1093, 3511]
 
function weiferich_to(N)
n = 0
while (n = nextprime(n + 1)) < N
is_weiferich(n) && print(n, " ")
end
end
 
weiferich_to(5000) # prints 1093 3511
</lang>
 
4,108

edits