Answer:
<h2>
16,800 number of ways</h2>
Step-by-step explanation:
Let the ten friends represents the 10 letters ABCDEFGHIJ. If they must be divided into three teams with three people in each team and one field judge, the arrangement will become (ABC)(DEF)(GHI)J
This shows that ABC, DEF and GHI are the three teams and J is the chief judge. Since each groups are now a team, we can represent everyone in each teams with the same letter except the judge as shown;
(AAA)(BBB)(CCC)J where J is the judge
Since there are 10 friends in all and there are A, B and C are repeated three times, the arrangement can be done in the following way as shown;
This shows that they can do it 16,800 number of ways
Answer:
not a function
Step-by-step explanation:
This will not pass the vertical line test, so it is not a function
Answer:
so yo answer is 16
Step-by-step explanation:
2^9/2^5
512/32
16
Answer:
7th term = 12 + 4x6 =12 +24 =36
9514 1404 393
Answer:
(4) 750 < p < 1500
Step-by-step explanation:
The total cost for p people is ...
c = 750 +2.25p
The average cost per person is this total divided by the number of people:
c/p = (750 +2.25p)/p
c/p = (750/p) +2.25
Natasha wants this to be between 2.75 and 3.25:
2.75 < c/2 < 3.25
2.75 < 750/p +2.25 < 3.25 . . . . . . use the expression for c/p
0.50 < 750/p < 1.00 . . . . . . . . . . . subtract 2.25
We can split this to two inequalities to find the limits of p.
<u>Left one</u>
0.50 < 750/p
0.50p < 750 . . .multiply by p
p < 1500 . . . . . . multiply by 2
<u>Right one</u>
750/p < 1
750 < p . . . . . . multiply by p
These bounds on p can be summarized as ...
750 < p < 1500 . . . . matches choice (4)
_____
<em>Additional comment</em>
Once you realize that the fixed costs will be divided by the number of people attending, the maximum cost you want ($1 more than the per-person charge) will set the minimum number of people. To have the $750 fixed cost contribute only $1 to the cost per person, there must be at least 750 people to share that cost. The only answer choice with a 750 person minimum is (4).
