Problems

Age
Difficulty
Found: 2286

Definition. The sequence of numbers \(a_0, a_1, \dots , a_n, \dots\), which, with the given \(p\) and \(q\), satisfies the relation \(a_{n + 2} = pa_{n + 1} + qa_n\) (\(n = 0,1,2, \dots\)) is called a linear recurrent sequence of the second order.

The equation \[x^2-px-q = 0\] is called a characteristic equation of the sequence \(\{a_n\}\).

Prove that, if the numbers \(a_0\), \(a_1\) are fixed, then all of the other terms of the sequence \(\{a_n\}\) are uniquely determined.

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.

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

The following words/sounds are given: look, yar, yell, lean, lease. Determine what will happen if the sounds that make up these words are pronounced in reverse order.

Author: D.E. Shnol

On the island of Truthland, all of the inhabitants may be mistaken, but the younger ones never contradict the elders, and when the older ones contradict the younger ones, they (the elders) are not mistaken. Between the residents A, B and C there was such a conversation:

A: B is the tallest.

B: A is the tallest.

C: I’m taller than B.

Does it follow from this conversation that the younger the person, the taller he or she is (for the three people having this conversation)?

Author: I.V. Izmestyev

Postman Pat did not want to give away the parcel. So, Matt suggested that he play the following game: every move, Pat writes in a line from left to right the letters M and P, randomly alternating them, until he has a line made up of 11 letters. Matt, after each of Pat’s moves, if he wants, swaps any two letters. If in the end it turns out that the recorded word is a palindrome (that is, it is the same if read from left to right and right to left), then Pat gives Matt the parcel. Can Matt play in such a way as to get the parcel?