Catherine laid out 2016 matches on a table and invited Anna and Natasha to play a game which involves taking turns to remove matches from a table: Anna can take 5 matches or 26 matches in her turn, and Natasha can take either 9 or 23. Without waiting for the start of the game, Catherine left, and when she returned, the game was already over. On the table there are two matches, and the one who can not make another turn loses. After a good reflection, Catherine realised which person went first and who won. Figure it out for yourself now.
At a round table, there are 10 people, each of whom is either a knight who always speaks the truth, or a liar who always lies. Two of them said: “Both my neighbors are liars,” and the remaining eight stated: “Both my neighbors are knights.” How many knights could there be among these 10 people?
There are 23 students in a class. During the year, each student of this class celebrated their birthday once, which was attended by some (at least one, but not all) of their classmates. Could it happen that every two pupils of this class met each other the same number of times at such celebrations? (It is believed that at every party every two guests met, and also the birthday person met all the guests.)
Gary drew an empty table of \(50 \times 50\) and wrote on top of each column and to the left of each row a number. It turned out that all 100 written numbers are different, and 50 of them are rational, and the remaining 50 are irrational. Then, in each cell of the table, he wrote down a product of numbers written at the top of its column and to the left of the row (the “multiplication table”). What is the largest number of products in this table which could be rational numbers?
On the school board a chairman is chosen. There are four candidates: \(A\), \(B\), \(C\) and \(D\). A special procedure is proposed – each member of the council writes down on a special sheet of candidates the order of his preferences. For example, the sequence \(ACDB\) means that the councilor puts \(A\) in the first place, does not object very much to \(C\), and believes that he is better than \(D\), but least of all would like to see \(B\). Being placed in first place gives the candidate 3 points, the second – 2 points, the third – 1 point, and the fourth - 0 points. After collecting all the sheets, the election commission summarizes the points for each candidate. The winner is the one who has the most points.
After the vote, \(C\) (who scored fewer points than everyone) withdrew his candidacy in connection with his transition to another school. They did not vote again, but simply crossed out \(B\) from all the leaflets. In each sheet there are three candidates left. Therefore, first place was worth 2 points, the second – 1 point, and the third – 0 points. The points were summed up anew.
Could it be that the candidate who previously had the most points, after the self-withdrawal of \(B\) received the fewest points?
Four outwardly identical coins weigh 1, 2, 3 and 4 grams respectively.
Is it possible to find out in four weighings on a set of scales without weights, which one weighs how much?
The triangle \(C_1C_2O\) is given. Within it the bisector \(C_2C_3\) is drawn, then in the triangle \(C_2C_3O\) – bisector \(C_3C_4\) and so on. Prove that the sequence of angles \(\gamma_n = C_{n + 1}C_nO\) tends to a limit, and find this limit if \(C_1OC_2 = \alpha\).
There are 13 weights, each weighing an integer number of grams. It is known that any 12 of them can be divided into two cups of weights, six weights on each one, which will come to equilibrium. Prove that all the weights have the same weight.
The judges of an Olympiad decided to denote each participant with a natural number in such a way that it would be possible to unambiguously reconstruct the number of points received by each participant in each task, and that from each two participants the one with the greater number would be the participant which received a higher score. Help the judges solve this problem!
In a vase, there is a bouquet of 7 white and blue lilac branches. It is known that 1) at least one branch is white, 2) out of any two branches, at least one is blue. How many white branches and how many blue are there in the bouquet?