« Vrati se
Seventeen people correspond by mail with one another-each one with all the rest. In their letters only three different topics are discussed. each pair of correspondents deals with only one of these topics. Prove that there are at least three people who write to each other about the same topic.

Slični zadaci

Let a,b,c be real numbers. Consider the quadratic equation in \cos{x} a \cos^2{x}+b \cos{x}+c=0. Using the numbers a,b,c form a quadratic equation in \cos{2x} whose roots are the same as those of the original equation. Compare the equation in \cos{x} and \cos{2x} for a=4, b=2, c=-1.
Prove that we can find an infinite set of positive integers of the from 2^n-3 (where n is a positive integer) every pair of which are relatively prime.
Let p_n(k) be the number of permutations of the set \{1,2,3,\ldots,n\} which have exactly k fixed points. Prove that \sum_{k=0}^nk p_n(k)=n!.(IMO Problem 1)

Original formulation

Let S be a set of n elements. We denote the number of all permutations of S that have exactly k fixed points by p_n(k). Prove:

(a) \sum_{k=0}^{n} kp_n(k)=n! \ ;

(b) \sum_{k=0}^{n} (k-1)^2 p_n(k) =n!

Proposed by Germany, FR
An n \times n, n \geq 2 chessboard is numbered by the numbers 1, 2, \ldots, n^2 (and every number occurs). Prove that there exist two neighbouring (with common edge) squares such that their numbers differ by at least n.
A permutation \{x_1, \ldots, x_{2n}\} of the set \{1,2, \ldots, 2n\} where n is a positive integer, is said to have property T if |x_i - x_{i + 1}| = n for at least one i in \{1,2, \ldots, 2n - 1\}. Show that, for each n, there are more permutations with property T than without.
Let x_1, x_2, \ldots, x_n be real numbers satisfying the conditions:
 |x_1 + x_2 + \dots + x_n| = 1 and |x_i| \leq \frac{n+1}{2}, for i = 1, 2, \dots, n
Show that there exists a permutation y_1, y_2, \ldots, y_n of x_1, x_2, \ldots, x_n such that
| y_1 + 2 y_2 + \cdots + n y_n | \leq \frac {n + 1}{2}.