![C(n,n)=\dfrac{n!}{n!(n-n)!}=\dfrac1{0!}=\dfrac11=1](https://tex.z-dn.net/?f=C%28n%2Cn%29%3D%5Cdfrac%7Bn%21%7D%7Bn%21%28n-n%29%21%7D%3D%5Cdfrac1%7B0%21%7D%3D%5Cdfrac11%3D1)
In other words, how many ways are there to choose
![n](https://tex.z-dn.net/?f=n)
objects from a total of
![n](https://tex.z-dn.net/?f=n)
objects? Just one; take all of them at the same time.
Answer:
15 routes
Step-by-step explanation:
3 x 5 = 15 routes
Answer:
16/100 = 4/25
Step-by-step explanation:
4/10 * 4/10 = 16/100
Answer:
13.52 ounces of water
Step-by-step explanation:
80% equals 8/10
So we multiply 16.9x8/10 getting 13.52 ounces
The third one is the correct answer