function primeList = getPrimeList(N)
primeList = zeros(1, N); % preallokerer
primeList(1) = 2;
pos = 1;
numberToCheck = 3;
while primeList(end) == 0
isPrime = true;
for i = 1 : pos
if mod(numberToCheck, primeList(i)) == 0
isPrime = false;
break
end
if ceil(sqrt(numberToCheck)) < primeList(i)
break
end
end
if isPrime
pos = pos + 1;
primeList(pos) = numberToCheck;
end
numberToCheck = numberToCheck + 2;
end
end
% En alternativ approach, denne genererer ikke et bestemt antall primtall, men alle primtall opp til N
n = 1000000;
primes = 2:n;
for i = 2 : round(sqrt(n))
primes(mod(primes,i) == 0 & primes ~= i) = [];
end
|