Thirty numbers are placed on a circle. For every number $A$ we have: $A$ equals the absolute value of $(B- C)$, where $B$ and $C$ follow $A$ clockwise. The total sum of the numbers equals $1$. Find all the numbers. (Folklore)

A whole number is written on each square of a board of $2019\times 2021$ squares. If the number written in each square is equal to the arithmetic mean of the numbers written in two of its neighboring squares, how many different numbers written on the blackboard can there be at most? Note: Two squares on the board are neighbors when they have a common side.

Alice and Bob play a game. There are $100$ gold coins, $100$ silver coins, and $100$ bronze coins. Players take turns to take at least one coin, but they cannot take two or more coins of same kind at once. Alice goes first. The player who cannot take any coin loses. Who has a winning strategy?

Some pairs of cities in the country are connected by airlines, and some are not. But every city has an airport, from which you can get to any other city, making no more than one transfer. A tourist who wants to make a round trip through several cities of the country will have to fly around at least five cities. Prove that the same number of airlines depart from each city of the country (If there is an airline from one city to another, then there is also one from the second to the first. A circular trip is a route that passes through at least three cities, starting and ending in same city, other cities are not repeated in it)

Given a square side $1$ and $2n$ positive reals $a_1, b_1, ... , a_n, b_n$ each $\le 1$ and satisfying $\sum a_ib_i \ge 100$. Show that the square can be covered with rectangles $R_i$ with sides length $(a_i, b_i)$ parallel to the square sides.

Let $P$ be a $2019-$gon, such that no three of its diagonals concur at an internal point. We will call each internal intersection point of diagonals of $P$ a knot. What is the greatest number of knots one can choose, such that there doesn't exist a cycle of chosen knots? ( Every two adjacent knots in a cycle must be on the same diagonal and on every diagonal there are at most two knots from a cycle.)

Let $f:X\rightarrow X$, where $X=\{1,2,\ldots ,100\}$, be a function satisfying: 1) $f(x)\neq x$ for all $x=1,2,\ldots,100$; 2) for any subset $A$ of $X$ such that $|A|=40$, we have $A\cap f(A)\neq\emptyset$. Find the minimum $k$ such that for any such function $f$, there exist a subset $B$ of $X$, where $|B|=k$, such that $B\cup f(B)=X$.

[b]p1.[/b] Find all solutions $a, b, c, d, e, f$ if it is known that they represent distinct digits and satisfy the following: $\begin{tabular}{ccccc} & a & b & c & a \\ + & & d & d & e \\ & & & d & e \\ \hline d & f & f & d & d \\ \end{tabular}$ [b]p2.[/b] Snowhite wrote on a piece of paper a whole number greater than $1$ and multiplied it by itself. She obtained a number, all digits of which are $1$: $n^2 = 111...111$ Does she know how to multiply? [b]p3.[/b] Two players play the following game on an $8\times 8$ chessboard. The first player can put a bishop on an arbitrary square. Then the second player can put another bishop on a free square that is not controlled by the first bishop. Then the first player can put a new bishop on a free square that is not controlled by the bishops on the board. Then the second player can do the same, etc. A player who cannot put a new bishop on the board loses the game. Who has a winning strategy? [b]p4.[/b] Four girls Marry, Jill, Ann and Susan participated in the concert. They sang songs. Every song was performed by three girls. Mary sang $8$ songs, more then anybody. Susan sang $5$ songs less then all other girls. How many songs were performed at the concert? [b]p5.[/b] Pinocchio has a $10\times 10$ table of numbers. He took the sums of the numbers in each row and each such sum was positive. Then he took the sum of the numbers in each columns and each such sum was negative. Can you trust Pinocchio's calculations? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Some squares of a $1999\times 1999$ board are occupied with pawns. Find the smallest number of pawns for which it is possible that for each empty square, the total number of pawns in the row or column of that square is at least $1999$.

Let $m,n$ be positive integers with $1 \le n < m$. A box is locked with several padlocks which must all be opened to open the box, and which all have different keys. The keys are distributed among $m$ people. Suppose that among these people, no $n$ can open the box, but any $n+1$ can open it. Find the smallest possible number $l$ of locks and then the total number of keys for which this is possible.

A $ 3 \times n$ grid is filled as follows. The first row consists of the numbers from $ 1$ to $ n$ arranged in ascending order. The second row is a cyclic shift of the top row: $ i,i\plus{}1,...,n,1,2,...,i\minus{}1$ for some $ i$. The third row has the numbers $ 1$ to $ n$ in some order so that in each of the $ n$ columns, the sum of the three numbers is the same. For which values of $ n$ is it possible to fill the grid in this way? For all such $ n$, determine the number of different ways of filling the grid.

