Ari and Beri play a game using a deck of $2020$ cards with exactly one card with each number from $1$ to $2020$. Ari gets a card with a number $a$ and removes it from the deck. Beri sees the card, chooses another card from the deck with a number $b$ and removes it from the deck. Then Beri writes on the board exactly one of the trinomials $x^2-ax+b$ or $x^2-bx+a$ from his choice. This process continues until no cards are left on the deck. If at the end of the game every trinomial written on the board has integer solutions, Beri wins. Otherwise, Ari wins. Prove that Beri can always win, no matter how Ari plays.

We will designate by $Z_{(5)}$ a certain subset of the set $Q$ of the rational numbers . A rational belongs to $Z_{(5)}$ if and only if there exist equal fraction to this rational such that $5$ is not a divisor of its denominator. (For example, the rational number $13/10$ does not belong to $Z_{(5)}$ , since the denominator of all fractions equal to $13/10$ is a multiple of $5$. On the other hand, the rational $75/10$ belongs to $Z_{(5)}$ since that $75/10 = 15/12$). Reasonably answer the following questions: a) What algebraic structure (semigroup, group, etc.) does $Z_{(5)}$ have with respect to the sum? b) And regarding the product? c) Is $Z_{(5)}$ a subring of $Q$? d) Is $Z_{(5)}$ a vector space?

$n^2$ real numbers are written in a square $n \times n$ table so that the sum of the numbers in each row and column equals zero. A move is to add a row to one column and subtract it from another (so if the entries are $a_{ij}$ and we select row $i$, column $h$ and column $k$, then column h becomes $a_{1h} + a_{i1}, a_{2h} + a_{i2}, ... , a_{nh} + a_{in}$, column $k$ becomes $a_{1k} - a_{i1}, a_{2k} - a_{i2}, ... , a_{nk} - a_{in}$, and the other entries are unchanged). Show that we can make all the entries zero by a series of moves.

A positive integer $k$ is called [i]powerful [/i] if there are distinct positive integers $p, q, r, s, t$ such that $p^2$, $q^3$, $r^5$, $s^7$, $t^{11}$ all divide k. Find the smallest powerful integer.

Let $a_n, b_n$ be sequences of positive reals such that,$$a_{n+1}= a_n + \frac{1}{2b_n}$$ $$b_{n+1}= b_n + \frac{1}{2a_n}$$ for all $n\in\mathbb N$. Prove that, $\text{max}\left(a_{2018}, b_{2018}\right) >44$.

Find the number of positive integers $k \le 2018$ for which there exist integers $m$ and $n$ so that $k = 2^m + 2^n$. For example, $64 = 2^5 + 2^5$, $65 = 2^0 + 2^6$, and $66 = 2^1 + 2^6$.

Find all positive integers $a, b,c,d$ such that $a + b + c + d - 3 = ab + cd$.

On the sides $BC$ and $CD$ of the square $ABCD$ of side $1$, are chosen the points $E$, respectively $F$, so that $<$ $EAB$ $=$ $20$ If $<$ $EAF$ $=$ $45$, calculate the distance from point $A$ to the line $EF$.

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]

Two right cones each have base radius 4 and height 3, such that the apex of each cone is the center of the base of the other cone. Find the surface area of the union of the cones.

Let $\alpha = \cos^{-1} \left( \frac35 \right)$ and $\beta = \sin^{-1} \left( \frac35 \right) $. $$\sum_{n=0}^{\infty}\sum_{m=0}^{\infty} \frac{\cos(\alpha n +\beta m)}{2^n3^m}$$ can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A +B$.

A billiards table is in the figure of regular hexagon $ABCDEF$. $P$ is the midpoint of $AB$. We shut the ball at $P$, then it touches $Q$ on side $BC$, then it touches side $CD,DE,EF,FA$. Finally, the ball touches side $AB$ again. Let $\theta=\angle BPQ$, find the value range of $\theta$.

