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 t chess players. In a​ round-robin chess​ tournament, 1010 games were played. How many players entered the​ tournament? Upper N equals StartFraction t squared minus t Over 2 EndFraction