Given a positive integer 'n', the task is to find a prime number greater than or equal to 'n'.
Example 1
If given 'n' is 10, then the closest prime number greater than 10 is 11 at a distance of 1. So 11 must be returned.
Example 2
If the given 'n' is 17, then the closest prime number is itself at a distance of 0. So 17 must be returned.
The returned prime number must be greater than or equal to 'n'.
From test case 2, it seems that you are asking for the closest prime number no less than n. Please clarify this ambiguity in the problem. Otherwise, the answer to test case 2 is 19 (not 23), which is the closest prime number to 20.
Final statement in problem statement disagrees with Case #1 of n=3.
I made a few quick edits.
I suggest to update this problem with big primes.
2022 Solvers
The Hitchhiker's Guide to MATLAB
2573 Solvers
522 Solvers
Output any real number that is neither positive nor negative
237 Solvers
181 Solvers