[b]p1.[/b] Replace $*$’s by an arithmetic operations (addition, subtraction, multiplication or division) to obtain true equality $$2*0*1*6*7=1.$$ [b]p2.[/b] The interval of length $88$ cm is divided into three unequal parts. The distance between middle points of the left and right parts is $46$ cm. Find the length of the middle part. [b]p3.[/b] A $5\times 6$ rectangle is drawn on a square grid. Paint some cells of the rectangle in such a way that every $3\times 2$ sub‐rectangle has exactly two cells painted. [b]p4.[/b] There are $8$ similar coins. $5$ of them are counterfeit. A detector can analyze any set of coins and show if there are counterfeit coins in this set. The detector neither determines which coins nare counterfeit nor how many counterfeit coins are there. How to run the detector twice to find for sure at least one counterfeit coin? [b]p5.[/b] There is a set of $20$ weights of masses $1, 2, 3,...$ and $20$ grams. Can one divide this set into three groups of equal total masses? [b]p6.[/b] Replace letters $A,B,C,D,E,F,G$ by the digits $0,1,...,9$ to get true equality $AB+CD=EF * EG$ (different letters correspond to different digits, same letter means the same digit, $AB$, $CD$, $EF$, and $EG$ are two‐digit numbers). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABCD$ be a tetrahedron with $\angle BAD = 60^{\cdot}$, $\angle BAC = 40^{\cdot}$, $\angle ABD = 80^{\cdot}$, $\angle ABC = 70^{\cdot}$. Prove that the lines $AB$ and $CD$ are perpendicular.

