MathDB

In a football tournament there are n teams, with

{n \ge 4}

, and each pair of teams meets exactly once. Suppose that, at the end of the tournament, the final scores form an arithmetic sequence where each team scores

{1}

more point than the following team on the scoreboard. Determine the maximum possible score of the lowest scoring team, assuming usual scoring for football games (where the winner of a game gets

{3}

points, the loser

{0}

points, and if there is a tie both teams get

{1}

point).

Problem Statement