Browse · MathNet
PrintSAUDI ARABIAN MATHEMATICAL COMPETITIONS
Saudi Arabia counting and probability
Problem
Let 300 students participate to the Olympiad. Between each 3 participants there is a pair that are not friends. Hamza enumerates participants in some order and denotes by the number of friends of -th participant. It occurs that Find the biggest possible value for .
Solution
Firstly, we shall prove that if are friend then the sum of friends of each one does not exceed . Indeed, Suppose that has friends and has friends. Note that and cannot have any common friend; otherwise, take as a friend of and then the triple () does not satisfy the given condition. Thus Suppose that and take some student who has friends. Take who has at least friends, then as the remark above, and are not friends. Note that we always can find distinct students and each of them has exactly friends, and they are not friends of . So the number of friends of is less than , contradiction. Therefore, .
We can give an example as follows. Divide students into groups and .
- Student is friends with all students in . - Student is friends with all students from to . - ... - Student is friends with students from to . - Students in the same group are not friends.
So it is easy to check that there are no any triplet of students that are friends with each other. And the number of friends of students in is and the number of friends of students in is .
We can give an example as follows. Divide students into groups and .
- Student is friends with all students in . - Student is friends with all students from to . - ... - Student is friends with students from to . - Students in the same group are not friends.
So it is easy to check that there are no any triplet of students that are friends with each other. And the number of friends of students in is and the number of friends of students in is .
Final answer
200
Techniques
Turán's theoremColoring schemes, extremal arguments