Question

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?

Answer 1

when 7 players 21 games should be played.. according to the sequence

Answer 2

B) an = an-1 + n - 1