Palindrome Prime Algorithm

In binary, the palindromic primes include the Mersenne primes and the Fermat primes. The first few decimal palindromic primes are: 2, 3, 5, 7, 11, 101, 131, 151, 181, 191, 313, 353, 373, 383, 727, 757, 787, 797, 919, 929. All palindromic primes have an odd number of digits, because the divisibility test for 11 says us that every palindromic number with an even number of digits is a multiple of 11.

Palindrome Prime source code, pseudocode and analysis

COMING SOON!