A broken calculator carries out only one operation “asterisk”: \(a*b = 1 - a/b\). Prove that using this calculator it is possible to carry out all four arithmetic operations (addition, subtraction, multiplication, division).
Each of the three axes has one rotating pin and a fixed arrow. The gears are connected in series. On the first gear there are 33 teeth, on the second – 10, on the third – 7. On each tooth of the first gear one symbol or letter of the following string of letters and symbols is written in the clockwise direction in the following order:
A B V C D E F G H I J K L M N O P Q R S T U W X Y Z ! ? \(>\) \(<\) $ £ €
On the teeth of the second and third gears in increasing order the numbers 0 to 9 and 0 to 6 are written respectively in a clockwise direction. When the arrow of the first axis points to a letter, the arrows of the other two axes point to numbers.
The letters and symbols of the message are encrypted in sequence. Encryption is performed by rotating the first gear anti-clockwise until the first possible letter or symbol that can be encrypted is landed on by the arrow. At this point, the numbers indicated by the second and third arrows are consistently written out. At the beginning of the encryption, the 1st wheel points to the letter A, and the arrows of the 2nd and 3rd wheels to the number 0.
Encrypt the Slavic name OLIMPIADA.
A message is encrypted using numbers where each number corresponds to a different letter of the alphabet. Decipher the following encoded text:
1317247191772413816720713813920257178
Prove that the following inequalities hold for the Brockard angle \(\varphi\):
a) \(\varphi ^{3} \le (\alpha - \varphi) (\beta - \varphi) (\gamma - \varphi)\) ;
b) \(8 \varphi^{3} \le \alpha \beta \gamma\) (the Jiff inequality).
A rectangular table is given, in each cell of which a real number is written, and in each row of the table the numbers are arranged in ascending order. Prove that if you arrange the numbers in each column of the table in ascending order, then in the rows of the resulting table, the numbers will still be in ascending order.
Each side in the triangle \(ABC\) is divided into 8 equal segments. How many different triangles exist with the vertices at the points of division (the points \(A\), \(B\), \(C\) cannot be the vertices of triangles) in which neither side is parallel to either side of the triangle \(ABC\)?
How many integers are there from 1 to 1,000,000, which are neither full squares, nor full cubes, nor numbers to the fourth power?
Tickets cost 50 cents, and \(2n\) buyers stand in line at a cash register. Half of them have one dollar, the rest – 50 cents. The cashier starts selling tickets without having any money. How many different orders of people can there be in the queue, such that the cashier can always give change?
Prove that the Catalan numbers satisfy the recurrence relationship \(C_n = C_0C_{n-1} + C_1C_{n-2} + \dots + C_{n-1}C_0\). The definition of the Catalan numbers \(C_n\) is given in the handbook.
Prove that there are infinitely many composite numbers among the numbers \(\lfloor 2^k \sqrt{2}\rfloor\) (\(k = 0, 1, \dots\)).