CombinatoricsDifficulty 5.7AIME, harderProve itSoviet Union
Problem:
a. A committee has met 40 times, with 10 members at every meeting. No two people have met more than once at committee meetings. Prove that there are more than 60 people on the committee.
b. Prove that you cannot make more than 30 subcommittees of 5 members from a committee of 25 members with no two subcommittees having more than one common member.
Solution
Solution:
a. Each meeting involves 210⋅9=45 pairs. So after 40 meetings, there have been 40×45=1800 pairs. We are told that these are all distinct. But if there are N people on the committee, then there are only 2N(N−1) pairs available. For N=60, this is only 260⋅59=1770. Therefore, N>60.
b. A subcommittee of 5 has 25⋅4=10 pairs. So 31 subcommittees have 31×10=310 pairs, and these are all distinct, since no two people are on more than one subcommittee. But a committee of 25 only has 225⋅24=300 pairs available. Therefore, you cannot make more than 30 such subcommittees.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.