Question

Using MatLab Write a function called PrimeFinder that receives an integer n as an input argument, and provides an output argument called Primes that is a vector containing all prime numbers between 2 and n, inclusive. Verify the correctness of your code with inserting 13 as the input argument, and check that your output is Primes = [2,3,5,7,11,13]. You are NOT allowed to use any directly relevant MATLAB built-in function such as divisors, etc.

NOTE: A prime number is a number that is only divisible by 1 and itself.

HINT: Your function should go through all integers between 2 and n, one by one, and check if that number is divisible by any number other than 1 or itself. If the number turned out to be a prime number, it should be appended to the end of the output argument vector before moving on to the next number.

Answer 1

function result = PrimeFinder(n)
result = [];
index = 1;
for i = 2:n
j = 2;
while j <= sqrt(i)
if(mod(i,j) == 0)
break;
end
j = j + 1;
end
if(j>sqrt(i))
result(index) = i;
index = index + 1;
end
end
end

$\color{red}\underline{Output:}$

octave:2> PrimeFinder (13) ans 2 3 5711 13

$\color{red}Please\; upvote\;the \;solution \;if \;it \;helped.\;Thanks!$