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?
Aan = an-1 + n + 1
Ban = an-1 + n - 1
Can = an-1 + n
Dan = n2+ n
How many games must be played when 7 players are in the tournament?
table:
2 | 1
3 | 3
4 | 6
5 | 10
Which of the following is a recursive rule for the original sequence?
Aan = an-1 + n + 1
Ban = an-1 + n - 1
Can = an-1 + n
Dan = n2+ n
