Prime integers can be efficiently found using a primality test.

Of course, much more efficient algorithms for testing primality exist, but this one is the easiest to understand.

Based on some basic theorems in theory of Numbers this program takes advantage of probabilistic algorithm to test a large number for primality.