Problems

Age
Difficulty
Found: 845

Is it possible for

a) the sum of two rational numbers irrational?

b) the sum of two irrational numbers rational?

c) an irrational number with an irrational degree to be rational?

\(N\) points are given, no three of which lie on one line. Each two of these points are connected by a segment, and each segment is coloured in one of the \(k\) colours. Prove that if \(N > \lfloor k!e\rfloor\), then among these points one can choose three such that all sides of the triangle formed by them will be colored in one colour.

Prove that the following polynomial does not have any identical roots: \(P(x) = 1 + x + x^2/2! + \dots + x^n/n!\)

Prove that the polynomial \(x^{2n} - nx^{n + 1} + nx^{n - 1} - 1\) for \(n > 1\) has a triple root of \(x = 1\).

Let it be known that all the roots of some equation \(x^3 + px^2 + qx + r = 0\) are positive. What additional condition must be satisfied by its coefficients \(p, q\) and \(r\) in order for it to be possible to form a triangle from segments whose lengths are equal to these roots?

Let \(f (x)\) be a polynomial of degree \(n\) with roots \(\alpha_1, \dots , \alpha_n\). We define the polygon \(M\) as the convex hull of the points \(\alpha_1, \dots , \alpha_n\) on the complex plane. Prove that the roots of the derivative of this polynomial lie inside the polygon \(M\).

a) Using geometric considerations, prove that the base and the side of an isosceles triangle with an angle of \(36^{\circ}\) at the vertex are incommensurable.

b) Invent a geometric proof of the irrationality of \(\sqrt{2}\).

Prove that amongst any 7 different numbers it is always possible to choose two of them, \(x\) and \(y\), so that the following inequality was true: \[0 < \frac{x-y}{1+xy} < \frac{1}{\sqrt3}.\]

The iterative formula of Heron. Prove that the sequence of numbers \(\{x_n\}\) given by the conditions \(x_1 = 1\), \(x_{n + 1} = \frac 12 (x_n + k/x_n)\), converges. Find the limit of this sequence.