Prime anagrams

[franktaw at netscape.net]

It isn't clear that you want to define this to prohibit duplicate 
digits.  Up to n=9, the optimal solution will probably always have all 
digits different.  But, to me, the problem is more interesting if you 
allow duplicate digits, so that the sequence is infinite.

(Though, I must admit, I don't find it all that interesting to start 
with.)

Franklin T. Adams-Watters

-----Original Message-----
From: zak seidov <zakseidov at yahoo.com>

--- hv at crypt.org wrote:

>
> Here's some numbers I calculated:
>
>  n a(n)    b(n) c(n)    d(n)
> ============================
>  1    1       2    1       2
>  2    2      13    2      13
>  3    4     149    4      17
>  4   11    1237   11    1237
>  5   39   13789   39   13789
>  6  148  123479  160   13789
>  7  731 1235789  738  123479
...8...?......?.............
...9...0....................
wihout zero, there is no 9d pandigit prime :)

>
> n = number of digits; a(n) = maximal number of
> permutations that are prime;
> b(n) = smallest prime example of a(n); c(n) = a(n)
> but allowing leading zero
> digits; d(n) = smallest prime example of c(n).
<................>
>
> Hugo V.
>
Zak

__________________________________________________
Do You Yahoo!?
Tired of spam?  Yahoo! Mail has the best spam protection around
http://mail.yahoo.com


___________________________________________________
Try the New Netscape Mail Today!
Virtually Spam-Free | More Storage | Import Your Contact List
http://mail.netscape.com