Browse · MathNet
Print16th Junior Turkish Mathematical Olympiad
Turkey counting and probability
Problem
Each student in the class has chosen one mathematics and one physics problem out of mathematics and physics problems such that different students choose different pairs of problems. Given that for each student, at least one of the problems chosen by him is chosen by at most one more student, determine the maximum possible number of students in the class.
Solution
For and we define as follows; if the -th mathematics problem and -th physics problem are chosen by some student, otherwise. Now we can reformulate the problem: Find the maximal possible value of the expression if for some and , then at least one of the sums and does not exceed .
First of all, let us show that . Suppose that . We say that is 1-good*, if If the total number of 1-good values of is , then . If the total number of 2-good values of is , then . If the total number of 1-good values of is , then . If the total number of 2-good values of is , then . Finally, if the total number of 1-good values of is less than or equal to and the total number of 2-good values of is less than or equal to , then the total number of good values is at most and readily , since the number of nonzero terms of is less than or equal to twice the number of good values. Thus, .
Now we give an example for . Let only for The conditions are readily satisfied and we are done.
First of all, let us show that . Suppose that . We say that is 1-good*, if If the total number of 1-good values of is , then . If the total number of 2-good values of is , then . If the total number of 1-good values of is , then . If the total number of 2-good values of is , then . Finally, if the total number of 1-good values of is less than or equal to and the total number of 2-good values of is less than or equal to , then the total number of good values is at most and readily , since the number of nonzero terms of is less than or equal to twice the number of good values. Thus, .
Now we give an example for . Let only for The conditions are readily satisfied and we are done.
Final answer
54
Techniques
Counting two waysColoring schemes, extremal arguments