Me solve this word problem:
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, 55 games were played. how many players entered the tournament?

n=t^2-t divided by 2.