Let A and B be two rectangles such that it is possible to get rectangle similar to A by putting together rectangles equal to B. Show that it is possible to get rectangle similar to B by putting together rectangles equal to A.

Two students $ A$ and $ B$ are playing the following game: Each of them writes down on a sheet of paper a positive integer and gives the sheet to the referee. The referee writes down on a blackboard two integers, one of which is the sum of the integers written by the players. After that, the referee asks student $ A:$ “Can you tell the integer written by the other student?” If A answers “no,” the referee puts the same question to student $ B.$ If $ B$ answers “no,” the referee puts the question back to $ A,$ and so on. Assume that both students are intelligent and truthful. Prove that after a finite number of questions, one of the students will answer “yes.”

Every member of a certain parliament has not more than $3$ enemies. Prove that it is possible to divide it onto two subparliaments so, that everyone will have not more than one enemy in his subparliament. ($A$ is the enemy of $B$ if and only if $B$ is the enemy of $A$.)

A pedestrian walked for $3.5$ hours. In every period of one hour’s duration he walked $5$ kilometres. Is it true that his average speed was $5$ kilometres per hour? (NN Konstantinov, Moscow)

Fix an integer $n \ge 2$, let $Q_n$ be the graph consisting of all vertices and all edges of an $n$-cube, and let $T$ be a spanning tree in $Q_n$. Show that $Q_n$ has an edge whose adjunction to $T$ produces a simple cycle of length at least $2n$.

Let $n\geq1$ be an integer and let $t_1<t_2<\dots<t_n$ be positive integers. In a group of $t_n+1$ people, some games of chess are played. Two people can play each other at most once. Prove that it is possible for the following two conditions to hold at the same time: (i) The number of games played by each person is one of $t_1,t_2,\dots,t_n$. (ii) For every $i$ with $1\leq i\leq n$, there is someone who has played exactly $t_i$ games of chess.

A pupil is writing on a board positive integers $x_0,x_1,x_2,x_3...$ after the following algorithm which implies arithmetic progression $3,5,7,9...$.Each term of rank $k\ge2$ is a difference between the product of the last number on the board and the term of arithmetic progression of rank $k$ and the last but one term on the bord with the sum of the terms of the arithemtic progression with ranks less than $k$.If $x_0=0 $ and $x_1=1$ find $x_n$ according to n.

A tetrahedron is given. Determine whether it is possible to put some 10 consecutive positive integers at 4 vertices and at 6 midpoints of the edges so that the number at the midpoint of each edge is equal to the arithmetic mean of two numbers at the endpoints of this edge.

Label the squares of a $1991 \times 1992$ rectangle $(m, n)$ with $1 \leq m \leq 1991$ and $1 \leq n \leq 1992$. We wish to color all the squares red. The first move is to color red the squares $(m, n), (m+1, n+1), (m+2, n+1)$for some $m < 1990, n < 1992$. Subsequent moves are to color any three (uncolored) squares in the same row, or to color any three (uncolored) squares in the same column. Can we color all the squares in this way?

We have a large supply of black, white, red and green hats. And we want to give $8$ of these hats to $8$ students that are sitting around a round table. Find the number of ways of doing that in each of these cases (assuming for the purposes of this problem that students will notchange their places, and that hats of the same color are identical) a) Each hat to be used must be either red or green. b) Exactly two hats of each color are to be used c) Exactly two hats of each color are to be used, and every two hats of the same color are to be given to two adjacent students. d) Exactly two hats of each color are to be used, and no two hats of the same color are to be given to two adjacent students. e) There are no restrictions on the number of hats of each color that are to be used, but no two hats of the same color are to be given to two adjacent students.

$a_1$, $a_2$, $a_3$, $a_4$, $a_5$, $a_6$, $a_7$ and $b_1$, $b_2$, $b_3$, $b_4$, $b_5$, $b_6$, $b_7$ are two permutations of $1, 2, 3, 4, 5, 6, 7$. Show that $|a_1 - b_1|$, $|a_2 - b_2|$, $|a_3 - b_3|$, $|a_4 - b_4|$, $|a_5 - b_5|$, $|a_6 - b_6|$, $|a_7 - b_7|$ are not all different.

Let $n\ge5$ be an integer. A trapezoid with base lengths of $1$ and $r$ is tiled by $n$ (not necessarily congruent) equilateral triangles. In terms of $n$, find the maximum possible value of $r$. [i]Linus Tang[/i]

Permutation $\pi$ of $\{1,\dots,n\}$ is called [b]stable[/b] if the set $\{\pi (k)-k|k=1,\dots,n\}$ is consisted of exactly two different elements. Prove that the number of stable permutation of $\{1,\dots,n\}$ equals to $\sigma (n)-\tau (n)$ in which $\sigma (n)$ is the sum of positive divisors of $n$ and $\tau (n)$ is the number of positive divisors of $n$. Time allowed for this problem was 75 minutes.

