IMC 2017, Day 1, Problem 4
There are people in a city, and each of them has exactly friends (friendship is always symmetric). Prove that it is possible to select a group of people such that at least persons in have exactly two friends in .
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
(Proposed by Rooholah Majdodin and Fedor Petrov, St. Petersburg State University)
Solution. Let and let . Choose the set randomly such that each people is selected with probability , independently from the others.
The probability that a certain person is selected for and knows exactly two members of is
Choose (this is the value of for which is maximal); then
Hence, , so there is a choice for when .
Transcribed from the official solutions, page 3. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.