With a non-zero number, the following operations are allowed: \(x \rightarrow \frac{1+x}{x}\), \(x \rightarrow \frac{1-x}{x}\). Is it true that from every non-zero rational number one can obtain each rational number with the help of a finite number of such operations?
We are given a table of size \(n \times n\). \(n-1\) of the cells in the table contain the number \(1\). The remainder contain the number \(0\). We are allowed to carry out the following operation on the table:
1. Pick a cell.
2. Subtract 1 from the number in that cell.
3. Add 1 to every other cell in the same row or column as the chosen cell.
Is it possible, using only this operation, to create a table in which all the cells contain the same number?
A castle is surrounded by a circular wall with nine towers, at which there are knights on duty. At the end of each hour, they all move to the neighbouring towers, each knight moving either clockwise or counter-clockwise. During the night, each knight stands for some time at each tower. It is known that there was an hour when at least two knights were on duty at each tower, and there was an hour when there was precisely one knight on duty on each of exactly five towers. Prove that there was an hour when there were no knights on duty on one of the towers.
The number \(A\) is divisible by \(1, 2, 3, \dots , 9\). Prove that if \(2A\) is presented in the form of a sum of some natural numbers smaller than 10, \(2A= a_1 +a_2 +\dots +a_k\), then we can always choose some of the numbers \(a_1, a_2, \dots , a_k\) so that the sum of the chosen numbers is equal to \(A\).