Reply
Mon 21 Nov, 2005 04:03 pm
I need some help on a problem I have. I am getting a number generator algorithm designed and need to know how many "codes" can be generated using the following two methods:
Assume, code is structured:
AAAA-BBBB-CCCC-DDDD
Both letters and numbers can be used and that case is not sensitive, how many codes could I make with this?
How about if we add 1 space to each:
AAAAA-BBBBB-CCCCC-DDDDD
How many max codes could I make with each one?
Anyone willing to help - would you show me how you get the answer? Thanks.
If each character can be A-Z or 0-9, then the number of codes is
36^n
where n is the number of characters in the code.
That is what I thought but I was not 100% sure.
Thanks for your reply
Stumble It!
Tweet This
Bookmark on Delicious
Share on Facebook
Share on MySpace