Prime numbers hold a special place in the real world and determining if a number is a prime or not is an important algorithmic task.
One of the most popular probabilistic algorithm is based on Fermat's little theorem
Read this article to understand Fermat's little theorem, a Probabilistic test for Primality in depth
Have a doubt or thought? Join the discussion now
This is a companion discussion topic for the original entry at http://iq.opengenus.org/fermat-little-theorem-primality-test/