The letters in the word "potato" can be arranged in how many different ways?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
oh , that's letter 't' that appeared twice
I did it in the same way.
It's the simplest way to solve this problem
We have six places, one for each letter. In the first, we can put 6 different letters, in the next we can only put 6 − 1 = 5 letters, in the next one, 6 − 2 = 4 letters and so on. Hence, we can arrange the letters in 6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 = 6 ! = 7 2 0 ways.
But, we have 2 o's and 2 t's. So, all the possible words will be duplicated because of the 2 ! = 2 o's and duplicated again because of the 2 ! = 2 t's.
Thus the solution is the total number of ways we can arrange the letters divided by the number of duplications:
2 ! 2 ! 6 ! = 2 ⋅ 2 7 2 0 = 1 8 0 .
Note that the word Potato has 6 letters, with o and t each appearing twice. Hence the number of ways the letters in the word Potato can be arranged is 2 ! 2 ! 6 ! = 1 8 0 , and we are done. □
⇒ ( n u m b e r o f r e p e a t s ) ! ( t o t a l n u m b e r o f l e t t e r s ) ! ⇒ 2 ! ⋅ 2 ! 6 ! ⇒ 1 8 0
Since only two letters are distinct we have 6 places to put the first letter, and 6-1 =5 places to put the second letter. Now there are four places left and there are two of each letter left. So there are 4 choose 2 places to put the next two letters of the same type and the remaining places are the last two letters of the same type. Therefore the answer is 6 *5 * (4 choose 2).
"Potato" has 6 letters, so these can be arranged in 6 * 5 * 4 * 3 * 2 * 1 = 6! ways.
But in "potato", 't' occurs 2 times, so it can be arranged in 2! ways.
Same for 'o'.
Now calculate the answer as 6!/(2! * 2!) = 720/(2 * 2) = 180
Answer is 6! divided by 2 ! × 2 ! because there is a total of 6 digits in ''potato'' and ''o'' and ''t'' are appearing twice.
Problem Loading...
Note Loading...
Set Loading...
We can arrange the letters in 6 ! = 7 2 0 ways when the letters are distinct. But since letter 't' and letter 'o' appear twice, the number of ways would be 2 ! × 2 ! 6 ! = 4 7 2 0 = 1 8 0 .