Math Olympiad, I.S.I. Entrance and College Mathematics › Forums › Math Olympiad, I.S.I., C.M.I. Entrance › Combinatorics › Combinatorics problem
- December 24, 2018 at 1:16 pm #25058swastik pramanikParticipant
In a tournament, there are \(2n\) people, each of whom competes in \(m\) 1 vs 1 rounds. In terms of \(n\) and \(m\) , determine the maximum number of people who can win more than half of the rounds they compete in.
You must be logged in to reply to this topic.