An entry in a grid is called a [i]saddle [/i] point if it is the largest number in its row and the smallest number in its column. Suppose that each cell in a $ 3 \times 3$ grid is filled with a real number, each chosen independently and uniformly at random from the interval $[0, 1]$. Compute the probability that this grid has at least one saddle point.

Peter and Basil take turns drawing roads on a plane, Peter starts. The road is either horizontal or a vertical line along which one can drive in only one direction (that direction is determined when the road is drawn). Can Basil always act in such a way that after each of his moves one could drive according to the rules between any two constructed crossroads, regardless of Peter's actions? Alexandr Perepechko

Sabine rolls a fair $14$-sided die numbered $1$ to $14$ and gets a value of $x$. She then draws $x$ cards uniformly at random (without replacement) from a deck of $14$ cards, each of which labeled a different integer from $1$ to $14$. She finally sums up the value of her die roll and the value on each card she drew to get a score of $S$. Let $A$ be the set of all obtainable scores. Compute the probability that $S$ is greater than or equal to the median of $A$.

Rose and Brunno play the game on a board shaped like a regular 1001-gon. Initially, all vertices of the board are white, and there is a chip at one of them. On each turn, Rose chooses an arbitrary positive integer \( k \), then Brunno chooses a direction: clockwise or counterclockwise, and moves the chip in the chosen direction by \( k \) vertices. If at the end of the turn the chip stands at a white vertex, this vertex is painted red. Find the greatest number of vertices that Rose can make red regardless of Brunno's actions, if the number of turns is not limited.

14 students attend the IMO training camp. Every student has at least $k$ favourite numbers. The organisers want to give each student a shirt with one of the student's favourite numbers on the back. Determine the least $k$, such that this is always possible if: $a)$ The students can be arranged in a circle such that every two students sitting next to one another have different numbers. $b)$ $7$ of the students are boys, the rest are girls, and there isn't a boy and a girl with the same number.

A circle is divided into $n$ sectors ($n \geq 3$). Each sector can be filled in with either $1$ or $0$. Choose any sector $\mathcal{C}$ occupied by $0$, change it into a $1$ and simultaneously change the symbols $x, y$ in the two sectors adjacent to $\mathcal{C}$ to their complements $1-x$, $1-y$. We repeat this process as long as there exists a zero in some sector. In the initial configuration there is a $0$ in one sector and $1$s elsewhere. For which values of $n$ can we end this process?

Players $A$ and $B$ play a game with $N \geq 2012$ coins and $2012$ boxes arranged around a circle. Initially $A$ distributes the coins among the boxes so that there is at least $1$ coin in each box. Then the two of them make moves in the order $B,A,B,A,\ldots $ by the following rules: [b](a)[/b] On every move of his $B$ passes $1$ coin from every box to an adjacent box. [b](b)[/b] On every move of hers $A$ chooses several coins that were [i]not[/i] involved in $B$'s previous move and are in different boxes. She passes every coin to an adjacent box. Player $A$'s goal is to ensure at least $1$ coin in each box after every move of hers, regardless of how $B$ plays and how many moves are made. Find the least $N$ that enables her to succeed.

Let $n$ be a positive integer. Show that there is a prime $p$ and a sequence $\left(a_k\right)_{k\ge1}$ of positive integers such that the sequence $\left(p+na_k\right)_{k\ge1}$ consists of distinct primes.

Some domino pieces are placed in a chain according to standard rules. In each move, we may remove a sub-chain with equal numbers at its ends, turn the whole sub-chain around, and put it back in the same place. Prove that for every two legal chains formed from the same pieces and having the same numbers at their ends, we can transform one to another in a finite sequence of moves.

A finite set of [i]axis parallel [/i]cubes in space has the property of each point of the room is located in a maximum of M different cubes. Show that you can divide the amount of cubes in $8 (M - 1) + 1$ subsets (or less) with the property that the cubes in each subset lacks common points. (An axis parallel cube is a cube whose edges are parallel to the coordinate axes.)

Rectangle on a checked paper with length of a unit square side being $1$ Is divided into domino figures( two unit square sharing a common edge). Prove that you colour all corners of squares on the edge of rectangle and inside rectangle with $3$ colours such that for any two corners with distance $1$ the following conditions hold: they are coloured in different colour if the line connecting the two corners is on the border of two domino figures and coloured in same colour if the line connecting the two corners is inside a domino figure.

