$20$ football teams participate in the championship. What minimal number of the games should be played to provide the property: [i] from the three arbitrary teams we can find at least on pair that have already met in the championship.[/i]

Let $p,q,r$ be distinct prime numbers and let \[A=\{p^aq^br^c\mid 0\le a,b,c\le 5\} \] Find the least $n\in\mathbb{N}$ such that for any $B\subset A$ where $|B|=n$, has elements $x$ and $y$ such that $x$ divides $y$. [i]Ioan Tomescu[/i]

Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20. [i]Proposed by Luxembourg[/i]

Let $A$ and $B$ be two cubes. Numbers $1,2,...,14$, are assigned in any order, to the faces and vertices of cube $A$. Then each edge of cube $A$ is assigned the average of the numbers assigned to the two faces that contain it. Finally assigned to each face of the cube $B$ the sum of the numbers associated with the vertices, the face and the edges on the corresponding face of cube $A$. If $S$ is the sum of the numbers assigned to the faces of $B$, find the largest and smallest value that $S$ can take.

Prove that there exists a positive constant $c$ such that the following statement is true: Consider an integer $n > 1$, and a set $\mathcal S$ of $n$ points in the plane such that the distance between any two different points in $\mathcal S$ is at least 1. It follows that there is a line $\ell$ separating $\mathcal S$ such that the distance from any point of $\mathcal S$ to $\ell$ is at least $cn^{-1/3}$. (A line $\ell$ separates a set of points S if some segment joining two points in $\mathcal S$ crosses $\ell$.) [i]Note. Weaker results with $cn^{-1/3}$ replaced by $cn^{-\alpha}$ may be awarded points depending on the value of the constant $\alpha > 1/3$.[/i] [i]Proposed by Ting-Feng Lin and Hung-Hsun Hans Yu, Taiwan[/i]

Al[u][b]l[/b][/u] edges and all diagonals of regular hexagon $A_1A_2A_3A_4A_5A_6$ are colored blue or red such that each triangle $A_jA_kA_m, 1 \leq j < k < m\leq 6$ has at least one red edge. Let $R_k$ be the number of red segments $A_kA_j, (j \neq k)$. Prove the inequality \[\sum_{k=1}^6 (2R_k-7)^2 \leq 54.\]

The Hawking Space Agency operates $n-1$ space flights between the $n$ habitable planets of the Local Galaxy Cluster. Each flight has a fixed price which is the same in both directions, and we know that using these flights, we can travel from any habitable planet to any habitable planet. In the headquarters of the Agency, there is a clearly visible board on a wall, with a portrait, containing all the pairs of different habitable planets with the total price of the cheapest possible sequence of flights connecting them. Suppose that these prices are precisely $1,2, ... , \binom{n}{2}$ monetary units in some order. prove that $n$ or $n-2$ is a square number.

Determine for which natural numbers $n$ you can cover a $2n \times 2n$ chessboard with non-overlapping $L$ pieces. An $L$ piece covers four spaces and has appearance like the letter $L$. The piece may be rotated and mirrored at will.

For what smallest $n$ can a $n \times n$ square be cut into squares $40 \times 40$ and $49 \times 49$ so that squares of both types are present?

For a fixed $k$ with $4 \le k \le 9$ consider the set of all positive integers with $k$ decimal digits such that each of the digits from $1$ to $k$ occurs exactly once. Show that it is possible to partition this set into two disjoint subsets such that the sum of the cubes of the numbers in the first set is equal to the sum of the cubes in the second set.

A convex polygon in the Cartesian plane has all of its vertices on integer coordinates. One of the sides of the polygon is $AB$ where $A = (0, 0)$ and $B = (51, 51)$, and the interior angles at $A$ and $B$ are both at most $45$ degrees. Assuming no $180$ degree angles, what is the maximum number of vertices this polygon can have?

Given 12 red points on a circle , find the mininum value of $n$ such that there exists $n$ triangles whose vertex are the red points . Satisfies: every chord whose points are the red points is the edge of one of the $n$ triangles .

