Fast Monte Carlo probabilistic algorithm for primality test
Of course, much more efficient algorithms for testing primality exist, but this one is the easiest to understand.
Prime integers can be efficiently found using a primality test.