Answer:
The number of distinguishable arrangements are 1,663,200.
Step-by-step explanation:
The word is: CONNECTICUT
The number of ways to arrange a word when no conditions are applied is:
Here <em>k</em> is the number of times a word is repeated.
In the word CONNECTICUT there are:
3 Cs
2 Ns
2 Ts
And there are a total of <em>n</em> = 11 letters
So, the number of distinguishable arrangements are:
Thus, the number of distinguishable arrangements are 1,663,200.
Check the picture below.
make sure your calculator is in Degree mode.
2k^2×(k+7)×(k-5)
that ur answer
Expanding (2x² + y²)⁴ with Pascal triangle or using binomial theorem gives:
(2x² + y²)⁴ = 16x⁸ + 32x⁶y² + 24x⁴y⁴ + 8x²y⁶ + y⁸