Find nearest prime number less than input number.
For example: if the input number is 125, then the nearest prime number which is less than this number is 113.
Be careful, in that 1 is not a prime number. So there is NO prime less than 2.
1 isn't a prime number
agree @bmtran...
You should correct the test suite. 1 isn't a prime number.
Correct the test suite 1 is not prime number.
1 is not a prime number, in order to fulfill with the fundamental theorem of arithmetic:
https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic
https://en.wikipedia.org/wiki/Prime_number#Primality_of_one
I removed the test case where n==2, since 1 is indeed not a prime number. I also added a random test case, so the problem is not so easily cooked by knowing all the test cases.
Well I think number 1 is not a prime number, but I need to pass the test. So I wander all the right answer may be possibly wrong since you have 1.
IMHO 1 is not a prime, so that on input n=2 the correct answer should be [] and not 1.
これで正しいだろ。
you still not change the wrong test suite:4.1 is not a prime.
agree with bainhome
2453 Solvers
Create a cell array out of a struct
175 Solvers
Program an exclusive OR operation with logical operators
593 Solvers
The Answer to Life, the Universe, and Everything
308 Solvers
241 Solvers