The numbers $1,2,3,\ldots ,n$ are written in a row. Two players, Maris and Filips, take turns making moves with Maris starting. A move consists of crossing out a number from the row which has not yet been crossed out. The game ends when there are exactly two uncrossed numbers left in the row. If the two remaining uncrossed numbers are coprime, Maris wins, otherwise Filips is the winner. For each positive integer $n\ge 4$ determine which player can guarantee a win.

Let $ n$ be positive integer, $ A,B\subseteq[0,n]$ are sets of integers satisfying $ \mid A\mid \plus{} \mid B\mid\ge n \plus{} 2.$ Prove that there exist $ a\in A, b\in B$ such that $ a \plus{} b$ is a power of $ 2.$

In the class, every talker is friends with at least one silent person. At this chatterbox is silent if there is an odd number of his friends in the office —silent. Prove that the teacher can invite you to an elective class without less than half the class so that all talkers are silent. [hide=original wording]В классе каждый болтун дружит хотя бы с одним молчуном. При этом болтун молчит, если в кабинете находится нечетное число его друзей - молчунов. Докажите, что учительмо жет пригласитьна факультатив не менее половины класса так, чтобы все болтуны молчали[/hide]

Let $n$ be a positive integer. The numbers $1, 2, \dots, 2n+1$ are arranged in a circle in that order, and some of them are [i] marked[/i]. We define, for each $k$ such that $1\leq k \leq 2n+1$ , the interval $I_k$ to be the closed circular interval starting at $k$ and ending in $k+n$ (taking remainders mod(2n+1)). We call in interval [i]magical[/i] if it contains strictly more than half of all the marked elements. Prove that the following two statements are equivalent: 1. At least $n+1$ of the intervals $I_1, I_2, \dots, I_{2n+1}$ are magical 2. The number of marked numbers is odd

Let $n, k \ge 1$ be natural numbers. Find the number $A(n, k)$ of solutions in integers of the equation \[|x_1| + |x_2| +\cdots + |x_k| = n\]

Is it possible to partition the set $A = \{1, 2, 3, ... , 32, 33\}$ into eleven subsets that contain three integers each, such that for every one of these eleven subsets, one of the integers is equal to the sum of the other two? If so, give such a partition, if not, prove that such a partition cannot exist.

On every card of a deck of cards a regular 17-gon is displayed with all sides and diagonals, and the vertices are numbered from 1 through 17. On every card all edges (sides and diagonals) are colored with a color 1,2,...,105 such that the following property holds: for every 15 vertices of the 17-gon the 105 edges connecting these vertices are colored with different colors on at least one of the cards. What is the minimum number of cards in the deck?

You have a $10 \times 10$ grid. A "move" on the grid consists of moving $7$ squares to the right and $3$ squares down. In case of exiting by a line, it continues at the beginning (left) of the same line and in case of ending a column, it continues at the beginning of the same column (above). Where should we start so that after $1996$ moves we end up in a corner?

The sequence $a_1,a_2,\dots$ of integers satisfies the conditions: (i) $1\le a_j\le2015$ for all $j\ge1$, (ii) $k+a_k\neq \ell+a_\ell$ for all $1\le k<\ell$. Prove that there exist two positive integers $b$ and $N$ for which\[\left\vert\sum_{j=m+1}^n(a_j-b)\right\vert\le1007^2\]for all integers $m$ and $n$ such that $n>m\ge N$. [i]Proposed by Ivan Guo and Ross Atkins, Australia[/i]

