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
>
current
>
i586
>
media
>
main-updates
>
by-pkgid
>
78c129e4a46a64625b53d61bd2b90fab
>
files
>
355
