Subcontests
(6)Guessing game with all but one of the numbers equal
A mysterious machine contains a secret combination of 2016 integer numbers x1,x2,…,x2016. It is known that all the numbers in the combination are equal but one. One may ask questions to the machine by giving to it a sequence of 2016 integer numbers y1,…,y2016, and the machine answers by telling the value of the sum
x1y1+⋯+x2016y2016.
After answering the first question, the machine accepts a second question and then a third one, and so on.Determine how many questions are necessary to determine the combination:
(a) knowing that the number which is different from the others is equal to zero;
(b) not knowing what the number different from the others is. Sequence of rational numbers
Let x0,x1,x2,… be a sequence of rational numbers defined recursively as follows: x0 can be any rational number and, for n≥0,
xn+1={2xn−1xn1−1if the numerator of xn is even,if the numerator of xn is odd,
where by numerator of a rational number we mean the numerator of the fraction in its lowest terms. Prove that for any value of x0:
(a) the sequence contains only finitely many distinct terms;
(b) the sequence contains exactly one of the numbers 0 and 2/3 (namely, either there exists an index k such that xk=0, or there exists an index m such that xm=2/3, but not both). Almost completely different scores on IMO day 1
A mathematical contest had 3 problems, each of which was given a score between 0 and 7 (0 and 7 included). It is known that, for any two contestants, there exists at most one problem in which they have obtained the same score (for example, there are no two contestants whose ordered scores are 7,1,2 and 7,1,5, but there might be two contestants whose ordered scores are 7,1,2 and 7,2,1). Find the maximum number of contestants.