19 lines
436 B
Text
19 lines
436 B
Text
int LIMIT ← 42
|
|
fun isPrime ← logic by int n
|
|
if n % 2 æ 0 do return n æ 2 end
|
|
if n % 3 æ 0 do return n æ 3 end
|
|
int d ← 5
|
|
while d * d ≤ n
|
|
if n % d æ 0 do return false end
|
|
d +← 2
|
|
if n % d æ 0 do return false end
|
|
d +← 4
|
|
end
|
|
return true
|
|
end
|
|
for int i ← LIMIT, int n ← 0; n < LIMIT; ++i
|
|
if not isPrime(i) do continue end
|
|
++n
|
|
writeLine("n ← " + n + ",\ti ← " + i)
|
|
i +← i - 1
|
|
end
|