Determine if a number is Prime Number
Create a procedure that will determine if a number is Prime number (true) or not (false)
Examples
isPrime(2) -> True
isPrime(14) -> false
The first 20 primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, and 71
Requirements:
Sample Java program - use this for your logic:
that’s all, but this may not be the desired solution of Hossein
Don’t use extension (will add that into requirements). The whole challenge is to code by yourself 
to come up with solutions
Ok, I guessed that
What that % mean I know that is reminder but I didn’t understand can you explain sir please
That’s modulo operation. Use Math modulo block. wiki
Well done…
But take a deep look at java code.
Already used the same logic!
I know but variables declaration/initialization can be improved either in example code or your blocks.
@ravigarg Very good job. You need to add the logic for number 1. Try your procedure and see what you get for procedure(1)
additional challenge: if you got it working for smaller numbers you might want to check, if your solution still works for larger numbers, for example 104729 or even 15485863…
question: why does it not work for larger numbers anymore? And how could this be fixed?
Taifun
It does, but dividing long numbers again and again with long numbers take a lot of time and makes a situation of an infinite loop.
Still Thinking on this one!
Thanks! WIll surely add that.
Updated requirements as above 
Solved by both @bodymindpower and @ravigarg
This topic was automatically closed 30 days after the last reply. New replies are no longer allowed.
