SOLUTION: How many five-letter strings can be made from the 1st 10 letters of the alphabet, without replacement?
Algebra.Com
Question 562216: How many five-letter strings can be made from the 1st 10 letters of the alphabet, without replacement?
Answer by issacodegard(60) (Show Source): You can put this solution on YOUR website!
Hi, the problem is identical to finding the number of 5-lists taken from a 10 set with regard to order (since we are dealing with strings i.e. abcde is not the same as bacde) and without regard to repetition (aabcd is not possible since we are handed the first 10 letters and can't replace one before choosing the next letter).
There are 10 possibilities for the first element in the 5-list, 9 for the next (since we already used the first letter, whatever it was), 8 for the next, 7 for the next, and 6 for the last. So there are 10*9*8*7*6=30240 such strings.
RELATED QUESTIONS
How many five-letter permutations can be formed from the first ten letters of the... (answered by valentity)
How many strings of 10 characters, such as
ABCPE1234F
can be made such that the... (answered by mathmate,Edwin McCravy)
How many five letter words can be made from the alphabet if repetition is... (answered by stanbon)
how many five letter arrangments can be made from the letters of the word breakfast
(answered by checkley77)
How many six-letter permutations can be formed from the first nine letters of the... (answered by drk)
How many three-letter permutations can be formed from the first seven letters of the... (answered by solver91311)
How many three-letter permutations can be formed from the first ten letters of the... (answered by stanbon)
How many four-letter permutations can be formed from the first seven letters of the... (answered by ikleyn)
How many three letter codes can be made from the English alphabet? Only capital letters... (answered by josmiceli)