There are $10$ birds on the ground. For any $5$ of them, there are at least $4$ birds on a circle. Determine the least possible number of birds on the circle with the most birds.

Consider a $2018 \times 2019$ board with integers in each unit square. Two unit squares are said to be neighbours if they share a common edge. In each turn, you choose some unit squares. Then for each chosen unit square the average of all its neighbours is calculated. Finally, after these calculations are done, the number in each chosen unit square is replaced by the corresponding average. Is it always possible to make the numbers in all squares become the same after finitely many turns?

Let $a_{i,j}\enspace(\forall\enspace 1\leq i\leq n, 1\leq j\leq n)$ be $n^2$ real numbers such that $a_{i,j}+a_{j,i}=0\enspace\forall i, j$ (in particular, $a_{i,i}=0\enspace\forall i$). Prove that $$ {1\over n}\sum_{i=1}^{n}\left(\sum_{j=1}^{n} a_{i,j}\right)^2\leq{1\over2}\sum_{i=1}^{n}\sum_{j=1}^{n} a_{i,j}^2. $$

Let $6$ pairwise different digits are given and all of them are different from $0$. Prove that there exist $2$ six-digit integers, such that their difference is equal to $9$ and each of them contains all given $6$ digits.

A positive integer $n$ is [i]Danish[/i] if a regular hexagon can be partitioned into $n$ congruent polygons. Prove that there are infinitely many positive integers $n$ such that both $n$ and $2^n+n$ are Danish.

In a test, $3n$ students participate, who are located in three rows of $n$ students in each. The students leave the test room one by one. If $N_1(t), N_2(t), N_3(t)$ denote the numbers of students in the first, second, and third row respectively at time $t$, find the probability that for each t during the test, \[|N_i(t) - N_j(t)| < 2, i \neq j, i, j = 1, 2, \dots .\]

