PalindromicPrimeFinder is a little "toy" program that can find relatively big (e.g. 1000-2000 digits) palindromic probable prime (PRP) numbers. It generates random palindromic numbers and tests them for primality using a probabilistic algorithm. It is multi-threaded and stops after a certain timeout (if no palindromic primes are found).
|Tags||Java numbers entertainment|
|Licenses||Public Domain GPLv3|
|Operating Systems||all Java capable systems|
Release Notes: This release adds a basic CLI interface.