Find the generating functions of the sequences of Chebyshev polynomials of the first and second kind: \[F_T(x,z) = \sum_{n=0}^{\infty}T_n(x)z^n;\quad F_U(x,z) = \sum_{n=0}^{\infty}U_n(X)z^n.\]
Definitions of Chebyshev polynomials can be found in the handbook.
We denote by \(P_{k, l}(n)\) the number of partitions of the number \(n\) into at most \(k\) terms, each of which does not exceed \(l\). Prove the equalities:
a) \(P_{k, l}(n) - P_{k, l-1}(n) = P_{k-1, l}(n-l)\);
b) \(P_{k, l}(n) - P_{k-1, l} (n) = P_{k, l-1}(n-k)\);
c) \(P_{k, l}(n) = P_{l, k} (n)\);
d) \(P_{k, l}(n) = P_{k, l} (kl - n)\).
Prove that the polynomial \(P (x)\) is divisible by its derivative if and only if \(P (x)\) has the form \(P(x) = a_n(x - x_0)^n\).
Prove that the polynomial \(P (x) = a_0 + a_1x + \dots + a_nx^n\) has a number \(-1\) which is a root of multiplicity \(m + 1\) if and only if the following conditions are satisfied: \[\begin{aligned} a_0 - a_1 + a_2 - a_3 + \dots + (-1)^{n}a_n &= 0,\\ - a_1 + 2a_2 - 3a_3 + \dots + (-1)^{n}na_n &= 0,\\ \dots \\ - a_1 + 2^{m}a_2 - 3^{m}a_3 + \dots + (-1)^{n}n^{m}a_n &= 0. \end{aligned}\]
Find the largest value of the expression \(a + b + c + d - ab - bc - cd - da\), if each of the numbers \(a\), \(b\), \(c\) and \(d\) belongs to the interval \([0, 1]\).
A polynomial of degree \(n > 1\) has \(n\) distinct roots \(x_1, x_2, \dots , x_n\). Its derivative has the roots \(y_1, y_2, \dots , y_{n-1}\). Prove the inequality \[\frac{x_1^2 + \dots + x_n^2}{n}> \frac{y_1^2 + \dots + y_n^2}{n}.\]
A group of several friends was in correspondence in such a way that each letter was received by everyone except for the sender. Each person wrote the same number of letters, as a result of which all together the friends received 440 letters. How many people could be in this group of friends?
In the Republic of mathematicians, the number \(\alpha > 2\) was chosen and coins were issued with denominations of 1 pound, as well as in \(\alpha^k\) pounds for every natural \(k\). In this case \(\alpha\) was chosen so that the value of all the coins, except for the smallest, was irrational. Could it be that any amount of a natural number of pounds can be made with these coins, using coins of each denomination no more than 6 times?
A function \(f\) is given, defined on the set of real numbers and taking real values. It is known that for any \(x\) and \(y\) such that \(x > y\), the inequality \((f (x)) ^2 \leq f (y)\) is true. Prove that the set of values generated by the function is contained in the interval \([0,1]\).
In a line 40 signs are written out: 20 crosses and 20 zeros. In one move, you can swap any two adjacent signs. What is the least number of moves in which it is guaranteed that you can ensure that some 20 consecutive signs are crosses?