Smallest Prime Number Near to an Input of a Function

I was doing Homework Assigment for a Course and Wrote small Function called "next_prime" which finds and returns k, the smallest prime number that is greater than n (Input).

It was Mandatory to Use while Loop and I know that this version is Full of Bugs but I Think It works well with Quite Small Values but with Very Large Ranges it Stopes so I need Youy Help to get a better Solution and here is the Function:-

function k = next_prime(n)
k_test = n+1;
while k_test > n
    r = primes(n+15);
    w = r(r>n);
    k_test = w(1);
    k = k_test;
    return
end 

[Stephen23]

Did you try searching this forum?:

https://www.mathworks.com/matlabcentral/answers/455395-next-prime-number-using-while-loops

https://www.mathworks.com/matlabcentral/answers/383443-function-to-find-the-next-prime-number

Answer 1

[Tatvam Dadheech]

There is an inbuilt function to detect if a number is prime or not .i.e. isprime(n).

Try to loop over every number greater than n and check if its a prime or not using isprime function.

[Ammar Taha]

I Tried what you 've said and it Worked Thanks :)