Skip to main content
OlympiadHQ

Browse · MathNet

Print

Selection tests for the International Mathematical Olympiad 2013

Saudi Arabia 2013 counting and probability

Problem

A Saudi company has two offices. One office is located in Riyadh and the other in Jeddah. To insure the connection between the two offices, the company has designated from each office a number of correspondents so that (a) each pair of correspondents from the same office share exactly one common correspondent from the other office. (b) there are at least 10 correspondents from Riyadh. (c) Zayd, one of the correspondents from Jeddah, is in contact with exactly 8 correspondents from Riyadh. What is the minimum number of correspondents from Jeddah who are in contact with the correspondent Amr from Riyadh?
Solution
Assume that we have two correspondents, from Riyadh and from Jeddah, who are not connected to each other. Let be the set of correspondents from Jeddah connected to and the set of correspondents from Riyadh connected to . Define the function in the following way: For each correspondent , since the correspondents and are different, they share a unique correspondent in . Let be this unique correspondent. So is well-defined. Assume that there exist two correspondents such that . This means that the correspondent from Riyadh shares with the correspondent two correspondents from Jeddah. Hence and the map is injective. Consider a correspondent and let be the unique correspondent in that shares with . Then is the unique correspondent in that shares with . Thus and is surjective. This proves that and have the same number of correspondents from the other city. We deduce from this that if the correspondent Amr from Riyadh is not connected to the correspondent Zayd from Jeddah, the correspondent Amr has exactly eight correspondents from Jeddah. Assume now that the correspondent Amr is connected to the correspondent Zayd from Jeddah. Since there are at least ten correspondents in Riyadh and Zayd is connected only with eight, let be two correspondents from Riyadh who are not connected to Zayd. Let be the unique correspondent that Amr and share. Let be the unique correspondent that shares with . Since is not in contact with Zayd, he has eight correspondents from Jeddah. So there exists at least six correspondents in contact with who are not in contact neither with Amr nor with . Let be one of these correspondents. The correspondent from Riyadh has exactly eight correspondents from Jeddah since he is not connected to the correspondent Zayd. The correspondent from Jeddah has exactly eight correspondents from Riyadh since he is not connected to the correspondent from Riyadh. The correspondent Amr from Riyadh has exactly eight correspondents from Jeddah since he is not connected to the correspondent from Jeddah. This proves that in all cases the correspondent Amr from Riyadh has exactly eight correspondents from Jeddah.
Final answer
8

Techniques

Graph TheoryRecursion, bijectionPigeonhole principle