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.

What would the new explicit rule be, if each player played every other player twice? (Hint: Make a table first.)

an = n2 - n
an = n2+ n
an = 2(n2+ n)
an = 2(n2- n)

Which of the following is a recursive rule for the original sequence?

an = n2+ n
an = an-1 + n
an = an-1 + n - 1
an = an-1 + n + 1

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.

What would the new explicit rule be, if each player played every other player twice? (Hint: Make a table first.)

an = n2 - n
an = n2+ n
an = 2(n2+ n)
an = 2(n2- n)

Which of the following is a recursive rule for the original sequence?

an = n2+ n
an = an-1 + n
an = an-1 + n - 1
an = an-1 + n + 1