Problems

Age
Difficulty
Found: 1155

Prove that for \(x \ne \pi n\) (\(n\) is an integer) \(\sin x\) and \(\cos x\) are rational if and only if the number \(\tan x/2\) is rational.

For a given polynomial \(P (x)\) we describe a method that allows us to construct a polynomial \(R (x)\) that has the same roots as \(P (x)\), but all multiplicities of 1. Set \(Q (x) = (P(x), P'(x))\) and \(R (x) = P (x) Q^{-1} (x)\). Prove that

a) all the roots of the polynomial \(P (x)\) are the roots of \(R (x)\);

b) the polynomial \(R (x)\) has no multiple roots.

Prove that for \(n> 0\) the polynomial \(nx^{n + 1} - (n + 1) x^n + 1\) is divisible by \((x - 1)^2\).

An iterative polyline serves as a geometric interpretation of the iteration process. To construct it, on the \(Oxy\) plane, the graph of the function \(f (x)\) is drawn and the bisector of the coordinate angle is drawn, as is the straight line \(y = x\). Then on the graph of the function the points \[A_0 (x_0, f (x_0)), A_1 (x_1, f (x_1)), \dots, A_n (x_n, f (x_n)), \dots\] are noted and on the bisector of the coordinate angle – the points \[B_0 (x_0, x_0), B_1 (x_1, x_1), \dots , B_n (x_n, x_n), \dots.\] The polygonal line \(B_0A_0B_1A_1 \dots B_nA_n \dots\) is called iterative.

Construct an iterative polyline from the following information:

a) \(f (x) = 1 + x/2\), \(x_0 = 0\), \(x_0 = 8\);

b) \(f (x) = 1/x\), \(x_0 = 2\);

c) \(f (x) = 2x - 1\), \(x_0 = 0\), \(x_0 = 1{,}125\);

d) \(f (x) = - 3x/2 + 6\), \(x_0 = 5/2\);

e) \(f (x) = x^2 + 3x - 3\), \(x_0 = 1\), \(x_0 = 0{,}99\), \(x_0 = 1{,}01\);

f) \(f (x) = \sqrt{1 + x}\), \(x_0 = 0\), \(x_0 = 8\);

g) \(f (x) = x^3/3 - 5x^2/x + 25x/6 + 3\), \(x_0 = 3\).

The sequence of numbers \(a_n\) is given by the conditions \(a_1 = 1\), \(a_{n + 1} = a_n + 1/a^2_n\) (\(n \geq 1\)).

Is it true that this sequence is limited?

The numbers \(a_1, a_2, \dots , a_k\) are such that the equality \(\lim\limits_{n\to\infty} (x_n + a_1x_{n - 1} + \dots + a_kx_{n - k}) = 0\) is possible only for those sequences \(\{x_n\}\) for which \(\lim\limits_{n\to\infty} x_n = 0\). Prove that all the roots of the polynomial P \((\lambda) = \lambda^k + a_1 \lambda^{k-1} + a_2 \lambda^{k -2} + \dots + a_k\) are modulo less than 1.