Combinatorics problem Math Olympiad, I.S.I. Entrance and College Mathematics › Forums › Math Olympiad, I.S.I., C.M.I. Entrance › Combinatorics › Combinatorics problem Tagged: Combinatorics This topic contains 0 replies, has 1 voice, and was last updated by swastik pramanik 3 months ago. Viewing 1 post (of 1 total) Author Posts December 24, 2018 at 1:16 pm #25058 swastik 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. Author Posts Viewing 1 post (of 1 total) You must be logged in to reply to this topic.