[b]p1.[/b] Consider a parallelogram $ABCD$ with sides of length $a$ and $b$, where $a \ne b$. The four points of intersection of the bisectors of the interior angles of the parallelogram form a rectangle $EFGH$. A possible configuration is given below. Show that $$\frac{Area(ABCD)}{Area(EFGH)}=\frac{2ab}{(a - b)^2}$$ [img]https://cdn.artofproblemsolving.com/attachments/e/a/afaf345f2ef7c8ecf4388918756f0b56ff20ef.png[/img] [b]p2.[/b] A metal wire of length $4\ell$ inches (where $\ell$ is a positive integer) is used as edges to make a cardboard rectangular box with surface area $32$ square inches and volume $8$ cubic inches. Suppose that the whole wire is used. (i) Find the dimension of the box if $\ell= 9$, i.e., find the length, the width, and the height of the box without distinguishing the different orders of the numbers. Justify your answer. (ii) Show that it is impossible to construct such a box if $\ell = 10$. [b]p3.[/b] A Pythagorean n-tuple is an ordered collection of counting numbers $(x_1, x_2,..., x_{n-1}, x_n)$ satisfying the equation $$x^2_1+ x^2_2+ ...+ x^2_{n-1} = x^2_{n}.$$ For example, $(3, 4, 5)$ is an ordinary Pythagorean $3$-tuple (triple) and $(1, 2, 2, 3)$ is a Pythagorean $4$-tuple. (a) Given a Pythagorean triple $(a, b, c)$ show that the $4$-tuple $(a^2, ab, bc, c^2)$ is Pythagorean. (b) Extending part (a) or using any other method, come up with a procedure that generates Pythagorean $5$-tuples from Pythagorean $3$- and/or $4$-tuples. Few numerical examples will not suffice. You have to find a method that will generate infinitely many such $5$-tuples. (c) Find a procedure to generate Pythagorean $6$-tuples from Pythagorean $3$- and/or $4$- and/or $5$-tuples. Note. You can assume without proof that there are infinitely many Pythagorean triples. [b]p4.[/b] Consider the recursive sequence defined by $x_1 = a$, $x_2 = b$ and $$x_{n+2} =\frac{x_{n+1} + x_n - 1}{x_n - 1}, n \ge 1 .$$ We call the pair $(a, b)$ the seed for this sequence. If both $a$ and $b$ are integers, we will call it an integer seed. (a) Start with the integer seed $(2, 2019)$ and find $x_7$. (b) Show that there are infinitely many integer seeds for which $x_{2020} = 2020$. (c) Show that there are no integer seeds for which $x_{2019} = 2019$. [b]p5.[/b] Suppose there are eight people at a party. Each person has a certain amount of money. The eight people decide to play a game. Let $A_i$, for $i = 1$ to $8$, be the amount of money person $i$ has in his/her pocket at the beginning of the game. A computer picks a person at random. The chosen person is eliminated from the game and their money is put into a pot. Also magically the amount of money in the pockets of the remaining players goes up by the dollar amount in the chosen person's pocket. We continue this process and at the end of the seventh stage emerges a single person and a pot containing $M$ dollars. What is the expected value of $M$? The remaining player gets the pot and the money in his/her pocket. What is the expected value of what he/she takes home? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are 2008 bags numbered from 1 to 2008, with 2008 frogs in each one of them. Two people play in turns. A play consists in selecting a bag and taking out of it any number of frongs (at least one), leaving $ x$ frogs in it ($ x\geq 0$). After each play, from each bag with a number higher than the selected one and having more than $ x$ frogs, some frogs scape until there are $ x$ frogs in the bag. The player that takes out the last frog from bag number 1 looses. Find and explain a winning strategy.

What is the number of ways in which one can choose $60$ unit squares from a $11 \times 11$ chessboard such that no two chosen squares have a side in common?

The wizard Gandalf has a necklace that is shaped like a row of magic pearls. The necklace has $2019$ pearls, $2018$ are black and the last one is white. Everytime that the magician Gandalf touches the necklace, the following occurs: the pearl in position $i$ is move to position $i-1$, for $1 <i <2020$, furthermore the pearl in position $1$ moves to position $2019$. But something else happens, if the pearl in position $1$ now is white, then the last pearl turns white without the need for Gandalf to touch the necklace again. How many times does Gandalf have to touch the necklace to be sure that all pearls are white?