In each square of an $m \times n$ rectangular board there is a nought or a cross. Let $f(m,n)$ be the number of such arrangements that contain a row or a column consisting of noughts only. Let $g(m,n)$ be the number of arrangements that contain a row consisting of noughts only, or a column consisting of crosses only. Which of the numbers $f(m,n)$ and $g(m,n)$ is larger?

A regular polygon with $n \ge 3$ sides is given. Each vertex is coloured either red, green or blue, and no two adjacent vertices of the polygon are the same colour. There is at least one vertex of each colour. Prove that it is possible to draw certain diagonals of the polygon in such a way that they intersect only at the vertices of the polygon and they divide the polygon into triangles so that each such triangle has vertices of three different colours.

Consider the set $A = \{1, 2, 3, ..., 2n - 1\}$, where $n \ge 2$ is a positive integer. We remove from the set $A$ at least $n - 1$ elements such that: • if $a \in A$ has been removed, and $2a \in A$, then $2a$ has also been removed, • if $a, b \in A (a \ne b)$ have been removed and $a + b \in A$, then $a + b$ has also been removed. Which numbers have to be removed such that the sum of the remaining numbers is maximum?

On the coast of a circular island there are eight different cities. Initially there are no routes between the cities. We have to construct five straight two-way routes, which do not intersect, so that from each city there are one or two routes. In how many ways can this happen?

Find all positive integers $(m,n)$ such that $$11^n+2^n+6=m^3$$

In triangle $ABC$, the medians and bisectors corresponding to sides $BC$, $CA$, $AB$ are $m_a$, $m_b$, $m_c$ and $w_a$, $w_b$, $w_c$ respectively. $P=w_a \cap m_b$, $Q=w_b \cap m_c$, $R=w_c \cap m_a$. Denote the areas of triangle $ABC$ and $PQR$ by $F_1$ and $F_2$ respectively. Find the least positive constant $m$ such that $\frac{F_1}{F_2}<m$ holds for any $\triangle{ABC}$.

In a triangle $ABC$, the inner and outer angle bisectors at $C$ intersect the line $AB$ at $L$ and $M$, respectively. Prove that if $CL=CM$ then $AC^2+BC^2=4R^2$, where $R$ is the circumradius of $\triangle ABC$.

In a group of interpreters each one speaks one of several foreign languages, 24 of them speak Japanese, 24 Malaysian, 24 Farsi. Prove that it is possible to select a subgroup in which exactly 12 interpreters speak Japanese, exactly 12 speak Malaysian and exactly 12 speak Farsi.

Jack and Jill are going swimming at a pool that is one mile from their house. They leave home simultaneously. Jill rides her bicycle to the pool at a constant speed of $10$ miles per hour. Jack walks to the pool at a constant speed of $4$ miles per hour. How many minutes before Jack does Jill arrive? $\textbf{(A) }5\qquad\textbf{(B) }6\qquad\textbf{(C) }8\qquad\textbf{(D) }9\qquad \textbf{(E) }10$

Find all triplets of positive rational numbers $(m,n,p)$ such that the numbers $m+\frac 1{np}$, $n+\frac 1{pm}$, $p+\frac 1{mn}$ are integers. [i]Valentin Vornicu, Romania[/i]

Given positive integers $d \ge 3$, $r>2$ and $l$, with $2d \le l <rd$. Every vertice of the graph $G(V,E)$ is assigned to a positive integer in $\{1,2,\cdots,l\}$, such that for any two consecutive vertices in the graph, the integers they are assigned to, respectively, have difference no less than $d$, and no more than $l-d$. A proper coloring of the graph is a coloring of the vertices, such that any two consecutive vertices are not the same color. It's given that there exist a proper subset $A$ of $V$, such that for $G$'s any proper coloring with $r-1$ colors, and for an arbitrary color $C$, either all numbers in color $C$ appear in $A$, or none of the numbers in color $C$ appear in $A$. Show that $G$ has a proper coloring within $r-1$ colors.

Grasshopper Gerald and his 2020 friends play leapfrog on a plane as follows. At each turn Gerald jumps over a friend so that his original point and his resulting point are symmetric with respect to this friend. Gerald wants to perform a series of jumps such that he jumps over each friend exactly once. Let us say that a point is achievable if Gerald can finish the 2020th jump in it. What is the maximum number $N{}$ such that for some initial placement of the grasshoppers there are just $N{}$ achievable points? [i]Mikhail Svyatlovskiy[/i]

Let $a_0=5/2$ and $a_k=a_{k-1}^2-2$ for $k\ge 1.$ Compute \[\prod_{k=0}^{\infty}\left(1-\frac1{a_k}\right)\] in closed form.

On the two sides of the road two lines of trees are planted. On every tree, the number of oaks among itself and its neighbors is written. (For the first and last trees, this is the number of oaks among itself and its only neighbor). Prove that if the two sequences of numbers on the trees are equal, then sequnces of trees on the two sides of the road are equal [I]Proposed by A. Khrabrov, D. Rostovski[/i]

