SOLUTION: In a​ round-robin chess​ tournament, each player is paired with every other player once. The​ function, shown​ below, models the number of chess​ game

Algebra ->  Exponential-and-logarithmic-functions -> SOLUTION: In a​ round-robin chess​ tournament, each player is paired with every other player once. The​ function, shown​ below, models the number of chess​ game      Log On


   



Question 1088510: In a​ round-robin chess​ tournament, each player is paired with every other player once. The​ function, shown​ below, models the number of chess​ games, N, that must be played in a​ round-robin tournament with x chess players. In a​ round-robin chess tournament with 10 ​players, a total of 45 games were played. Use this information to identify a point on the graph.(Type an ordered​ pair.)
Answer by ikleyn(52803) About Me  (Show Source):
You can put this solution on YOUR website!
.
In a​ round-robin chess​ tournament, each player is paired with every other player once.
The​ function, shown​ below, models the number of chess​ games, N, that must be played in a​
round-robin tournament with x chess players. In a​ round-robin chess tournament with 10 ​players, a total of 45 games
were played. Use this information to identify a point on the graph.(Type an ordered​ pair.)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Read your post.

Do you see the function shown below ?


Also, do you see the graph ??

For what reason did you post this ???


My advise to you: Read and think on what you are posting.