Each one of 2006 students makes a list with 12 schools among 2006. If we take any 6 students, there are two schools which at least one of them is included in each of 6 lists. A list which includes at least one school from all lists is a good list. a) Prove that we can always find a good list with 12 elements, whatever the lists are; b) Prove that students can make lists such that no shorter list is good.
Problem
Source: Turkey, TST D2, P3
Tags: combinatorics proposed, combinatorics
10.05.2006 21:30
i think this is a very hard problem.İ had tried the problem in exam for three and a half hour, but i didn't solved this.
19.07.2006 01:25
I do not really understand the wording:"If we take any 6 students, there are two schools which at least one of them is included in each of 6 lists." Does that mean if we take any six lists, we can find 2 schools such that at least one of them is included in each list???
07.05.2009 13:17
this problem is the same as the 9th problem in 2007 Baltic Way essentially so that solution is enable to this problem the problem and solution of 2007 Baltic Way: http://www.bw07.dk/data/ekstra/bw07_english.pdf and http://www.bw07.dk/data/ekstra/bw07_solutions.pdf
07.05.2009 15:05
I think there is something wrong with this problem; it must have been 2006000 students instead of 2006, as far as i can remember.
08.05.2009 15:55
after reading the solution you will learn that it doesn't matter whether the number is 2006 or 2006000
21.06.2009 13:31
Actually, if you do read the question again, you can recognize that there is a (b) part of the original problem. (It seems like Baltic Way has only copied the first part of the problem) Moreover, in this part 2006000 makes sense. So, I am requesting from the admins to fix this mistake.
28.09.2019 05:51