P = [2];
M=[max(P)+1:100];

for i=1:length(M);

  #Test for primality
  isprime = 1;
  for j=1:length(P);
    if mod(M(i),P(j)) == 0;
      isprime = 0;
      break;
    end
  end

  #Add new prime to list
  if isprime
    P(end+1) = M(i);
  end

end
P