Hi,

Here is my contest entry :)

Address:
Julian Mackeben
Zum Erlengrund 23
21698 Bargstedt
Germany

Just type palprime(n) on a calculator page and it will output the n-th palindromic prime.
The program stores the first 5 palindromic primes which is okay according to a post I read somewhere, right?

My program will first reverse the digits of the number and checks if it is identical with the non-reversed number. If both are identical, it divides that number with every number equal or smaller than sqrt(number) and checks if the remain is 0.

I have done some optimizations, like
- skip even numbers, because there are no even palindromic primes (except 2)
- skip numbers with an even count of digits, because there are no palindromic primes with an even count of digits (except 11)
- skip numbers with 5 as their last digits, because no palindromic prime ends with 5 (except 5)
- make variable names as short as possible to speed up the parsing of the program

Have a nice evening,
Julian (compu)