Consider an infinite array of integers. Assume that each integer is equal to the sum of the integers immediately above and immediately to the left. Assume that there exists a row $R_0$ such that all the number in the row are positive. Denote by $R_1$ the row below row $R_0$, by $R_2$ the row below row $R_1$, and so on. Show that for each positive integer $n$, row $R_n$ cannot contain more than $n$ zeros.

In a country, there are $2018$ cities, some of which are connected by roads. Each city is connected to at least three other cities. It is possible to travel from any city to any other city using one or more roads. For each pair of cities, consider the shortest route between these two cities. What is the greatest number of roads that can be on such a shortest route?

Let $n$ be a positive integer. For any $k$, denote by $a_k$ the number of permutations of $\{1,2,\dots,n\}$ with exactly $k$ disjoint cycles. (For example, if $n=3$ then $a_2=3$ since $(1)(23)$, $(2)(31)$, $(3)(12)$ are the only such permutations.) Evaluate \[ a_n n^n + a_{n-1} n^{n-1} + \dots + a_1 n. \][i]Proposed by Sammy Luo[/i]

Given an odd integer $n \geq 3$. Let $V$ be the set of vertices of a regular $n$-gon, and $P$ be the set of all regular polygons formed by points in $V$. For instance, when $n=15$, $P$ consists of $1$ regular $15$-gon, $3$ regular pentagons, and $5$ regular triangles. Initially, all points in $V$ are uncolored. Two players, $A$ and $B$, play a game where they take turns coloring an uncolored point, with player $A$ starting and coloring points red, and player $B$ coloring points blue. The game ends when all points are colored. A regular polygon in $P$ is called $\textit{good}$ if it has more red points than blue points. Find the largest positive integer $k$ such that no matter how player $B$ plays, player $A$ can ensure that there are at least $k$ $\textit{good}$ polygons.

A railway line is divided into ten sections by stations $E_1, E_2,..., E_{11}$. The distance between the first and the last station is $56$ km. A trip through two consecutive stations never exceeds $ 12$ km, and a trip through three consecutive stations is at least $17$ Km. Calculate the distance between $E_2$ and $E_7$.

There is a box with 2020 stones. Ana and Beto alternately play removing stones from the box and starting with Ana. Each player in turn must remove a positive number of stones that is capicua. Whoever leaves the box empty wins. Determine which of the two has a strategy winner and explain what that strategy is. $Note: $ A positive integer is capicua if it can be read equally from right to right. left and left to right. For example, 3, 22, 484 and 2002 are capicuas.

Let $n$ be a positive integer. We want to make up a collection of cards with the following properties: 1. each card has a number of the form $m!$ written on it, where $m$ is a positive integer. 2. for any positive integer $ t \le n!$, we can select some card(s) from this collection such that the sum of the number(s) on the selected card(s) is $t$. Determine the smallest possible number of cards needed in this collection.

Eight strangers are preparing to play bridge. How many ways can they be grouped into two bridge games - that is, into unordered pairs of unordered pairs of people?

Is it possible in a plane mark $10$ red, $10$ blue and $10$ green points (all distinct) such that three conditions hold: $i)$ For every red point $A$ there exists a blue point closer to point $A$ than any other green point $ii)$ For every blue point $B$ there exists a green point closer to point $B$ than any other red point $iii)$ For every green point $C$ there exists a red point closer to point $C$ than any other blue point

Given a $8$x$8$ square board a) Prove that: for any ways to color the board, we are always be able to find a rectangle consists of $8$ squares such that these squares are not colored. b) Prove that: we can color $7$ squares on the board such that for any rectangles formed by $\geq 9$ squares, there are at least $1$ colored square.

In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Find all functions $f: \mathbb{R}^+\to\mathbb{R}^+$ such that \[f(x+f(y+xy))=(y+1)f(x+1)-1\]for all $x,y\in\mathbb{R}^+$. ($\mathbb{R}^+$ denotes the set of positive real numbers.)

Alice and Bob play the following game: starting with the number $2$ written on a blackboard, each player in turn changes the current number $n$ to a number $n + p$, where $p$ is a prime divisor of $n$. Alice goes first and the players alternate in turn. The game is lost by the one who is forced to write a number greater than $\underbrace{22...2}_{2020}$. Assuming perfect play, who will win the game.

