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.
The algorithm of the approximate calculation of \(\sqrt[3]{a}\). The sequence \(\{a_n\}\) is defined by the following conditions: \(a_0 = a > 0\), \(a_{n + 1} = 1/3 (2a_n + a/a^2_n)\) (\(n \geq 0\)).
Prove that \(\lim\limits_{n\to\infty} a_n = \sqrt[3]{a}\).
The sequence of numbers \(\{a_n\}\) is given by \(a_1 = 1\), \(a_{n + 1} = 3a_n/4 + 1/a_n\) (\(n \geq 1\)). Prove that:
a) the sequence \(\{a_n\}\) converges;
b) \(|a_{1000} - 2| < (3/4)^{1000}\).
Find the limit of the sequence that is given by the following conditions \(a_1 = 2\), \(a_{n + 1} = a_n/2 + a_n^2/8\) (\(n \geq 1\)).
The sequence of numbers \(\{x_n\}\) is given by the following conditions: \(x_1 \geq - a\), \(x_{n + 1} = \sqrt{a + x_n}\). Prove that the sequence \(x_n\) is monotonic and bounded. Find its limit.
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.
The frog jumps over the vertices of the hexagon \(ABCDEF\), each time moving to one of the neighbouring vertices.
a) How many ways can it get from \(A\) to \(C\) in \(n\) jumps?
b) The same question, but on condition that it cannot jump to \(D\)?
c) Let the frog’s path begin at the vertex \(A\), and at the vertex \(D\) there is a mine. Every second it makes another jump. What is the probability that it will still be alive in \(n\) seconds?
d)* What is the average life expectancy of such frogs?
Prove that the 13th day of the month is more likely to occur on a Friday than on other days of the week. It is assumed that we live in the Gregorian style calendar.
Find the largest number of colours in which you can paint the edges of a cube (each edge with one colour) so that for each pair of colours there are two adjacent edges coloured in these colours. Edges are considered to be adjacent if they have a common vertex.