SOLUTION: Using permutations, how do we solve this problem: How many distinguishable 6 letter "words" can be formed using the letters in LONDON? the answer is 180, but I can't figure out how
Algebra ->
Permutations
-> SOLUTION: Using permutations, how do we solve this problem: How many distinguishable 6 letter "words" can be formed using the letters in LONDON? the answer is 180, but I can't figure out how
Log On
Question 366458: Using permutations, how do we solve this problem: How many distinguishable 6 letter "words" can be formed using the letters in LONDON? the answer is 180, but I can't figure out how to solve it. Please help. Answer by robertb(5830) (Show Source):
You can put this solution on YOUR website! There are 2 o's, 2 n's, 1 l, and 1 d in the word "london". Then from a formula from combinatorics , there are ways.
