How do I find the nearest prime number greater than the input? This is what I've managed to do so far...

function out = next_prime(X)
out = 0;
n = 0;
while out == isprime(X)
        n = n + 1;
       out = out + n + X;
      
   end
end

Answer 1

[Deepak]

Hey @Saviyo Therattil,

You can complete your code with this method -

function out = next_prime(X)
    out = X + 1; % Initialize the output as the next number after X
    while ~isprime(out)
        out = out + 1; % Increment the output by 1 until a prime number is found
    end
end