You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 9 Next »

a)

function boolean = isPrime(N)
boolean = true;
for a = 1:2:ceil(sqrt(N)) 
    if mod(N, a) == 0
        boolean = false;
        return;
    end
end
end

b)

      104743.

c)

function res = prime(a)
res = 1;
if isDevisable(a,2)
    res = 0;
    return;
end
for b = 1:2:ceil(sqrt(a)) 
    if isDevisable(a,b)
        res = 0;
        break;
    end
end
end

d) og e)

les = fopen('prim.txt','r');
if les ==-1
    break;
end
A = fscanf(les,'%f');
if isempty(A)  % Om filen er tom skriver vi '2' inn i den.
    x = 2;
    A(1)= 2;
    skriv = fopen('prim.txt','w');
    fprintf(skriv, '%20f\r\n',x);
else %  Ellers skriver vi inn alt,
    skriv = fopen('prim.txt','w');
    x = A(end);
    fprintf(skriv, '%20f\r\n',A);
end
while (length(A) < 1500200)
    
    x = x + 1;
    i=1;
    prime = 1;
    while sqrt(x)>= A(i)
        if x/A(i) == floor(x/A(i))
            prime = 0;
            break;
        end
        i = i+1;
    end
    
    
    if prime % Legger det til i listen, og til filen.
        fprintf(skriv, '%20f\r\n',x);
        A = [A; x];
    end
end
fclose('all');

  • No labels