An efficient prime number checker that can check prime numbers very fast.
It uses an efficient mechanism of log (N) where N is the number of digits in the input.
Type "yelp" to get an basic idea/intro of what it does. Type "authors" to print the authors/contibutors that created this code. Type "version" to see the version of the code.