Jump to content

Ultra useful primes: Difference between revisions

(Added C)
Line 326:
see "works..." + nl
limit = 10
 
for n = 1 to limit
k = 0-1
flag = 0
while true
k = k ++ 2
num = pow(2,pow(2,n)) - k
if isPrime(num)
Line 349 ⟶ 350:
if (num % i = 0) return 0 ok
next
return 1
</syntaxhighlight>
{{out}}
2,468

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.