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?
In order to glaze 15 windows of different shapes and sizes, 15 pieces of glass are prepared exactly for the size of the windows (windows are such that each window should have one glass). The glazier, not knowing that the glass is specifically selected for the size of each window, works like this: he approaches a certain window and sorts out the unused glass until he finds one that is large enough (that is, either an exactly suitable piece or one from which the right size can be cut), if there is no such glass, he goes to the next window, and so on, until he has assessed each window. It is impossible to make glass from several parts. What is the maximum number of windows which can be left unglazed?
There were seven boxes. In some of them, seven more boxes were placed inside (not nested in each other), etc. As a result, there are 10 non-empty boxes. How many boxes are there now in total?
Sam and Lena have several chocolates, each weighing not more than 100 grams. No matter how they share these chocolates, one of them will have a total weight of chocolate that does not exceed 100 grams. What is the maximum total weight of all of the chocolates?
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.
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?
100 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 her pasta into other children’s bowls (to whomever she wants). What is the least amount of transfers needed so that everyone has a different number of pieces of pasta in their bowl?
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\).