Glese Posted December 10, 2011 Share Posted December 10, 2011 When such a short handle like this one is used: janA378 How many variations are possible is the question I am asking myself, you would have to follow following regulations: 1. It are always four letters and three numeric digits at the end appended. 2. The whole short handle is case-sensitive. 3. The second and fourth letters are always vowels. Can somebody who is good in mathematics shed light in on how to approach calculating the possible variations of this short handle following the regulations? Quote Link to comment Share on other sites More sharing options...
Pikachu2000 Posted December 10, 2011 Share Posted December 10, 2011 Figure out how many possible characters could be used in each individual position, and multiply those numbers. Quote Link to comment Share on other sites More sharing options...
Philip Posted December 10, 2011 Share Posted December 10, 2011 Given this is an English string with no non-traditional characters... 26 letters * 2 (for case sensitivity) 5 vowels (or 6 if you count 'y') * 2 (for case sensitivity) 26 letters * 2 (for case sensitivity) 5 vowels (or 6 if you count 'y') * 2 (for case sensitivity) 10 numbers possible 10 numbers possible 10 numbers possible Without completely giving the answer away, your max under 400 million. Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.