Problems

Age
Difficulty
Found: 2632

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.

We call a number \(x\) rational if it can be represented as \(x=\frac{p}{q}\) for coprime integers \(p\) and \(q\). Otherwise we call the number irrational.
Non-zero numbers \(a\) and \(b\) satisfy the equality \(a^2b^2 (a^2b^2 + 4) = 2(a^6 + b^6)\). Prove that at least one of them is irrational.

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.