MathDB
max number of ways to choose representatives to speak

Source: INAMO Shortlist 2015 C5

May 14, 2019
combinatoricsmax

Problem Statement

A meeting was attended by nn people. They are welcome to occupy the kk table provided (kn2)\left( k \le \frac{n}{2} \right). Each table is occupied by at least two people. When the meeting begins, the moderator selects two people from each table as representatives for talk to. Suppose that AA is the number of ways to choose representatives to speak. Determine the maximum value of AA that is possible.