How to solve the problem
1 answer:
You might be interested in
<h3>Answer: 680 different combinations</h3>
=======================================================
Explanation:
If order mattered, then we'd have 17*16*15 = 4080 different permutations. Notice how I started with 17 and counted down 1 at a a time until I had 3 slots to fill. We count down by 1 because each time we pick someone, we can't pick them again.
So we have 4080 different ways to pick 3 people if order mattered. But again order doesn't matter. All that counts is the group itself rather than the individual or how they rank. There are 3*2*1 = 6 ways to order any group of three people, which means there are 4080/6 = 680 different combinations possible.
An alternative is to use the nCr formula with n = 17 and r = 3. That formula is
where the exclamation marks indicate factorials
Answer:
Step-by-step explanation:
You have the following differential equation:
(1)
In order to find the solution to the equation, you can use the method of the characteristic polynomial.
The characteristic polynomial of the given differential equation is:
The solution of the differential equation is:
(2)
where m1 and m2 are the roots of the characteristic polynomial.
You replace the values obtained for m1 and m2 in the equation (2). Then, the solution to the differential equation is: