« Vrati se
Let n be a positive integer, and let x and y be a positive real number such that x^n + y^n = 1. Prove that 
  \left(\sum^n_{k = 1} \frac {1 + x^{2k}}{1 + x^{4k}} \right) \cdot \left( \sum^n_{k = 1} \frac {1 + y^{2k}}{1 + y^{4k}} \right) < \frac{1}{(1 - x)(1 - y)} \text{.}

Author: unknown author, Estonia

Slični zadaci

Solve the following system of equations, in which a is a given number satisfying |a| > 1:

\begin{matrix}x_{1}^{2}= ax_{2}+1\\ x_{2}^{2}= ax_{3}+1\\ \ldots\\ x_{999}^{2}= ax_{1000}+1\\ x_{1000}^{2}= ax_{1}+1\\ \end{matrix}
Let S be the set of all pairs (m,n) of relatively prime positive integers m,n with n even and m < n. For s = (m,n) \in S write n = 2^k \cdot n_o where k, n_0 are positive integers with n_0 odd and define f(s) = (n_0, m + n - n_0). Prove that f is a function from S to S and that for each s = (m,n) \in S, there exists a positive integer t \leq \frac{m+n+1}{4} such that f^t(s) = s, where f^t(s) = \underbrace{ (f \circ f \circ \cdots \circ f) }_{t \text{ times}}(s).

If m+n is a prime number which does not divide 2^k - 1 for k = 1,2, \ldots, m+n-2, prove that the smallest value t which satisfies the above conditions is \left [\frac{m+n+1}{4} \right ] where \left[ x \right] denotes the greatest integer \leq x.
Consider those functions f: \mathbb{N} \mapsto \mathbb{N} which satisfy the condition
f(m + n) \geq f(m) + f(f(n)) - 1
for all m,n \in \mathbb{N}. Find all possible values of f(2007).

Author: unknown author, Bulgaria
Find all functions f: \mathbb{R}^{ + }\to\mathbb{R}^{ + } satisfying f\left(x + f\left(y\right)\right) = f\left(x + y\right) + f\left(y\right) for all pairs of positive reals x and y. Here, \mathbb{R}^{ + } denotes the set of all positive reals.

Proposed by Paisan Nakmahachalasint, Thailand
Let c > 2, and let a(1), a(2), \ldots be a sequence of nonnegative real numbers such that
a(m + n) \leq 2 \cdot a(m) + 2 \cdot a(n) \text{ for all } m,n \geq 1,
and a\left(2^k \right) \leq \frac {1}{(k + 1)^c} \text{ for all } k \geq 0. Prove that the sequence a(n) is bounded.

Author: Vjekoslav Kovač, Croatia
Find all surjective functions f: \mathbb{N} \mapsto \mathbb{N} such that for every m,n \in \mathbb{N} and every prime p, the number f(m + n) is divisible by p if and only if f(m) + f(n) is divisible by p.

Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran