Question

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

Answer 1

The answer is...

Explanation:

• To find out the prime number out of integer number is easy yet we have to focus on some basic points.
• The main method through which we can perform this task is through an algorithm.
• In this case, Fermat's Little Theorem is used to find the prime number out of integer and 'p'.
• The formula used for that purpose is then ap = a (mod p) and the result will be trivial.

Learn more about it.

Explain Fermat’s Little Theorem.

https://brainly.in/question/13694273