Let $n$ to be a positive integer. A family $\wp$ of intervals $[i, j]$ with $0 \le i < j \le n$ and $i$, $j$ integers is considered [i]happy[/i] if, for any $I_1 = [i_1, j_1] \in \wp$ and $I_2 = [i_2, j_2] \in \wp$ such that $I_1 \subset I_2$, we have $i_1 = i_2$ [b]or[/b] $j_1 = j_2$. Determine the maximum number of elements of a [i]happy[/i] family.

Michael and James are playing a game where they alternate throwing darts at a simplified dartboard. Each dart throw is worth either 25 points or 50 points. They track the sequence of scores per throw (which is shared between them), and on the first time the three most recent scores sum to 125, the person who threw the last dart wins. On each throw, a given player has a $2/3$ chance of getting the score they aim for, and a $1/3$ chance of getting the other score. Suppose Michael goes first, and the first two throws are both 25. If both players use an optimal strategy, what is the probability Michael wins? [i]Proposed by Michael Duncan[/i]

The inhabitants of a planet speak a language only using the letters $A$ and $O$. To avoid mistakes, any two words of equal length differ at least on three positions. Show that there are not more than $\frac{2^n}{n+1}$ words with $n$ letters.

Consider a set $X$ with $|X| = n\geq 1$ elements. A family $\mathcal{F}$ of distinct subsets of $X$ is said to have property $\mathcal{P}$ if there exist $A,B \in \mathcal{F}$ so that $A\subset B$ and $|B\setminus A| = 1$. i) Determine the least value $m$, so that any family $\mathcal{F}$ with $|\mathcal{F}| > m$ has property $\mathcal{P}$. ii) Describe all families $\mathcal{F}$ with $|\mathcal{F}| = m$, and not having property $\mathcal{P}$. ([i]Dan Schwarz[/i])

The identifier of a book is an n-tuple of numbers 0, 1, .... , 9, followed by a checksum. The checksum is computed by a fixed rule that satisfies the following property: whenever one increases a single number in the n-tuple (without modifying the other numbers), the checksum also increases. Find the smallest possible number of required checksums if all possible n-tuples are in use.

Prove that in every convex hexagon of area $S$ one can draw a diagonal that cuts off a triangle of area not exceeding $\frac{1}{6}S.$

Let $n$ be positive integer. Given is a grid $nxn$. Some cells of the grid are colored in green, so that no two green squares share a common side. Is it possible, however the green cells are colored, to place $n$ rooks, so that none of the rooks is on green cell, and no two rooks attack each other, if a) n=19 b) n=20

In a football league, there are $n\geq 6$ teams. Each team has a homecourt jersey and a road jersey with different color. When two teams play, the home team always wear homecourt jersey and the road team wear their homecourt jersey if the color is different from the home team's homecourt jersey, or otherwise the road team shall wear their road jersey. It is required that in any two games with 4 different teams, the 4 teams' jerseys have at least 3 different color. Find the least number of color that the $n$ teams' $2n$ jerseys may use.

A $2015\times2015$ chessboard is given, the cells of which are painted white and black alternatively so that the corner cells are black. There are $n{}$ [url=https://i.stack.imgur.com/V1kdh.png]L-trominoes[/url] placed on the board, no two of which overlap and which cover all of the black cells. Find the smallest possible value of $n{}$.

A badminton club consists of $2n$ members who are n couples. The club plans to arrange a round of mixed doubles matches where spouses neither play together nor against each other. Requirements are: $\cdot$ Each pair of members of the same gender meets exactly once as opponents in a mixed doubles match. $\cdot$ Any two members of the opposite gender who are not spouses meet exactly once as partners and also as opponents in a mixed doubles match. Given that $(n,6)=1$, can you arrange a round of mixed doubles matches that meets the above specifications and requirements?

The integers $ 1,2,\dots,20$ are written on the blackboard. Consider the following operation as one step: [i]choose two integers $ a$ and $ b$ such that $ a\minus{}b \ge 2$ and replace them with $ a\minus{}1$ and $ b\plus{}1$[/i]. Please, determine the maximum number of steps that can be done. [i]Yudi Satria, Jakarta[/i]

Nonnegative real numbers $p_{1},\ldots,p_{n}$ and $q_{1},\ldots,q_{n}$ are such that $p_{1}+\cdots+p_{n}=q_{1}+\cdots+q_{n}$ Among all the matrices with nonnegative entries having $p_i$ as sum of the $i$-th row's entries and $q_j$ as sum of the $j$-th column's entries, find the maximum sum of the entries on the main diagonal.

Given a finite graph $G$, let $f(G)$ be the number of triangles in graph $G$, $g(G)$ be the number of edges in graph $G$, find the minimum constant $c$, so that for each graph $G$, there is $f^ 2(G)\le c \cdot g^3(G)$.

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?