MathDB
Problems
Contests
National and Regional Contests
Indonesia Contests
Indonesia MO Shortlist
2015 Indonesia MO Shortlist
C5
C5
Part of
2015 Indonesia MO Shortlist
Problems
(1)
max number of ways to choose representatives to speak
Source: INAMO Shortlist 2015 C5
5/14/2019
A meeting was attended by
n
n
n
people. They are welcome to occupy the
k
k
k
table provided
(
k
≤
n
2
)
\left( k \le \frac{n}{2} \right)
(
k
≤
2
n
)
. 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
A
A
A
is the number of ways to choose representatives to speak. Determine the maximum value of
A
A
A
that is possible.
combinatorics
max