Solve the equation in postive integers $$x^2+y^2+1998=1997x-1999y.$$

In how many different ways can 900 be expressed as the product of two (possibly equal) positive integers? Regard $m \cdot n$ and $n \cdot m$ as the same product.

Let $P(x)$ be a polynomial with integer coefficient such that $P(1) = 10$ and $P(-1) = 22$. (a) Give an example of $P(x)$ such that $P(x) = 0$ has an integer root. (b) Suppose that $P(0) = 4$, prove that $P(x) = 0$ does not have an integer root.

Every day from day 2, neighboring cubes (cubes with common faces) to red cubes also turn red and are numbered with the day number.

Let $\triangle MAB$ be a triangle with circumcenter $O$. $P$ and $Q$ lie on line $AB$ (both interior or exterior) such that $\angle PMA = \angle BMQ$. Let $D$ be a point on the perpendicular line through $M$ to $AB$. $E$ is the second intersection of the two circles $(DAB)$ and $(DPQ)$. The line $MO$ intersects $AB$ at $J$. Show that the circumcenter of $\triangle EMJ$ lies on line $AB$. [i](Proposed by Tan Rui Xuen)[/i]

Let $a, b, c$ be complex numbers such that $a+b+c = 1$, $a^2+b^2+c^2 = 2$ and $a^3+b^3+c^3 = 3$. Find the value of $a^4 + b^4 + c^4$.

Show that if $\lambda > \frac{1}{2}$ there does not exist a real-valued function $u(x)$ such that for all $x$ in the closed interval $[0,1]$ the following holds: $$u(x)= 1+ \lambda \int_{x}^{1} u(y) u(y-x) \; dy.$$

Initially, a natural number $n$ is written on the blackboard. Then, at each minute, Esmeralda chooses a divisor $d>1$ of $n$, erases $n$, and writes $n+d$. If the initial number on the board is $2022$, what is the largest composite number that Esmeralda will never be able to write on the blackboard?

Real numbers $b>a>0$ are given. Find the number $r$ in $[a,b]$ which minimizes the value of $\max\left\{\left|\frac{r-x}x\right||a\le x\le b\right\}$.

Write a positive integer in each box so that: All six numbers are different. The sum of the six numbers is $100$. If each number is multiplied by its neighbor (in a clockwise direction) and the six results of those six multiplications are added, the smallest possible value is obtained. Explain why a lower value cannot be obtained. [img]https://cdn.artofproblemsolving.com/attachments/7/1/6fdadd6618f91aa03cdd6720cc2d6ee296f82b.gif[/img]

Aumann, Bill, and Charlie each roll a fair $6$-sided die with sides labeled $1$ through $6$ and look at their individual rolls. Each flips a fair coin and, depending on the outcome, looks at the roll of either the player to his right or the player to his left, without anyone else knowing which die he observed. Then, at the same time, each of the three players states the expected value of the sum of the rolls based on the information he has. After hearing what everyone said, the three players again state the expected value of the sum of the rolls based on the information they have. Then, for the third time, after hearing what everyone said, the three players again state the expected value of the sum of the rolls based on the information they have. Prove that Aumann, Bill, and Charlie say the same number the third time.

Call a super-integer an infinite sequence of decimal digits: $\ldots d_n \ldots d_2d_1$. (Formally speaking, it is the sequence $(d_1,d_2d_1,d_3d_2d_1,\ldots)$ ) Given two such super-integers $\ldots c_n \ldots c_2c_1$ and $\ldots d_n \ldots d_2d_1$, their product $\ldots p_n \ldots p_2p_1$ is formed by taking $p_n \ldots p_2p_1$ to be the last n digits of the product $c_n \ldots c_2c_1$ and $d_n \ldots d_2d_1$. Can we find two non-zero super-integers with zero product? (a zero super-integer has all its digits zero)

It is possible to place the $2014$ points in the plane so that we can construct $1006^2$ parralelograms with vertices among these points, so that the parralelograms have area 1?