primes:=func(n); p:=[1..n]; for j in [1..n] do p(j):=0; end; p(1):=2; p(2):=3; k:=5; for j in [3..n] do while p(j)=0 do test:='yes'; for i in [2..(j-1)] do if k-floor(k/p(i))*p(i)=0 then test:='no'; end; end; if test='yes' then p(j):=k; end; k:=k+2; end; end; return p; end;