In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that [list] [*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and [*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color. [/list]

$ABCD$ is a four digit number ($A\neq0$) such that both $ABC$ and $BCD$ are divisible by $9$ ($ABCD$ is not necessarily divisible by $9$, and $B,C,D$ may be $0$). Compute the number of four digit numbers satisfying this property.

Show that the coefficients of a binomial expansion $(a+b)^n$ where $n$ is a positive integer, are all odd, if and only if $n$ is of the form $2^{k}-1$ for some positive integer $k$.

Let $A$ be a finite set of positive integers. Prove that there exists a finite set $B$ of positive integers such that $A \subset B$ and $$\prod_{x \in B} x =\sum_{x \in B}x^2$$

Given sequence $\{a_n\}$ satisfying: $$ a_{n+1} = \frac{ lcm(a_n,a_{n-1})}{\gcd(a_n, a_{n-1})} $$ It is given that $a_{209} =209$ and $a_{361} = 361$. Find all possible values of $a_{2020}$.

Let $A=(0,0), B=(1,0), C = (-1,0)$, and $D = (-1,1)$. Let $\mathcal C$ be the closed curve given by the segment $AB$, the minor arc of the circle $x^2 + (y-1)^2 = 2$ connecting $B$ to $C$, the segment $CD$, and the minor arc of the circle $x^2 + (y-1)^2=1$ connecting $D$ to $A$. Let $\mathcal D$ be a piece of paper whose boundary is $\mathcal C$. Compute the sum of all integers $2\le n\le 2019$ such that it is possible to cut $\mathcal D$ into $n$ congruent pieces of paper. [i]Proposed by Vincent Huang[/i]

A group of clerks is assigned the task of sorting $1775$ files. Each clerk sorts at a constant rate of $30$ files per hour. At the end of the first hour, some of the clerks are reassigned to another task; at the end of the second hour, the same number of the remaining clerks are also reassigned to another task, and a similar reassignment occurs at the end of the third hour. The group finishes the sorting in $3$ hours and $10$ minutes. Find the number of files sorted during the first one and a half hours of sorting.

Given triangle $ABC$, squares $ABEF, BCGH, CAIJ$ are constructed externally on side $AB, BC, CA$, respectively. Let $AH \cap BJ = P_1$, $BJ \cap CF = Q_1$, $CF \cap AH = R_1$, $AG \cap CE = P_2$, $BI \cap AG = Q_2$, $CE \cap BI = R_2$. Prove that triangle $P_1 Q_1 R_1$ is congruent to triangle $P_2 Q_2 R_2$.

Let $\mathcal{C}$ be the set of all twice differentiable functions $f:[0,1] \to \mathbb{R}$ with at least two (not necessarily distinct) zeros and $|f''(x)| \le 1,$ for all $x \in [0,1].$ Find the greatest value of the integral $$\int\limits_0^1 |f(x)| \mathrm{d}x$$ when $f$ runs through the set $\mathcal{C},$ as well as the functions that achieve this maximum. [i]Note: A differentiable function $f$ has two zeros in the same point $a$ if $f(a)=f'(a)=0.$[/i]

Rakesh is flipping a fair coin repeatedly. If $T$ denotes the event where the coin lands on tails and $H$ denotes the event where the coin lands on heads, what is the probability Rakesh flips the sequence $HHH$ before the sequence $THH$?

Find all positive integers $n$ for which $n^{n-1} - 1$ is divisible by $2^{2015}$, but not by $2^{2016}$.

The triangle table is constructed according to the rule: You put the natural number $a>1$ in the upper row, and then you write under the number $k$ from the left side $k^2$, and from the right side -- $(k+1)$. For example, if $a = 2$, you get the table on the picture. Prove that all the numbers on each particular line are different. 2 / \ / \ 4 3 / \ / \ 16 5 9 4 / \ / \ /\ / \

Determine all polynomials $a(x)$, $b(x)$, $c(x)$, $d(x)$ with real coefficients satisfying the simultaneous equations \begin{align*} b(x) c(x) + a(x) d(x) & = 0 \\ a(x) c(x) + (1 - x^2) b(x) d(x) & = x + 1. \end{align*}

Every square of $1000 \times 1000$ board is colored black or white. It is known that exists one square $10 \times 10$ such that all squares inside it are black and one square $10 \times 10$ such that all squares inside are white. For every square $K$ $10 \times 10$ we define its power $m(K)$ as an absolute value of difference between number of white and black squares $1 \times 1$ in square $K$. Let $T$ be a square $10 \times 10$ which has minimum power among all squares $10 \times 10$ in this board. Determine maximal possible value of $m(T)$

Find the largest natural number $n$ for which the product of the numbers $n, n+1, n+2, \ldots, n+20$ is divisible by the square of one of them.

$100$ silver coins ordered by weight and $101$ gold coins also ordered by weight are given. All coins have different weights. You are given a balance to compare weights of any two coins. How can you find the “middle” coin (that occupies the $101$-st place in weight among all $201$ coins) using the minimal number of weighings? Find this number and prove that a smaller number of weighings would be insufficient. (A. Andjans, Riga)

Find all functions $f : R \to R$ that satisfies the condition $$f(f(x - y)) = f(x)f(y) - f(x) + f(y) - xy$$ for all real numbers $x, y$.

Let $ABCD$ be an isosceles trapezoid with $AD\parallel BC$ and $BC>AD$ such that the distance between the incenters of $\triangle ABC$ and $\triangle DBC$ is $16$. If the perimeters of $ABCD$ and $ABC$ are $120$ and $114$ respectively, then the area of $ABCD$ can be written as $m\sqrt n,$ where $m$ and $n$ are positive integers with $n$ not divisible by the square of any prime. Find $100m+n$. [i]Proposed by David Altizio and Evan Chen[/i]

In triangle $ABC$, the point $H$ is the orthocenter. A circle centered at point $H$ and with radius $AH$ intersects the lines $AB$ and $AC$ at points $E$ and $D$, respectively. The point $X$ is the symmetric of the point $A$ with respect to the line $BC$ . Prove that $XH$ is the bisector of the angle $DXE$. (Matthew of Kursk)

Consider all $2^{20}$ paths of length $20$ units on the coordinate plane starting from point $(0, 0)$ going only up or right, each one unit at a time. Each such path has a unique [i]bubble space[/i], which is the region of points on the coordinate plane at most one unit away from some point on the path. The average area enclosed by the bubble space of each path, over all $2^{20}$ paths, can be written as $\tfrac{m + n\pi}{p}$ where $m, n, p$ are positive integers and $\gcd(m, n, p) = 1$. Find $m + n + p$.

Find all functions $ f : \mathbb{R} \rightarrow \mathbb{R} $ such that for all reals $ x, y $,$$ f(x^2+f(x+y))=y+xf(x+1) $$

Numbers $ a,b,c$ are such that the equation $ x^3 \plus{} ax^2 \plus{} bx \plus{} c$ has three real roots.Prove that if $ \minus{} 2\leq a \plus{} b \plus{} c\leq 0$,then at least one of these roots belongs to the segment $ [0,2]$

If $n$ is a multiple of $4$, the sum $s=1+2i+3i^2+ ... +(n+1)i^{n}$, where $i=\sqrt{-1}$, equals: $ \textbf{(A)}\ 1+i\qquad\textbf{(B)}\ \frac{1}{2}(n+2) \qquad\textbf{(C)}\ \frac{1}{2}(n+2-ni) \qquad$ $ \textbf{(D)}\ \frac{1}{2}[(n+1)(1-i)+2]\qquad\textbf{(E)}\ \frac{1}{8}(n^2+8-4ni) $