Positive integer $k$ and $k$ colors are given. We will say that a set of $2k$ points on a plane is $colorful$, if it contains exactly 2 points of each color and if lines connecting every two points of the same color are pairwise distinct. Find, in terms of $k$ the least integer $n\geq 2$ such that: in every set of $nk$ points of a plane, no three of which are collinear, consisting of $n$ points of every color there exists a $colorful$ subset.

[color=darkred]On a table there are $k\ge 2$ piles having $n_1,n_2,\ldots,n_k$ pencils respectively. A [i]move[/i] consists in choosing two piles having $a$ and $b$ pencils respectively, $a\ge b$ and transferring $b$ pencils from the first pile to the second one. Find the necessary and sufficient condition for $n_1,n_2,\ldots,n_k$ , such that there exists a succession of moves through which all pencils are transferred to the same pile.[/color]

A one-person game with two possible outcomes is played as follows: After each play, the player receives either $a$ or $b$ points, where $a$ and $b$ are integers with $0 < b < a < 1986$. The game is played as many times as one wishes and the total score of the game is defined as the sum of points received after successive plays. It is observed that every integer $x \geq 1986$ can be obtained as the total score whereas $1985$ and $663$ cannot. Determine $a$ and $b.$

Consider the solid $Q$ obtained by attaching unit cubes $Q_1...Q_6$ at the six faces of a unit cube $Q$. Prove or disprove that the space can be filled up with such solids so that no two of them have a common interior point.

Suppose that we have $2n$ non-empty subset of $ \big\{0,1,2,...,2n-1\big\} $ that sum of the elements of these subsets is $ \binom{2n+1}{2}$ . Prove that we can choose one element from every subset that some of them is $ \binom{2n}{2}$ [i]Proposed by Morteza Saghafian and Afrouz Jabalameli [/i]

$n$ players participated in a competition. Any two players have played exactly one game, and there was no tie game. For a set of $k(\le n)$ players, if it is able to line the players up so that each player won every player at the back, we call the set [i]ranked[/i]. For each player who participated in the competition, the set of players who lost to the player is ranked. Prove that the whole set of players can be split into three or less ranked sets.

There are $n+1$ containers arranged in a circle. One container has $n$ stones, the others are empty. A move is to choose two containers $A$ and $B$, take a stone from $A$ and put it in one of the containers adjacent to $B$, and to take a stone from $B$ and put it in one of the containers adjacent to $A$. We can take $A = B$. For which $n$ is it possible by series of moves to end up with one stone in each container except that which originally held $n$ stones.

$2^{n-1}$ subsets are choosen from a set with $n$ elements, such that every three of these subsets have an element in common. Show that all subsets have an element in common.

A [i]squidward[/i] is a piece that moves on a board in the following way: it advances three squares in one direction and then two squares in a perpendicular direction. For example, in the figure below, by making one move, the squidward can move to any of the $8$ squares indicated with arrows. Initially, there is one squidward on each of the $35$ squares of a $5 \times 7$ board. At the same time, each squidward makes exactly one move. What is the smallest possible number of empty squares after these moves? [center][img]https://i.imgur.com/rqgG95C.png[/img][/center]

There are $30$ cities in the empire of Euleria. Every week, Martingale City runs a very well-known lottery. $900$ visitors decide to take a trip around the empire, visiting a different city each week in some random order. $3$ of these cities are inhabited by mathematicians, who will talk to all visitors about the laws of statistics. A visitor with this knowledge has probability $0$ of buying a lottery ticket, else they have probability $0.5$ of buying one. What is the expected number of visitors who will play the Martingale Lottery?

A $2010\times 2010$ board is divided into corner-shaped figures of three cells. Prove that it is possible to mark one cell in each figure such that each row and each column will have the same number of marked cells. [i]I. Bogdanov & O. Podlipsky[/i]

Kelvin and Quinn are collecting trading cards; there are $6$ distinct cards that could appear in a pack. Each pack contains exactly one card, and each card is equally likely. Kelvin buys packs until he has at least one copy of every card, and then he stops buying packs. If Quinn is missing exactly one card, the probability that Kelvin has at least two copies of the card Quinn is missing is expressible as $\tfrac{m}{n}$ for coprime positive integers $m$ and $n$. Determine $m+n$.