A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 one year ago
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 = an1 + n
an = an1 + n  1
an = an1 + n + 1
anonymous
 one year ago
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 = an1 + n an = an1 + n  1 an = an1 + n + 1

This Question is Closed
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.