Sum of square and cube digits of an integer are primes: Difference between revisions
Content added Content deleted
Line 723: | Line 723: | ||
sub isPrime(n) |
sub isPrime(n) |
||
local i |
|||
if n < 4 return n >= 2 |
|||
for i = 2 to sqrt(n) |
|||
if n < 2 return false |
|||
if not mod(n, i) return false |
|||
next |
|||
if not mod(n, 3) return n = 3 |
|||
while d*d <= n |
|||
if not mod(n, d) return false |
|||
d = d + 2 |
|||
if not mod(n, d) return false |
|||
d = d + 4 |
|||
wend |
|||
return true |
return true |
||
end sub |
end sub |