Maths Olympiad Prep

Library / /42 of 105

Combinatorics Difficulty 4.8 AIME Prove it United States

Problem:

Six children are invited to a birthday party, and each pair of them are either mutual friends or mutual strangers. Prove that there are either three of them that are all friends or three of them that are all strangers to one another.

Solution

Solution:

Begin by letting AA be any person at the party, and note that AA must be either friends or strangers with at least three of the others, for otherwise there would only be at most 2+2=42+2=4 other people at the party. Because of the symmetry between friends and strangers, we can assume that AA has three friends, call them B,CB, C, and DD. Now if any two of these three are friends, then they together with AA are the desired triple. Otherwise, B,CB, C, and DD are all mutual strangers, so they themselves furnish the desired triple.

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.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.