Process to Check A Number s Prime or not
Posted by
Ravi Kumar at Wednesday, September 2, 2009
|
Share this post:
|
|
0 Comments
Take the square root of the number.
Round of the square root to the next highest integer call this number as Z.
Check for divisibility of the number N by all prime numbers below Z. If
there is no numbers below the value of Z which divides N then the number
will be prime.
Example 239 is prime or not?
√239 lies between 15 or 16.Hence take the value of Z=16.
Prime numbers less than 16 are 2,3,5,7,11 and 13.
239 is not divisible by any of these. Hence we can conclude that 239
is a prime number.
