Problems

Age
Difficulty
Found: 2573

The sequence of numbers \(a_1, a_2, a_3, \dots\) is given by the following conditions \(a_1 = 1\), \(a_{n + 1} = a_n + \frac {1} {a_n^2}\) (\(n \geq 0\)).

Prove that

a) this sequence is unbounded;

b) \(a_{9000} > 30\);

c) find the limit \(\lim \limits_ {n \to \infty} \frac {a_n} {\sqrt [3] n}\).

We are given rational positive numbers \(p, q\) where \(1/p + 1/q = 1\). Prove that for positive \(a\) and \(b\), the following inequality holds: \(ab \leq \frac{a^p}{p} + \frac{b^q}{q}\).

Prove the inequality: \[\frac{(b_1 + \dots b_n)^{b_1 + \dots b_n}}{(a_1 + \dots a_n)^{b_1 + \dots + b_n}}\leq \left(\frac{b_1}{a_1}\right)^{b_1}\dots \left( \frac{b_n}{a_n}\right)^{b_n}\] where all variables are considered positive.

Inequality of Jensen. Prove that if the function \(f (x)\) is convex upward on \([a, b]\), then for any distinct points \(x_1, x_2, \dots , x_n\) (\(n \geq 2\)) from \([a; b]\) and any positive \(\alpha_{1}, \alpha_{2}, \dots , \alpha_{n}\) such that \(\alpha_ {1} + \alpha_{2} + \dots + \alpha_{n} = 1\), the following inequality holds: \(f (\alpha_{1} x_1 + \dots + \alpha_{n} x_n) > \alpha_{1} f (x_1) + \dots + \alpha_{n} f (x_n)\).

Let \(p\) and \(q\) be positive numbers where \(1 / p + 1 / q = 1\). Prove that \[a_1b_1 + a_2b_2 + \dots + a_nb_n \leq (a_1^p + \dots a_n^p)^{1/p}(b_1^q +\dots + b_n^q)^{1/q}\] The values of the variables are considered positive.

Liouville’s discrete theorem. Let \(f (x, y)\) be a bounded harmonic function (see the definition in problem number 11.28), that is, there exists a positive constant \(M\) such that \(\forall (x, y) \in \mathbb {Z}^2\) \(| f (x, y) | \leq M\). Prove that the function \(f (x, y)\) is equal to a constant.

Let \((1 + \sqrt {2} + \sqrt {3})^n = p_n + q_n \sqrt {2} + r_n \sqrt {3} + s_n \sqrt {6}\) for \(n \geq 0\). Find:

a) \(\lim \limits_ {n \to \infty} {\frac {p_n} {q_n}}\); b) \(\lim \limits_ {n \to \infty} {\frac {p_n} {r_n}}\); c) \(\lim \limits_ {n \to \infty} {\frac {p_n} {s_n}}\);

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.