Prime anagrams
zak seidov
zakseidov at yahoo.com
Mon Mar 27 17:10:20 CEST 2006
--- 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
More information about the SeqFan
mailing list