Ultra useful primes: Difference between revisions
→{{header|Ring}}
(Added C) |
|||
Line 326:
see "works..." + nl
limit = 10
for n = 1 to limit
k =
flag = 0
while true
k = k +
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}}
|