求100以内素数
clear,clc
k=[2,3],n=0,count=2;
for i=4:100
for j=2:fix(i/2)
a=mod(i,j);
if a==0
n=0;
break
else
n=1;
end
end
if n==1
k=[k,i];
count=count+1;
end
end
k,count
k =[2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97]
count =25
验证1000以内哥德巴赫猜想
function [k,count] = prime(x)
k=[2,3];n=0;count=2