Select Page

# Combinatorics problem

Home Forums Math Olympiad, I.S.I., C.M.I. Entrance Combinatorics Combinatorics problem

Tagged:

Viewing 1 post (of 1 total)
• Author
Posts
• #25058
swastik pramanik
Participant

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.

Viewing 1 post (of 1 total)
• You must be logged in to reply to this topic.