def primes(kmax):
p = []
k = 0
n = 2
while k < kmax:
i = 0
while i < k and n % p[i] <> 0:
i = i + 1
if i == k:
p.append(n)
k = k + 1
n = n + 1
return p
distrib
>
Mandriva
>
2008.1
>
x86_64
>
media
>
main-backports
>
by-pkgid
>
95859d1855e3bdeb19f63a549226fb8c
>
files
>
126
