The answer is c: y = 10.29(0.7)^x.
A. 2(2) = 4
B. 2(1)= 1+1
C. 2+ 67 = 1+ 68
A thumb-wrestling match requires two thumbs, so we can either suppose that we need at least two people
![(n\ge2)](https://tex.z-dn.net/?f=%28n%5Cge2%29)
, or allow one to thumb-wrestle one's self. In either case, we'd have
![t(1)=t(2)=1](https://tex.z-dn.net/?f=t%281%29%3Dt%282%29%3D1)
, so let's just say we need a minimum of two players.
If we add one more person to the set of players, then the first two people would need to play 1 additional match each. So
![t(3)=t(2)+2](https://tex.z-dn.net/?f=t%283%29%3Dt%282%29%2B2)
.
If we add one more person, then the first three people would again each have to play 1 more match with the new person. So
![t(4)=t(3)+3](https://tex.z-dn.net/?f=t%284%29%3Dt%283%29%2B3)
.
And so on, so that in general, the number of games needed for everyone to play exactly one match with everyone else is given recursively by
Answer:
C
Step-by-step explanation:
Let's see if this makes sense and applies to all of the pairs.
1. y will be 2
x will be 6
2=1/3(6)
1/3 times 6 is 2.
2. y will be 1
x will be 3
1=1/3(3)
1/3 times 3 is 1.
3. y will be 0
x will be 0
0=1/3(0)
1/3 times 0 is 0.
4. y will be -1
x will be -3
-1=1/3(-3)
1/3 times -3 is -1.
They all apply to C meaning that C is the right answer.