Am I missing something "obvious" on how to do this one? I know that there are 26! total permutation, but I can't think of any "fancy" ways to count for things like first 13 in alphabetic order, without starting to list them all which is definately not the point of such a problem. Please help --mnoah 17:03, 8 October 2008 (UTC)
