I'm sure there is a formula, but I doubt it's a simple formula. (rather something with 26 subterms)
I could dig into it for some time, but firing our script which just counts all combinations seems fine for me! :)
So you are still obsessed with this problem? :)
Cheers Rolf
( addicted to the Perl Programming Language)
In reply to Re^8: Challenge: 8 Letters, Most Words
by LanX
in thread Challenge: 8 Letters, Most Words
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |