There are scales and 100 coins, among which several (more than 0 but less than 99) are fake. All of the counterfeit coins weigh the same and all of the real ones also weigh the same, while the counterfeit coin is lighter than the real one. You can do weighings on the scales by paying with one of the coins (whether real or fake) before weighing. Prove that it is possible with a guarantee to find a real coin.
Author: I.S. Rubanov
On the table, there are 7 cards with numbers from 0 to 6. Two take turns in taking one card. The winner is the one is the first person who can, from his cards, make up a natural number that is divisible by 17. Who will win in a regular game the person who goes first or second?
Author: Shapovalov A.V.
Let \(A\) and \(B\) be two rectangles. From rectangles equal to \(A\), a rectangle similar to \(B\) was created.
Prove that from rectangles equal to \(B\), you can create a rectangle similar to \(A\).
At a contest named “Ah well, monsters!”, 15 dragons stand in a row. Between neighbouring dragons the number of heads differs by 1. If the dragon has more heads than both of his two neighbors, he is considered cunning, if he has less than both of his neighbors – strong, the rest (including those standing at the edges) are considered ordinary. In the row there are exactly four cunning dragons – with 4, 6, 7 and 7 heads and exactly three strong ones – with 3, 3 and 6 heads. The first and last dragons have the same number of heads.
a) Give an example of how this could occur.
b) Prove that the number of heads of the first dragon in all potential examples is the same.
Author: A. Glazyrin
In the coordinate space, all planes with the equations \(x \pm y \pm z = n\) (for all integers \(n\)) were carried out. They divided the space into tetrahedra and octahedra. Suppose that the point \((x_0, y_0, z_0)\) with rational coordinates does not lie in any plane. Prove that there is a positive integer \(k\) such that the point \((kx_0, ky_0, kz_0)\) lies strictly inside some octahedron from the partition.
Authors: B. Vysokanov, N. Medved, V. Bragin
The teacher grades tests on a scale from 0 to 100. The school can change the upper bound of the scale to any other natural number, recalculating the estimates proportionally and rounding up to integers. A non-integer number, when rounded, changes to the nearest integer; if the fractional part is equal to 0.5, the direction of rounding can be either up or down and it can be different for each question. (For example, an estimate of 37 on a scale of 100 after recalculation in the scale of 40 will go to \(37 \cdot 40/100 = 14.8\) and will be rounded to 15).
The students of Peter and Valerie got marks, which are not 0 and 100. Prove that the school can do several conversions so that Peter’s mark becomes b and Valerie’s mark becomes a (both marks are recalculated simultaneously).
Author: A.A. Egorov
Calculate the square root of the number \(0.111 \dots 111\) (100 ones) to within a) 100; b) 101; c)* 200 decimal places.
Two people play a game with the following rules: one of them guesses a set of integers \((x_1, x_2, \dots , x_n)\) which are single-valued digits and can be either positive or negative. The second person is allowed to ask what is the sum \(a_1x_1 + \dots + a_nx_n\), where \((a_1, \dots ,a_n)\) is any set. What is the smallest number of questions for which the guesser recognizes the intended set?
Airlines connect pairs of cities. How can you connect 50 cities with the fewest number of airlines so that from every city you can get to any other city by taking at most two flights?
Two lines on the plane intersect at an angle \(\alpha\). On one of them there is a flea. Every second it jumps from one line to the other (the point of intersection is considered to belong to both straight lines). It is known that the length of each of her jumps is 1 and that she never returns to the place where she was a second ago. After some time, the flea returned to its original point. Prove that for the angle \(\alpha\) the value \(\alpha/\pi\) is a rational number.