Friday, April 24, 2020

RULE TO CHECK A NUMBER TO BE PRIME


Rule to check a given natural number to be prime


Step
Procedure
Example 1
Example 2
1.
Let n be the given natural number.
Let n = 73
 Let n = 133
2.
Identify greatest perfect square natural number m2 just less than n  i.e.  m2 < n.
Since immediate smaller perfect square is 64 therefore m = 8
Since immediate smaller perfect square is 121 therefore m = 11
3.
Identify all prime numbers less than or equal to m.
Prime numbers < 8 are 2,3,5,7.
Prime numbers 11 are 2,3,5,7,11
4.
The given number n would be a prime number if it is not divisible by any of the above prime numbers.
Since 73 is not divisible by any of these therefore 73 is prime,
Since 133 is  divisible by  7 therefore 133 is not a prime number.

No comments:

Post a Comment