Let $n$ and $k$ be given integers such that $n\ge k\ge 2$. Alice and Bob play a game on an $n$ by $n$ table with white cells. They take turns to pick a white cell and color it black. Alice moves first. The game ends as soon as there is at least one black cell in every $k$ by $k$ square after a player moves, who is declared the winner of the game. Who has the winning strategy?

Let $\mathcal{S}$ be a set of $10$ points in a plane that lie within a disk of radius $1$ billion. Define a $move$ as picking a point $P \in \mathcal{S}$ and reflecting it across $\mathcal{S}$'s centroid. Does there always exist a sequence of at most $1500$ moves after which all points of $\mathcal{S}$ are contained in a disk of radius $10$? [i]Advaith Avadhanam[/i]

Find the limit, when $n$ tends to the infinity, of $$\frac{\sum_{k=0}^{n} {{2n} \choose {2k}} 3^k} {\sum_{k=0}^{n-1} {{2n} \choose {2k+1}} 3^k}$$

They tell us that a married couple has $5$ children. Calculate the probability that among them there are at least two men and at least one woman. Probability of being born male is considered $1/2$.

Show that there exists a set $ A$ of positive integers with the following property: for any infinite set $ S$ of primes, there exist [i]two[/i] positive integers $ m$ in $ A$ and $ n$ not in $ A$, each of which is a product of $ k$ distinct elements of $ S$ for some $ k \geq 2$.

A permutation $ \{x_1, x_2, \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 \minus{} x_{i \plus{} 1}| \equal{} n$ for at least one $ i$ in $ \{1,2, \ldots, 2n \minus{} 1\}.$ Show that, for each $ n$, there are more permutations with property $ T$ than without.

The numbers $1,2,\ldots,49,50$ are written on the blackboard. Ann performs the following operation: she chooses three arbitrary numbers $a,b,c$ from the board, replaces them by their sum $a+b+c$ and writes $(a+b)(b+c)(c+a)$ to her notebook. Ann performs such operations until only two numbers remain on the board (in total 24 operations). Then she calculates the sum of all $24$ numbers written in the notebook. Let $A$ and $B$ be the maximum and the minimum possible sums that Ann san obtain. Find the value of $\frac{A}{B}$. [i](I. Voronovich)[/i]

16 students took part in a competition. All problems were multiple choice style. Each problem had four choices. It was said that any two students had at most one answer in common, find the maximum number of problems.

A positive integer is written on the board. Every minute Maxim adds to the number on the board one of its positive divisors, writes the result on the board and erases the previous number. However, it is forbidden for him to add the same number twice in a row. Prove that he can proceed in such a way that eventually a perfect square will appear on the board.

A [i]squiggle[/i] is composed of six equilateral triangles with side length $1$ as shown in the figure below. Determine all possible integers $n$ such that an equilateral triangle with side length $n$ can be fully covered with [i]squiggle[/i]s (rotations and reflections of [i]squiggle[/i]s are allowed, overlappings are not). [asy] import graph; size(100); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; draw((0,0)--(0.5,1),linewidth(2pt)); draw((0.5,1)--(1,0),linewidth(2pt)); draw((0,0)--(3,0),linewidth(2pt)); draw((1.5,1)--(2,0),linewidth(2pt)); draw((2,0)--(2.5,1),linewidth(2pt)); draw((0.5,1)--(2.5,1),linewidth(2pt)); draw((1,0)--(2,2),linewidth(2pt)); draw((2,2)--(3,0),linewidth(2pt)); dot((0,0),ds); dot((1,0),ds); dot((0.5,1),ds); dot((2,0),ds); dot((1.5,1),ds); dot((3,0),ds); dot((2.5,1),ds); dot((2,2),ds); clip((-4.28,-10.96)--(-4.28,6.28)--(16.2,6.28)--(16.2,-10.96)--cycle);[/asy]

In some cells of a rectangular table $m\times n (m, n> 1)$ is one checker. $Baby$ cut along the lines of the grid this table so that it is split into two equal parts, with the number of pieces on each side were the same. $Carlson$ changed the arrangement of checkers on the board (and on each side of the cage is still worth no more than one pieces). Prove that the $Baby$ may again cut the board into two equal parts containing an equal number of pieces

In a mathematical contest, some of the competitors are friends and friendship is mutual. Prove that there is a subset $M$ of the competitors such that each element of $M$ has at most three friends in $M$ and such that each competitor who is not in $M,$ has at least four friends in $M.$