You are not logged in.
Pages: 1
Ok, I have a question that I just cannot figure out.
I want to find out how many five letter strings I can make if none of the letters are the same. The string must also be in alphabetical order.
For example, ABCDE is okay, but ABCED is not.
Can any one help me?
The only real killer part that I can't figure out is the alphabetical order part.
Offline
Hi shocamefromebay;
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
hi shocamefromebay
Suppose you have found all the ways of using A, B, C, D, and E in some order.
There are 5! = 5x4x3x2x1 = 120 of these.
But only one will be in the correct ( alphabetical ) order so dis-allow 119 possibillities.
But this will be true for any five letters.
eg B, Z, Y, T, and P can only be allowed if the order is BPTYZ, again that is 119 ways, with these letters, dis-allowed.
So to get your answer, take the number of ways (without order considerations) and divide by 120; that should give you the result you want.
Bob
Last edited by Bob (2011-01-17 23:56:53)
Children are not defined by school ...........The Fonz
You cannot teach a man anything; you can only help him find it within himself..........Galileo Galilei
Sometimes I deliberately make mistakes, just to test you! …………….Bob
Offline
I got the same bobbym's answer
65780 ways = 26C5
thank u for the quastion
Last edited by FERMAT'S (2011-01-18 18:32:34)
Offline
That is very good FERMAT's and Bob Bundy!
Yes, that was the hint. For every 5 letters there are 120 ways to arrange them but only one is in alphabetical order.
Everybody helped but so far he has not come back.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Pages: 1