Consider the numbers $ a_n=1-\binom{n}{3} +\binom{n}{6} -\cdots, b_n= -\binom{n}{1} +\binom{n}{4}-\binom{n}{7} +\cdots $ and $ c_n=\binom{n}{2} -\binom{n}{5} +\binom{n}{8} -\cdots , $ for a natural number $ n\ge 2. $ Prove that $$ a_n^2+b_n^2+c_n^2-a_nb_n-b_nc_n-c_na_n =3^{n-1}. $$

Let $m$ boxes be given, with some balls in each box. Let $n < m$ be a given integer. The following operation is performed: choose $n$ of the boxes and put $1$ ball in each of them. Prove: [i](a) [/i]If $m$ and $n$ are relatively prime, then it is possible, by performing the operation a finite number of times, to arrive at the situation that all the boxes contain an equal number of balls. [i](b)[/i] If $m$ and $n$ are not relatively prime, there exist initial distributions of balls in the boxes such that an equal distribution is not possible to achieve.

In a group of $n$ people each one has an Easter Egg. They exchange their eggs in the following way: On each exchange two people exchange the eggs they currently have. Each two exchange eggs between themselves at least once. After a certain amount of such exchanges it turned out that each one of the $n$ people had the same egg he had from the beginning. Determine the least amount of exchanges needed, if: a) $n=5$; b) $n=6$.

Let $n\geq 2$ be an integer and consider an array composed of $n$ rows and $2n$ columns. Half of the elements in the array are colored in red. Prove that for each integer $k$, $1<k\leq \dsp \left\lfloor \frac n2\right\rfloor+1$, there exist $k$ rows such that the array of size $k\times 2n$ formed with these $k$ rows has at least \[ \frac { k! (n-2k+2) } {(n-k+1)(n-k+2)\cdots (n-1)} \] columns which contain only red cells.

Each of 9 girls participates in several (one or more) theater groups, so that there are no two identical groups. Each of them is randomly assigned a positive integer between 1 and 30 inclusive. We call a group \textit{small} if the sum of the numbers of its members does not exceed the sum of any other group. Prove that regardless of which girl participates in which group, the probability that after receiving the numbers there will be a unique small group is at least \( \frac{7}{10} \).

[u]Round 1[/u] [b]p1.[/b] A positive integer is said to be transcendent if it leaves a remainder of $1$ when divided by $2$. Find the $1010$th smallest positive integer that is transcendent. [b]p2.[/b] The two diagonals of a square are drawn, forming four triangles. Determine, in degrees, the sum of the interior angle measures in all four triangles. [b]p3.[/b] Janabel multiplied $2$ two-digit numbers together and the result was a four digit number. If the thousands digit was nine and hundreds digit was seven, what was the tens digit? [u]Round 2[/u] [b]p4.[/b] Two friends, Arthur and Brandon, are comparing their ages. Arthur notes that $10$ years ago, his age was a third of Brandon’s current age. Brandon points out that in $12$ years, his age will be double of Arthur’s current age. How old is Arthur now? [b]p5.[/b] A farmer makes the observation that gathering his chickens into groups of $2$ leaves $1$ chicken left over, groups of $3$ leaves $2$ chickens left over, and groups of $5$ leaves $4$ chickens left over. Find the smallest possible number of chickens that the farmer could have. [b]p6.[/b] Charles has a bookshelf with $3$ layers and $10$ indistinguishable books to arrange. If each layer must hold less books than the layer below it and a layer cannot be empty, how many ways are there for Charles to arrange his $10$ books? [u]Round 3[/u] [b]p7.[/b] Determine the number of factors of $2^{2019}$. [b]p8.[/b] The points $A$, $B$, $C$, and $D$ lie along a line in that order. It is given that $\overline{AB} : \overline{CD} = 1 : 7$ and $\overline{AC} : \overline{BD} = 2 : 5$. If $BC = 3$, find $AD$. [b]p9.[/b] A positive integer $n$ is equal to one-third the sum of the first $n$ positive integers. Find $n$. [u]Round 4[/u] [b]p10.[/b] Let the numbers $a,b,c$, and $d$ be in arithmetic progression. If $a +2b +3c +4d = 5$ and $a =\frac12$ , find $a +b +c +d$. [b]p11.[/b] Ten people playing brawl stars are split into five duos of $2$. Determine the probability that Jeff and Ephramare paired up. [b]p12.[/b] Define a sequence recursively by $F_0 = 0$, $F_1 = 1$, and for all $n\ge 2$, $$F_n = \left \lceil \frac{F_{n-1}+F_{n-2}}{2} \right \rceil +1,$$ where $\lceil r \rceil$ denotes the least integer greater than or equal to $r$ . Find $F_{2019}$. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3166019p28809679]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166115p28810631]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Each vertex of a cube is assigned an 1 or a -1, and each face is assigned the product of the numbers assigned to its vertices. Determine the possible values the sum of these 14 numbers can attain.

