function [y] = FindPrime(x)

k = 1;
if x >= 2 then
  for i = 2:x
    for j = 2:i
       if modulo(i,j)==0 then
          if (i==j) then
             y(k) = j;
             k    = k + 1;
          else
             break;
          end
       end
    end
  end
else
  y = [];  
  disp('no prime number');
end

y = y(:)';

endfunction