Let be a natural number $ n, $ a permutation $ \sigma $ of order $ n, $ and $ n $ nonnegative real numbers $ a_1,a_2,\ldots , a_n. $ Prove the following inequality. $$ \left( a_1^2+a_{\sigma (1)} \right)\left( a_2^2+a_{\sigma (2)} \right)\cdots \left( a_n^2+a_{\sigma (n)} \right)\ge \left( a_1^2+a_1 \right)\left( a_2^2+a_{2} \right)\cdots \left( a_n^2+a_n \right) $$

A triangle ABC with $\angle A = 60^o$ is given. Points $M$ and $N$ on $AB$ and $AC$ respectively are such that the circumcenter of $ABC$ bisects segment $MN$. Find the ratio $AN:MB$. by E.Bakaev

Rectangles $1\times20$, $1\times 19$, ..., $1\times 1$ were cut out of $20\times20$ table. Prove that from the remaining part of the table $36$ $1\times2$ dominos can be cut [I]Proposed by S. Berlov[/i]

We write in order of increasing number of 1 and all positive integers,which the sum of digits is divisible by $5$. Obtain a sequence of $1, 5, 14, 19. . .$ Prove that the n-th term of the sequence is less than $5n$.

Let $x,y,z>0 $ and $\sqrt{xyz}=xy+yz+zx$. Prove that$$x+y+z\leq \frac{1}{3}.$$

Prove that for every $n \in N$, $n > 6$, every equilateral triangle can be divided into $n$ pieces, which are also equilateral triangles.

Let $a_{ij}$ $i=1,2,3$; $j=1,2,3$ be real numbers such that $a_{ij}$ is positive for $i=j$ and negative for $i\neq j$. Prove the existence of positive real numbers $c_{1}$, $c_{2}$, $c_{3}$ such that the numbers \[a_{11}c_{1}+a_{12}c_{2}+a_{13}c_{3},\qquad a_{21}c_{1}+a_{22}c_{2}+a_{23}c_{3},\qquad a_{31}c_{1}+a_{32}c_{2}+a_{33}c_{3}\] are either all negative, all positive, or all zero. [i]Proposed by Kiran Kedlaya, USA[/i]

A hyperbola in the coordinate plane passing through the points $(2,5)$, $(7,3)$, $(1,1)$, and $(10,10)$ has an asymptote of slope $\frac{20}{17}$. The slope of its other asymptote can be expressed in the form $-\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $100m+n$. [i]Proposed by Michael Ren[/i]

$ABCD$ is a square such that $AB$ lies on the line $y=x+4$ and points $C$ and $D$ lie on the graph of parabola $y^2=x$. Compute the sum of all possible areas of $ABCD$.

Define $\phi_n(x)$ to be the number of integers $y$ less than or equal to $n$ such that $\gcd(x,y)=1$. Also, define $m=\text{lcm}(2016,6102)$. Compute $$\frac{\phi_{m^m}(2016)}{\phi_{m^m}(6102)}.$$

The vertical axis indicates the number of employees, but the scale was accidentally omitted from this graph. What percent of the employees at the Gauss company have worked there for $5$ years or more? [asy] for(int a=1; a<11; ++a) { draw((a,0)--(a,-.5)); } draw((0,10.5)--(0,0)--(10.5,0)); label("$1$",(1,-.5),S); label("$2$",(2,-.5),S); label("$3$",(3,-.5),S); label("$4$",(4,-.5),S); label("$5$",(5,-.5),S); label("$6$",(6,-.5),S); label("$7$",(7,-.5),S); label("$8$",(8,-.5),S); label("$9$",(9,-.5),S); label("$10$",(10,-.5),S); label("Number of years with company",(5.5,-2),S); label("X",(1,0),N); label("X",(1,1),N); label("X",(1,2),N); label("X",(1,3),N); label("X",(1,4),N); label("X",(2,0),N); label("X",(2,1),N); label("X",(2,2),N); label("X",(2,3),N); label("X",(2,4),N); label("X",(3,0),N); label("X",(3,1),N); label("X",(3,2),N); label("X",(3,3),N); label("X",(3,4),N); label("X",(3,5),N); label("X",(3,6),N); label("X",(3,7),N); label("X",(4,0),N); label("X",(4,1),N); label("X",(4,2),N); label("X",(5,0),N); label("X",(5,1),N); label("X",(6,0),N); label("X",(6,1),N); label("X",(7,0),N); label("X",(7,1),N); label("X",(8,0),N); label("X",(9,0),N); label("X",(10,0),N); label("Gauss Company",(5.5,10),N); [/asy] $\text{(A)}\ 9\% \qquad \text{(B)}\ 23\frac{1}{3}\% \qquad \text{(C)}\ 30\% \qquad \text{(D)}\ 42\frac{6}{7}\% \qquad \text{(E)}\ 50\% $