In a tournament, every two of the n players played exactly one match with each other (no
draws). Prove that it is possible either
(i) to partition the league in two groups A and B such that everybody in A defeated everybody in B ; or
(ii) to arrange all the players in a chain x1,x2,...,xn,x1 in such a way that each player defeated his successor.
A triangle whose all sides have length not smaller than 1 is inscribed in a square of side length 1 . Prove that the center of the square lies inside the triangle or on its boundary.
Suppose that (an) is a sequence of positive integers such that n→∞limann=0
Prove that there exists k such that there are at least 1990 perfect squares between a1+a2+...+ak and a1+a2+...+ak+1 .