We solve problems

Problem #PRU-109881

Problems Calculus Real numbers Integer and fractional parts. Archimedean property Methods Pigeonhole principle Pigeonhole principle (angles and lengths)

13–15 3.0

The polynomial \(P (x)\) of degree \(n\) has \(n\) distinct real roots.

What is the largest number of its coefficients that can be equal to zero?

Problem #PRU-109909

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

10–12 2.0

Members of the State parliament formed factions in such a way that for any two factions \(A\) and \(B\) (not necessarily different)

– also a faction (through

the set of all parliament members not included in \(C\) is denoted). Prove that for any two factions \(A\) and \(B\), \(A \cup % \includegraphics{https://problems-static.s3.amazonaws.com/production/task_images/700/109909-3.png} B\) is also a faction.

Problem #PRU-109912

Problems Calculus Functions of one variable. Continuity Certain properties of a function and recurrence relations. Methods Methods for solving problems with parameter

15–16 4.0

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)\)?

Problem #PRU-109937

Problems Methods Invariants and semi-invariants Invariants Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Algebraic methods Processes and operations Proof by exhaustion

14–16 4.0

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?

Problem #PRU-109946

Problems Algebra Algebraic equations and systems of equations Algebraic equations and systems of equations (other) Calculus Real numbers Integer and fractional parts. Archimedean property Polynomials Quadratic polynomials Investigating the quadratic polynomial

14–15 3.0

Solve the equation \((x + 1)^3 = x^3\).

Problem #PRU-109997

Problems Calculus Functions of one variable. Continuity Certain properties of a function and recurrence relations. Continuous functions (general properties)

15–16 4.0

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.

Problem #PRU-110035

Problems Calculus Functions of one variable. Continuity Certain properties of a function and recurrence relations. Algebra Absolute value Inequalities containing absolute values Trigonometry Trigonometrical inequalities

15–16 4.0

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\)?

Problem #PRU-110047

Problems Algebra and arithmetic Rational and irrational numbers

13–15 3.0

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.

Problem #PRU-110061

Problems Methods Pigeonhole principle Pigeonhole principle (other)

13–16 4.0

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.

Problem #PRU-110072

Problems Discrete Mathematics Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Geometry on grid paper Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

12–14 4.0

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?