A tennis tournament takes place in a sports club. The rules of this tournament are as follows. The loser of the tennis match is eliminated (there are no draws in tennis). The pair of players for the next match is determined by a coin toss. The first match is judged by an external judge, and every other match must be judged by a member of the club who did not participate in the match and did not judge earlier. Could it be that there is no one to judge the next match?
10 children were each given a bowl with 100 pieces of pasta. However, these children did not want to eat and instead started to play. One of the children started to place one piece of pasta into every other child’s bowl. What is the least amount of transfers needed so that everyone has a different number of pieces of pasta in their bowl?
A pharmacist has three weights, with which he measured out and gave 100 g of iodine to one buyer, 101 g of honey to another, and 102 g of hydrogen peroxide to the third. He always placed the weights on one side of the scales, and the goods on the other. Could it be that each weight used is lighter than 90 grams?
Once upon a time there were twenty spies. Each of them wrote an accusation against ten of his colleagues. Prove that at least ten pairs of spies have told on each other.
Solve the equation \(f (f (x)) = f (x)\) if \(f(x) = \sqrt[5]{3 - x^3 - x}\).
George drew an empty table of size \(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 the sum of the numbers written at the start of the corresponding row and column (“addition table”). What is the largest number of sums in this table that could be rational numbers?
Fred chose 2017 (not necessarily different) natural numbers \(a_1, a_2, \dots , a_{2017}\) and plays by himself in the following game. Initially, he has an unlimited supply of stones and 2017 large empty boxes. In one move Fred adds a1 stones to any box (at his choice), in any of the remaining boxes (of his choice) – \(a_2\) stones, ..., finally, in the remaining box – \(a_{2017}\) stones. His purpose is to ensure that eventually all the boxes have an equal number of stones. Could he have chosen the numbers so that the goal could be achieved in 43 moves, but is impossible for a smaller non-zero number of moves?
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?
There is an elastic band and glass beads: four identical red ones, two identical blue ones and two identical green ones. It is necessary to string all eight beads on the elastic band in order to get a bracelet. How many different bracelets can be made so that beads of the same colour are not next to each other? (Assume that there is no buckle, and the knot on the elastic is invisible).
To test a new program, a computer selects a random real number \(A\) from the interval \([1, 2]\) and makes the program solve the equation \(3x + A = 0\). Find the probability that the root of this equation is less than \(0.4\).