Problem:
A group of 100 people is formed to patrol the local streets. Every evening 3 people are on duty. Prove that you cannot arrange for every pair to meet just once on duty.
Solution
Solution:
Every time a person is on duty he is paired with two other people, so if the arrangement were possible the number of pairs involving a particular person would have to be even. But it is .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.