SOLUTION: how many permutations can be formed from five types of trees each of which is composed of two trees? without repeating
Algebra.Com
Question 796324: how many permutations can be formed from five types of trees each of which is composed of two trees? without repeating
Answer by Alan3354(69443) (Show Source): You can put this solution on YOUR website!
how many permutations can be formed from five types of trees each of which is composed of two trees?
5*5 = 25
-------------
without repeating
5*4 = 20
RELATED QUESTIONS
How many five-letter permutations can be formed from the first ten letters of the... (answered by valentity)
How can I solve this?
Year- 1988- 582 trees ,1989- 620 trees, 1990- 658 trees,... (answered by Theo)
The contractor wants to plant six oak trees, nine maple trees, and five poplar trees... (answered by Edwin McCravy)
How many six-letter permutations can be formed from the first nine letters of the... (answered by drk)
How many permutations can be formed from the letters of the word... (answered by Edwin McCravy)
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 distinct permutations can be formed from all the letters of the word SUCCESS
(answered by Edwin McCravy)
How many four-letter permutations can be formed from the first seven letters of the... (answered by ikleyn)