[ January 13, 2013 ]
Gathering strictly pandigital probable primes (PRP's) of the form
ab^cdef +/- ghij and various other formats

Here we will split up any strictly pandigital number (abcdefghij)
and form the general format ab^cdef+/-ghij into three parts [ 2 | 4 | 4 ]
and test the candidates for probable primeness. Of course
other partitionings/operations are allowed as well like
abc^def+/-ghij, ab!+cdefghij, etc.

First case takes place around the keynumber 10.

A pandigital is a 10-digit number where all the
digits from 0 to 9 appear once and only once.
The list I compiled is about the (probable)
primes around powers of 10 (complete).
I happened to find exactly 10 solutions (3-PRP!).

Underlined displacements means that the prp's are borderprp's.
The two highlighted prp's show a gem as only the digit 4 is moved.
All 10 exponents and 10 displacements are composite !

Range from 10^23456 –/+ 789 to 10^98765 –/+ 432
Both negative and positive displacements result alas in NO PRP solutions !

The smallest one with a positive 7-digit displacement is already prime !
10^2 + 3456789
Starting with base 10 and exponent 2 gives a total of 540 primes.
Quite abundant !
The largest by the way is 10^2 + 9876453.

Let me give you another format example of a pandigital PRP
expression. This is the place were you can submit your findings.
(please, avoid the digit 0 as a leading zero)

130 * 2456^7 + 89

In this section I searched some pandigital expressions
being equal to a palindrome !