25 lines
479 B
Text
25 lines
479 B
Text
function b = isthisprime(n)
|
|
for r = 1:rows(n)
|
|
for c = 1:columns(n)
|
|
b(r,c) = false;
|
|
if ( n(r,c) == 2 )
|
|
b(r,c) = true;
|
|
elseif ( (n(r,c) < 2) || (mod(n(r,c),2) == 0) )
|
|
b(r,c) = false;
|
|
else
|
|
b(r,c) = true;
|
|
for i = 3:2:sqrt(n(r,c))
|
|
if ( mod(n(r,c), i) == 0 )
|
|
b(r,c) = false;
|
|
break;
|
|
endif
|
|
endfor
|
|
endif
|
|
endfor
|
|
endfor
|
|
endfunction
|
|
|
|
% as test, print prime numbers from 1 to 100
|
|
p = [1:100];
|
|
pv = isthisprime(p);
|
|
disp(p( pv ));
|