[u]Round 1[/u] [b]p1.[/b] How many powers of $2$ are greater than $3$ but less than $2013$? [b]p2.[/b] What number is equal to six greater than three times the answer to this question? [b]p3.[/b] Surya Cup-a-tea-raju goes to Starbucks Coffee to sip coffee out of a styrofoam cup. The cup is a cylinder, open on one end, with base radius $3$ centimeters and height $10$ centimeters. What is the exterior surface area of the styrofoam cup? [u]Round 2[/u] [b]p4.[/b] Andrew has two $6$-foot-length sticks that he wishes to make into two of the sides of the entrance to his fort, with the ground being the third side. If he wants to make his entrance in the shape of a triangle, what is the largest area that he can make the entrance? [b]p5.[/b] Ethan and Devin met a fairy who told them “if you have less than $15$ dollars, I will give you cake”. If both had integral amounts of dollars, and Devin had 5 more dollars than Ethan, but only Ethan got cake, how many different amounts of money could Ethan have had? [b]p6.[/b] If $2012^x = 2013$, for what value of $a$, in terms of $x$, is it true that $2012^a = 2013^2$? [u]Round 3[/u] [b]p7.[/b] Find the ordered triple $(L, M, T)$ of positive integers that makes the following equation true: $$1 + \dfrac{1}{L + \dfrac{1}{M+\dfrac{1}{T}}}=\frac{79}{43}.$$ [b]p8.[/b] Jonathan would like to start a banana plantation so he is saving up to buy an acre of land, which costs $\$600,000$. He deposits $\$300,000$ in the bank, which gives $20\%$ interest compounded at the end of each year. At this rate, how many years will Jonathan have to wait until he can buy the acre of land? [b]p9.[/b] Arul and Ethan went swimming at their town pool and started to swim laps to see who was in better shape. After one hour of swimming at their own paces, Ethan completed $32$ more laps than Arul. However, after that, Ethan got tired and swam at half his original speed while Arul’s speed didn’t change. After one more hour, Arul swam a total of $320$ laps. How many laps did Ethan swim after two hours? [u]Round 4[/u] [b]p10.[/b] A right triangle with a side length of $6$ and a hypotenuse of 10 has circles of radius $1$ centered at each vertex. What is the area of the space inside the triangle but outside all three circles? [b]p11.[/b] In isosceles trapezoid $ABCD$, $\overline{AB} \parallel\overline{CD}$ and the lengths of $\overline{AB}$ and $\overline{CD}$ are $2$ and $6$, respectively. Let the diagonals of the trapezoid intersect at point $E$. If the distance from $E$ to $\overline{CD}$ is $9$, what is the area of triangle $ABE$? [b]p12.[/b] If $144$ unit cubes are glued together to form a rectangular prism and the perimeter of the base is $54$ units, what is the height? PS. You should use hide for answers. Rounds 6-8 are [url=https://artofproblemsolving.com/community/c3h3136014p28427163]here[/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3137069p28442224]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]6.1[/b] Three shooters - Anilov, Borisov and Vorobiev - made $6$ each shots at one target and scored equal points. It is known that Anilov scored $43$ points in the first three shots, and Borisov scored $43$ points with the first shot knocked out 3 points. How many points did each shooter score per shot? if there was one hit in 50, two in 25, three in 20, three in 10, two in 5, in 3 - two, in 2 - two, in 1 - three? [img]https://cdn.artofproblemsolving.com/attachments/a/1/4abb71f7bccc0b9d2e22066ec17c31ef139d6a.png[/img] [b]6.2 / 7.4 [/b]Prove that a $10 \times 10$ chessboard cannot be covered with $ 25$ figures like [img]https://cdn.artofproblemsolving.com/attachments/0/4/89aafe1194628332ec13ad1c713bb35cbefff7.png[/img]. [b]6.3[/b] The squares of a chessboard contain natural numbers such that each is equal to the arithmetic mean of its neighbors. Sum of numbers standing in the corners of the board is $16$. Find the number standing on the field $e2$. [b]6.4 [/b] There is a table $ 100 \times 100$. What is the smallest number of letters which can be arranged in its cells so that no two are identical the letters weren't next to each other? [b]6.5[/b] The pioneer detachment is lined up in a rectangle. In each rank the tallest is noted, and from these pioneers the most short. In each row, the lowest one is noted, and from them is selected the tallest. Which of these two pioneers is taller? (This means that the two pioneers indicated are the highest of the low and the lowest of tall - must be different) [b]6.6[/b] Find the product of three numbers whose sum is equal to the sum of their squares, equal to the sum of their cubes and equal to $1$. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983461_1964_leningrad_math_olympiad]here[/url].

In any cell of an $n \times n$ table a number is written such that all the rows are distinct. Prove that we can remove a column such that the rows in the new table are still distinct.

An equilateral triangle $ABC$ has sides of length $n$, a positive integer. Divide the triangle into equilateral triangles of length $ 1$, drawing parallel lines (at distance $ 1$) to all sides of the triangle. A path is a continuous path, starting at the triangle with vertex $A$ and always crossing from one small triangle to another on the side that both triangles share, in such a way that it never passes through a small triangle twice. Find the maximum number of triangles that can be visited.

For any integer $n\ge 2$, let $N(n)$ be the maximum number of triples $(a_j,b_j,c_j),j=1,2,3,\cdots ,N(n),$ consisting of non-negative integers $a_j,b_j,c_j$ (not necessarily distinct) such that the following two conditions are satisfied: (a) $a_j+b_j+c_j=n,$ for all $j=1,2,3,\cdots N(n)$; (b) $j\neq k$, then $a_j\neq a_k$, $b_j\neq b_k$ and $c_j\neq c_k$. Determine $N(n)$ for all $n\ge 2$.

In a certain country there are more than $101$ towns. The capital of this country is connected by direct air routes with $100$ towns, and each town, except for the capital, is connected by direct air routes with $10$ towns (if $A$ is connected with $B, B$ is connected with $A$). It is known that from any town it is possible to travel by air to any other town (possibly via other towns). Prove that it is possible to close down half of the air routes connected with the capital, and preserve the capability of travelling from any town to any other town within the country. (IS Rubanov)

Suppose $ \,G\,$ is a connected graph with $ \,k\,$ edges. Prove that it is possible to label the edges $ 1,2,\ldots ,k\,$ in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1. [b]Note: Graph-Definition[/b]. A [b]graph[/b] consists of a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of vertices $ \,u,v\,$ belongs to at most one edge. The graph $ G$ is connected if for each pair of distinct vertices $ \,x,y\,$ there is some sequence of vertices $ \,x \equal{} v_{0},v_{1},v_{2},\cdots ,v_{m} \equal{} y\,$ such that each pair $ \,v_{i},v_{i \plus{} 1}\;(0\leq i < m)\,$ is joined by an edge of $ \,G$.

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

Let $S$ denote $\{1, \dots , 100\}$, and let $f$ be a permutation of $S$ such that for all $x\in S$, $f(x)\ne x$. Over all such $f$, find the maximum number of elements $j$ that satisfy $\underbrace{f(\dots(f(j))\dots)}_{\text{j times}}=j$. [i]Proposed by Hari Desikan[/i]

Given a positive integer $n\ge 3$, colour each cell of an $n\times n$ square array with one of $\lfloor (n+2)^2/3\rfloor$ colours, each colour being used at least once. Prove that there is some $1\times 3$ or $3\times 1$ rectangular subarray whose three cells are coloured with three different colours. [i](Russia) Ilya Bogdanov, Grigory Chelnokov, Dmitry Khramtsov[/i]

In the plane, $n$ lines are drawn in general position (that is, there are neither two of them parallel nor three of them passing through the same point). Prove that it is possible to put a positive integer in each region (finite or infinite) determined by these lines so that for each line the sum of the numbers in the regions of a sdemiplane is equal to the sum of the numbers in the regions of the other semiplane. Note: A region is a set of points such that the straight line connecting any two of them it does not intersect any of the lines. For example, a line divides the plane into $2$ infinite regions and three lines into general position divide the plane into $7$ regions, some finite(s) and others infinite.

Air Michael and Air Patrick operate direct flights connecting Belfast, Cork, Dublin, Galway, Limerick, and Waterord. For each pair of cities exactly one of the airlines operates the route (in both directions) connecting the cities. Prove that there are four cities for which one of the airlines operates a round trip. (Note that a round trip of four cities $ P,Q,R,$ and $ S$, is a journey that follows the path $ P \rightarrow Q \rightarrow R \rightarrow S \rightarrow P$.)

A $3n$-table is a table with three rows and $n$ columns containing all the numbers $1, 2, …, 3n$. Such a table is called [i]tidy [/i] if the $n$ numbers in the first row appear in ascending order from left to right, and the three numbers in each column appear in ascending order from top to bottom. How many tidy $3n$-tables exist?

A permutation of a set is a bijection from the set to itself. For example, if $\sigma$ is the permutation $1 7\mapsto 3$, $2 \mapsto 1$, and $3 \mapsto 2$, and we apply it to the ordered triplet $(1, 2, 3)$, we get the reordered triplet $(3, 1, 2)$. Let $\sigma$ be a permutation of the set $\{1, ... , n\}$. Let $$\theta_k(m) = \begin{cases} m + 1 & \text{for} \,\, m < k\\ 1 & \text{for} \,\, m = k\\ m & \text{for} \,\, m > k\end{cases}$$ Call a finite sequence $\{a_i\}^{j}_{i=1}$ a disentanglement of $\sigma$ if $\theta_{a_j} \circ ...\circ \theta_{a_j} \circ \sigma$ is the identity permutation. For example, when $\sigma = (3, 2, 1)$, then $\{2, 3\}$ is a disentaglement of $\sigma$. Let $f(\sigma)$ denote the minimum number $k$ such that there is a disentanglement of $\sigma$ of length $k$. Let $g(n)$ be the expected value for $f(\sigma)$ if $\sigma$ is a random permutation of $\{1, ... , n\}$. What is $g(6)$?

An equilateral triangle side $10$ is divided into $100$ equilateral triangles of side $1$ by lines parallel to its sides. There are m equilateral tiles of $4$ unit triangles and $25 - m$ straight tiles of $4$ unit triangles (as shown below). For which values of $m$ can they be used to tile the original triangle. [The straight tiles may be turned over.]

During his excursion to the historical park, Pepito set out to collect stones whose weight in kilograms is a power of two. Once the first stone has been collected, Pepito only collects stones strictly heavier than the first. At the end of the excursion, her partner Ana chooses a positive integer $K \ge 2$ and challenges Pepito to divide the stones into $K$ groups of equal weight. a) Can Pepito meet the challenge if all the stones he collected have different weights? b) Can Pepito meet the challenge if some collected stones are allowed to have equal weight?

Let p be a prime and $a_1 , a_2 , ..., a_k$ pairwise incongruent modulo p . Prove that $[\sqrt {k-1}]$ of the elements can be selected from $a_i$'s such that adding any numbers different from the selected ones will never give a number divisible by p .

Sasha has a bag that holds $6$ red marbles and $7$ green marbles. How many ways can Sasha pick a handful of (zero or more) marbles from the bag such that her handful contains at least as many red marbles as green marbles (any two marbles are distinguishable, even if they have the same color)?

A country has 1001 cities, and each two cities are connected by a one-way street. From each city exactly 500 roads begin, and in each city 500 roads end. Now an independent republic splits itself off the country, which contains 668 of the 1001 cities. Prove that one can reach every other city of the republic from each city of this republic without being forced to leave the republic.