Ronnie is scheduling a chess tournament in which each player plays every other player once. he created a table and found that each new player adds more games to the tournament in an arithmetic sequence. answer this set of project questions regarding the chess games.

table:
# of players | # of games
1 | 0
2 | 1
3 | 3
4 | 6
5 | 10
which of the following is a recursive rule for the original sequence?
a) an = an-1 + n + 1
b) an = an-1 + n - 1
c) an = an-1 + n
d) an = n2+ n

how many games must be played when 7 players are in the tournament?

unless you made a typo, the answers are both a and c.

step-by-step explanation:

1.5/3 is .5 whereas 3/9 is .3333333 not proportional

22/33 is .66666 and 4/6 is also .66666 proportional

2/4 is .5 whereas 142/213 is .66666 not proportional

14/7 is 2 and 7/3.5 is also 2 proportional

you could've also checked it by doing this simple division:

if the larger fraction divides with the smaller fraction to equal 1, it is proportional. so let me show you what i mean:

when i divide 22/33 by 4/6 i get 1, so we know it is proportional, and it is the same with 14/7 and 7/3.5. now if i divide 3/9 by 1.5/3 i get .66666 so therefore we know it is not proportional.

there are many ways to do this so i wanted to show you some possible ways.