« Vrati se
A sequence (u_{n}) is defined by u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for  } n=1,\ldots Prove that for any positive integer n we have [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}}(where {{ Nevaljan tag "x" }} denotes the smallest integer \leq x).

Slični zadaci

For each positive integer n, let f(n) denote the number of ways of representing n as a sum of powers of 2 with nonnegative integer exponents. Representations which differ only in the ordering of their summands are considered to be the same. For instance, f(4) = 4, because the number 4 can be represented in the following four ways: 4; 2+2; 2+1+1; 1+1+1+1.

Prove that, for any integer n \geq 3 we have 2^{\frac {n^2}{4}} < f(2^n) < 2^{\frac {n^2}2}.
Consider infinite sequences \{x_n\} of positive reals such that x_0=1 and x_0\ge x_1\ge x_2\ge\ldots.

a) Prove that for every such sequence there is an n\ge1 such that: {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999.

b) Find such a sequence such that for all n: {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4.
Let 0<f(1)<f(2)<f(3)<\ldots a sequence with all its terms positive. The n-th positive integer which doesn't belong to the sequence is f(f(n))+1. Find f(240).
In a finite sequence of real numbers the sum of any seven successive terms is negative and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.
In a plane a set of n points (n \geq 3) is give. Each pair of points is connected by a segment. Let d be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length d. Prove that the number of diameters of the given set is at most n.
Five students A, B, C, D, E took part in a contest. One prediction was that the contestants would finish in the order ABCDE. This prediction was very poor. In fact, no contestant finished in the position predicted, and no two contestants predicted to finish consecutively actually did so. A second prediction had the contestants finishing in the order DAECB. This prediction was better. Exactly two of the contestants finished in the places predicted, and two disjoint pairs of students predicted to finish consecutively actually did so. Determine the order in which the contestants finished.