There are 4 teams in total and each team has 7 members. One of the team will be the host team.
Tournament committee will be made from 3 members from the host team and 2 members from each of the three remaining teams. Selecting the members for tournament committee is a combinations problem. We have to select 3 members out 7 for host team and 2 members out of 7 from each of the remaining 3 teams.
So total number of possible 9 member tournament committees will be equal to:

This is the case when a host team is fixed. Since any team can be the host team, there are 4 possible ways to select a host team. So the total number of possible 9 member tournament committee will be:

Therefore, there are 2917215 possible 9 member tournament committees
Answer:
<em>After </em><em>47</em><em> days she will have more than 90 trillion pennies.</em>
Step-by-step explanation:
At the beginning there was 1 penny. At the second day the amount of pennies under the pillow became 2.
The amount of pennies doubled each day. So the series is,

This series is in geometric progression.
As the pennies from each of the previous days are not being stored away until more pennies magically appear so the sum of series will be,

where,
a = initial term = 1,
r = common ratio = 2,
As we have find the number of days that would elapse before she has a total of more than 90 trillion, so









Answer: y = 1
there no x, i think you meant y?
Step-by-step explanation:
Step 1: Simplify both sides of the equation.
6=2(y+2)
6=(2)(y)+(2)(2)(Distribute)
6=2y+4
Step 2: Flip the equation.
2y+4=6
Step 3: Subtract 4 from both sides.
2y+4−4=6−4
2y=2
Step 4: Divide both sides by 2.
2y over 2 = 2 over 2
It wouldn't be A or B, but we need to see the other choices
For this case we have that by definition, the Greatest Common Factor or GFC of two or more numbers, is the largest number that divides them without leaving residue.
So:
We look for the factors of 18 and 36:
18: 1,2,3,6,9,18
36: 1, 2,3,4, 6,9,18 ...
Thus, the GFC of both numbers is 18.
Then, the GFC of
and
is:

Answer:
