If the letters are considered distinct, then the number of permutations is
![6!=720](https://tex.z-dn.net/?f=6%21%3D720)
.
If we count either C as the same character, then we would be double-counting - to correct this, we would simply divided by the number of ways we can choose C from the available characters, or
![\dfrac{6!}{2!}=360](https://tex.z-dn.net/?f=%5Cdfrac%7B6%21%7D%7B2%21%7D%3D360)
.
Answer:
4 units to the right & 1 unit up.
Answer:
1800
Step-by-step explanation:
jdjdvdbdjhdbsndbdbdbd
Answer:
.
Step-by-step explanation:
You can solve the median by putting all the numbers in order. Then cross off one at a time at the start, then cross off the one at the end, then keep going until you get to one.
You can solve the mode by looking for the most frequent number. I remembered that by looking at mode and seeing MO and remembering most often.
I hope this helps :-)