Question

Given positive integer p>1 however large,which one is fool proof way of finding out if p is prime?

Answer 1

The full proof way of determining whether a positive integer is prime or not is by checking whether or not it is divisible by any integer other than 1 or itself.

• A number is said to be prime if and only if it is divisible by Just 1 and the number itself.
• if there exists any other factor of the number other than 1 or the number itself, the number is not prime and is hence considered as a composite number.