Problems

For which \(\alpha\) does there exist a function \(f\colon \mathbb{R} \rightarrow \mathbb{R}\) that is not a constant, such that \(f (\alpha (x + y)) = f (x) + f (y)\)?

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?

On a function \(f (x)\) defined on the whole line of real numbers, it is known that for any \(a > 1\) the function \(f (x)\) + \(f (ax)\) is continuous on the whole line. Prove that \(f (x)\) is also continuous on the whole line.

Does there exist a function \(f (x)\) defined for all \(x \in \mathbb{R}\) and for all \(x, y \in \mathbb{R}\) satisfying the inequality \(| f (x + y) + \sin x + \sin y | < 2\)?

Prove that in any set of 117 unique three-digit numbers it is possible to pick 4 non-overlapping subsets, so that the sum of the numbers in each subset is the same.

A target consists of a triangle divided by three families of parallel lines into 100 equilateral unit triangles. A sniper shoots at the target. He aims at a particular equilateral triangle and either hits it or hits one of the adjacent triangles that share a side with the one he was aiming for. He can see the results of his shots and can choose when to stop shooting. What is the largest number of triangles that the sniper can guarantee he can hit exactly 5 times?

The real numbers \(x\) and \(y\) are such that for any distinct prime odd \(p\) and \(q\) the number \(x^p + y^q\) is rational. Prove that \(x\) and \(y\) are rational numbers.

Is it possible to arrange the numbers 1, 2, ..., 60 in a circle in such an order that the sum of every two numbers, between which lies one number, is divisible by 2, the sum of every two numbers between which lie two numbers, is divisible by 3, the sum of every two numbers between which lie six numbers, is divisible by 7?

The functions \(f (x) - x\) and \(f (x^2) - x^6\) are defined for all positive \(x\) and increase. Prove that the function

also increases for all positive \(x\).

A set of weights has the following properties: It contains \(5\) weights, which are all different in weight. For any two weights, there are two other weights of the same total weight. What is the smallest number of weights that can be in this set?