A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • 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 = an-1 + n an = an-1 + n - 1 an = an-1 + n + 1

  • This Question is Closed

    Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

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...


  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.