Each face of a cube is divided into $n^2$ equal squares. The vertices of the squares are called [i]nodes[/i], so each face has $(n+1)^2$ nodes. $(a)$ If $n=2$,does there exist a closed polygonal line whose links are sids of the squares and which passes through each node exactly once? $(b)$ Prove that, for each $n$, such a polygonal line divides the surface area of the cube into two equal parts

A strategical video game consists of a map of finitely many towns. In each town there are $k$ directions, labelled from $1$ through $k$. One of the towns is designated as initial, and one – as terminal. Starting from the initial town the hero of the game makes a finite sequence of moves. At each move the hero selects a direction from the current town. This determines the next town he visits and a certain positive amount of points he receives. Two strategical video games are equivalent if for every sequence of directions the hero can reach the terminal town from the initial in one game, he can do so in the other game, and, in addition, he accumulates the same amount of points in both games. For his birthday John receives two strategical video games – one with $N$ towns and one with $M$ towns. He claims they are equivalent. Marry is convinced they are not. Marry is right. Prove that she can provide a sequence of at most $N +M$ directions that shows the two games are indeed not equivalent. [i]Stefan Gerdjikov, Bulgaria[/i]

Prove that from a set of ten distinct two-digit numbers, it is always possible to find two disjoint subsets whose members have the same sum.

4.4. Prove that there exists a set X of 1996 positive integers with the following properties: (i) the elements of X are pairwise coprime; (ii) all elements of X and all sums of two or more distinct elements of X are composite numbers

A SET cards have four characteristics: number, color, shape, and shading, each of which has $3$ values. A SET deck has $81$ cards, one for each combination of these values. A SET is three cards such that, for each characteristic, the values of the three cards for that characteristics are either all the same or all different. In how many ways can you replace each SET card in the deck with another SET card (possibly the same), with no card used twice, such that any three cards that were a SET before are still a SET? (Alternately, a SET card is an ordered $4$-tuple of $0$s, $1$s, and $2$s, and three cards form a SET if their sum is ($0, 0, 0, 0$) mod $3$, for instance, ($0, 1, 2, 2$), ($1, 0, 2, 1$), and ($2, 2, 2, 0$) form a SET. How many permutations of the SET cards maintain SET-ness?)

The circle is divided into $49$ areas so that no three areas touch at one point. The resulting “map” is colored in three colors so that no two adjacent areas have the same color. The border of two areas is considered to be colored in both colors. Prove that on the circle there are two diametrically opposite points, colored in one color.

From an equilateral triangle with side 2014 we cut off another equilateral triangle with side 214, such that both triangles have one common vertex and two of the side of the smaller triangles lie on two of the side of the bigger triangle. Is it possible to cover this figure with figures in the picture without overlapping (rotation is allowed) if all figures are made of equilateral triangles with side 1? Explain the answer! [asy] import olympiad; unitsize(20); pair A,B,C,D,E,F,G,H; A=(0,0); B=(1,0); C=rotate(60)*B; D=rotate(60)*C; E=rotate(60)*D; F=rotate(60)*E; G=rotate(60)*F; draw(A--B); draw(A--C); draw(A--D); draw(A--E); draw(A--F); draw(A--G); draw(B--C--D--E--F--G--B); A=(2,0); B=A+(1,0); C=A+rotate(60)*(B-A); D=A+rotate(60)*(C-A); E=A+rotate(120)*(D-A); F=A+rotate(60)*(E-A); G=2*F-E; H=2*C-D; draw(A--D--C--A--B--C--H--B--G--F--E--A--F--B); A=(4,0); B=A+(1,0); C=A+rotate(-60)*(B-A); D=B+rotate(60)*(C-B); E=B+rotate(60)*(D-B); F=B+rotate(60)*(E-B); G=E+rotate(60)*(D-E); H=E+rotate(60)*(G-E); draw(A--B--C--A); draw(C--D--B); draw(D--E--B); draw(B--F--E); draw(E--G--D); draw(E--H--G); A=(8.5,0.5); B=A+(1,0); C=A+rotate(60)*(B-A); D=A+rotate(60)*(C-A); E=A+rotate(60)*(D-A); F=A+rotate(60)*(E-A); G=A+rotate(60)*(F-A); H=G+rotate(60)*(F-G); draw(A--B); draw(A--C); draw(A--D); draw(A--E); draw(A--F); draw(A--G); draw(B--C); draw(D--E--F--G--B); draw(G--H--F);[/asy]