We solve problems

Problem #PRU-109808

Problems Discrete Mathematics Combinatorics Geometry on grid paper Integer lattices Integer lattices (other) Painting problems Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

12–14 3.0

All of the points with whole number co-ordinates in a plane are plotted in one of three colours; all three colours are present. Prove that there will always be possible to form a right-angle triangle from these points so that its vertices are of three different colours.

Problem #PRU-109819

Problems Calculus Functions of one variable. Continuity Certain properties of a function and recurrence relations. Monotonicity, boundedness

14–16 4.0

Is there a bounded function \(f\colon \mathbb{R} \rightarrow \mathbb{R}\) such that \(f (1)> 0\) and \(f (x)\) satisfies the inequality \(f^2 (x + y) \geq f^2 (x) + 2f (xy) + f^2 (y)\) for all \(x, y \in \mathbb{R}\)?

Problem #PRU-109834

Problems Methods Colouring Colouring (other) Calculus Real numbers Rational and irrational numbers

14–16 5.0

Ten pairwise distinct non-zero numbers are such that for each two of them either the sum of these numbers or their product is a rational number.

Prove that the squares of all numbers are rational.

Problem #PRU-109877

Problems Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

11–13 3.0

A regular hexagon with sides of length \(5\) is divided by straight lines, that are parallel to its sides, to form regular triangles with sides of length 1. We call the vertices of all such triangles nodes. It is known that more than half of the nodes are marked. Prove that there are five marked nodes lying on one circle.

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-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-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.