Answer:
252
Step-by-step explanation:
The question is fully equivalent to asking how many subsets of length 5 there are of 10 objects (digits 0–9). That number is 10C5, where nCk is the number of ways to choose k objects from a list of 10. The value of that is ...
nCk = n!/(k!(n-k)!)
There are 252 ways to choose 5 numbers from the digits 0-9:
10C5 = 10!/(5!(10-5)!) = 10·9·8·7·6/(5·4·3·2·1) = 9·4·7 = 252
_____
The order of the selection doesn't matter, because the selected digits are always arranged in decreasing order to form a decreasing number.
1,132 people came to watch the balloon festival.
IT WOULD BE "D" I BELIEVE
HOPE IM RIGHT AND THIS HELPS
Answer:

General Formulas and Concepts:
<u>Calculus</u>
Antiderivatives - Integrals
Integration Constant C
Integration Property [Multiplied Constant]: 
Trig Integration: 
U-Substitution
Step-by-step explanation:
<u>Step 1: Define</u>

<u>Step 2: Identify Substitution Variables</u>
u = 3x
du = 3dx
<u>Step 3: Integrate</u>
- [Integral] Rewrite:

- [Integral] U-Substitution:

- [Integral] Trig Integration:
![\displaystyle \frac{1}{3}[-cos(u)] + C](https://tex.z-dn.net/?f=%5Cdisplaystyle%20%5Cfrac%7B1%7D%7B3%7D%5B-cos%28u%29%5D%20%2B%20C)
- [Expression] Multiply:

- [Expression] Back-Substitute:

X = 14
Add them all together and set them equal to 180 then solve for x