An NFL coach sometimes uses a defense that utilizes 3 defensive linemen, 4 linebackers, and 4 defensive backs. His roster (the p
1 answer:
Answer:
68,600
Step-by-step explanation:
The order of the players is not important. For example, a defensive line of Shaq Lawson, Ed Oliver and Jerry Hughes is the same as a defensive line of Ed Oliver, Shaq Lawson and Jerry Hughes. So we use the combinations formula to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
Defensive Lineman:
3 from a set of 8. So
56 combinations of defensive lineman
Linebackers:
4 from a set of 7. So
35 combinations of linebackers
Defensive backs:
4 from a set of 7. So
35 combinations of defensive backs
How many different ways can the coach pick the 11 players to implement this particular defense?
56*35*35 = 68,600
68,600 different ways can the coach pick the 11 players to implement this particular defense
You might be interested in
The correct answer is C) t₁ = 375, 
.
From the general form,
, we must work backward to find t₁.
The general form is derived from the explicit form, which is
. We can see that r = 5; 5 has the exponent, so that is what is multiplied by every time. This gives us
Using the products of exponents, we can "split up" the exponent:
We know that 5⁻¹ = 1/5, so this gives us
Comparing this to our general form, we see that
Multiplying by 5 on both sides, we get that
t₁ = 75*5 = 375
The recursive formula for a geometric sequence is given by
, while we must state what t₁ is; this gives us
From the general form,
The general form is derived from the explicit form, which is
Using the products of exponents, we can "split up" the exponent:
We know that 5⁻¹ = 1/5, so this gives us
Comparing this to our general form, we see that
Multiplying by 5 on both sides, we get that
t₁ = 75*5 = 375
The recursive formula for a geometric sequence is given by