Let $ABC$ be a triangle and let $P$ be a point in its interior. Denote by $D$, $E$, $F$ the feet of the perpendiculars from $P$ to the lines $BC$, $CA$, $AB$, respectively. Suppose that \[AP^2 + PD^2 = BP^2 + PE^2 = CP^2 + PF^2.\] Denote by $I_A$, $I_B$, $I_C$ the excenters of the triangle $ABC$. Prove that $P$ is the circumcenter of the triangle $I_AI_BI_C$. [i]Proposed by C.R. Pranesachar, India [/i]

Each of $11$ weights is weighing an integer number of grams. No two weights are equal. It is known that if all these weights or any group of them are placed on a balance then the side with a larger number of weights is always heavier. Prove that at least one weight is heavier than $35$ grams.

Find all pairs of positive integers $(n, k)$ satisfying the equation $$n!+n=n^k.$$

Determine the largest constant $C$ such that $$(x_1 + x_2 + \cdots + x_6)^2 \ge C \cdot (x_1(x_2 + x_3) + x_2(x_3 + x_4) + \cdots + x_6(x_1 + x_2))$$ holds for all real numbers $x_1, x_2, \cdots , x_6$. For this $C$, determine all $x_1, x_2, \cdots x_6$ such that equality holds. (Walther Janous)

Radii of five concentric circles $\omega_0,\omega_1,\omega_2,\omega_3,\omega_4$ form a geometric progression with common ratio $q$ in this order. What is the maximal value of $q$ for which it's possible to draw a broken line $A_0A_1A_2A_3A_4$ consisting of four equal segments such that $A_i$ lies on $\omega_i$ for every $i=\overline{0,4}$? [hide=thanks ]Thanks to the user Vlados021 for translating the problem.[/hide]

Find all pairs of natural numbers $(a,n)$, $a\geq n \geq 2,$ for which $a^n+a-2$ is a power of $2$.

For all real numbers $x$, we denote by $\lfloor x \rfloor$ the largest integer that does not exceed $x$. Find all functions $f$ that are defined on the set of all real numbers, take real values, and satisfy the equality \[f(x + y) = (-1)^{\lfloor y \rfloor} f(x) + (-1)^{\lfloor x \rfloor} f(y)\] for all real numbers $x$ and $y$. [i]Navneel Singhal, India[/i]

From given positive numbers, the following infinite sequence is defined: $a_1$ is the sum of all original numbers, $a_2$ is the sum of the squares of all original numbers, $a_3$ is the sum of the cubes of all original numbers, and so on ($a_k$ is the sum of the $k$-th powers of all original numbers). a) Can it happen that $a_1 > a_2 > a_3 > a_4 > a_5$ and $a_5 < a_6 < a_7 < \ldots$? (4 points) b) Can it happen that $a_1 < a_2 < a_3 < a_4 < a_5$ and $a_5 > a_6 > a_7 > \ldots$? (4 points) [i](Alexey Tolpygo)[/i]

Let $a_{1}={11}^{11}$, $a_{2}={12}^{12}$, $a_{3}={13}^{13}$, and \[a_{n}= \vert a_{n-1}-a_{n-2}\vert+\vert a_{n-2}-a_{n-3}\vert, n \ge 4.\] Determine $a_{{14}^{14}}$.

Find all pairs of positive integers $a, b$ such that $\sqrt{a+2\sqrt{b}}=\sqrt{a-2\sqrt{b}}+\sqrt{b}$ .

Find all real solutions to the equation \[| | | | | | |x^2 -x - 1| - 3| - 5| - 7| - 9| - 11| - 13| = x^2 - 2x - 48.\]

Misha and Sahsa play a game on a $100\times 100$ chessboard. First, Sasha places $50$ kings on the board, and Misha places a rook, and then they move in turns, as following (Sasha begins): At his move, Sasha moves each of the kings one square in any direction, and Misha can move the rook on the horizontal or vertical any number of squares. The kings cannot be captured or stepped over. Sasha's purpose is to capture the rook, and Misha's is to avoid capture. Is there a winning strategy available for Sasha?

The number $2020$ has three different prime factors. What is their sum?

[u]Round 1[/u] [b]p1.[/b] Is it possible to draw some number of diagonals in a convex hexagon so that every diagonal crosses EXACTLY three others in the interior of the hexagon? (Diagonals that touch at one of the corners of the hexagon DO NOT count as crossing.) [b]p2.[/b] A $ 3\times 3$ square grid is filled with positive numbers so that (a) the product of the numbers in every row is $1$, (b) the product of the numbers in every column is $1$, (c) the product of the numbers in any of the four $2\times 2$ squares is $2$. What is the middle number in the grid? Find all possible answers and show that there are no others. [b]p3.[/b] Each letter in $HAGRID$'s name represents a distinct digit between $0$ and $9$. Show that $$HAGRID \times H \times A\times G\times R\times I\times D$$ is divisible by $3$. (For example, if $H=1$, $A=2$, $G=3$, $R = 4$, $I = 5$, $D = 64$, then $HAGRID \times H \times A\times G\times R\times I\times D= 123456\times 1\times2\times3\times4\times5\times 6$). [b]p4.[/b] You walk into a room and find five boxes sitting on a table. Each box contains some number of coins, and you can see how many coins are in each box. In the corner of the room, there is a large pile of coins. You can take two coins at a time from the pile and place them in different boxes. If you can add coins to boxes in this way as many times as you like, can you guarantee that each box on the table will eventually contain the same number of coins? [b]p5.[/b] Alex, Bob and Chad are playing a table tennis tournament. During each game, two boys are playing each other and one is resting. In the next game the boy who lost a game goes to rest, and the boy who was resting plays the winner. By the end of tournament, Alex played a total of $10$ games, Bob played $15$ games, and Chad played $17$ games. Who lost the second game? [u]Round 2[/u] [b]p6.[/b] After going for a swim in his vault of gold coins, Scrooge McDuck decides he wants to try to arrange some of his gold coins on a table so that every coin he places on the table touches exactly three others. Can he possibly do this? You need to justify your answer. (Assume the gold coins are circular, and that they all have the same size. Coins must be laid at on the table, and no two of them can overlap.) [b]p7.[/b] You have a deck of $50$ cards, each of which is labeled with a number between $1$ and $25$. In the deck, there are exactly two cards with each label. The cards are shuffled and dealt to $25$ students who are sitting at a round table, and each student receives two cards. The students will now play a game. On every move of the game, each student takes the card with the smaller number out of his or her hand and passes it to the person on his/her right. Each student makes this move at the same time so that everyone always has exactly two cards. The game continues until some student has a pair of cards with the same number. Show that this game will eventually end. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Positive real numbers $x$ and $y$ satisfy $$\Biggl|\biggl|\cdots\Bigl|\bigl||x|-y\bigr|-x\Bigr|\cdots -y\biggr|-x\Biggr|\ =\ \Biggl|\biggl|\cdots\Bigl|\bigl||y|-x\bigr|-y\Bigr|\cdots -x\biggr|-y\Biggr|$$ where there are $2019$ absolute value signs $|\cdot|$ on each side. Determine, with proof, all possible values of $\frac{x}{y}$. [i]Proposed by Krit Boonsiriseth.[/i]

Let $ABC$ be an acute triangle with $AB<AC$ and $\angle BAC=60^{\circ}$. Denote its altitudes by $AD,BE,CF$ and its orthocenter by $H$. Let $K,L,M$ be the midpoints of sides $BC,CA,AB$, respectively. Prove that the midpoints of segments $AH, DK, EL, FM$ lie on a single circle.

For all positive integer $ n\geq 2$, prove that product of all prime numbers less or equal than $ n$ is smaller than $ 4^{n}$.

Prove that for any natural numbers $a,b,c$ and $d$ there exist infinetly natural numbers $n$ such that $a^n+b^n+c^n+d^n$ is composite.

Let $\mathcal{S}$ be the set of all perfect squares whose rightmost three digits in base $10$ are $256$. Let $\mathcal{T}$ be the set of all numbers of the form $\frac{x-256}{1000}$, where $x$ is in $\mathcal{S}$. In other words, $\mathcal{T}$ is the set of numbers that result when the last three digits of each number in $\mathcal{S}$ are truncated. Find the remainder when the tenth smallest element of $\mathcal{T}$ is divided by $1000$.

Prove that there are infinitely many twin primes if and only if there are infinitely many integers that cannot be written in any of the following forms: \[6uv+u+v, \;\; 6uv+u-v, \;\; 6uv-u+v, \;\; 6uv-u-v,\] for some positive integers $u$ and $v$.

Convex pentagon $PQRST$ has $PQ = T P = 5$, $QR = RS = ST = 6$, and $\angle QRS = \angle RST = 90^o$. Given that points $U$ and $V$ exist such that $RU =UV = VS = 2$, find the area of pentagon $PQUVT$ . [i]Proposed by Kira Tang[/i]

If $a,b,c$ are sides of right triangle with $c$ hypothenuse then show that for every positive integer $n>2$ we have $c^n>a^n+b^n$ .

Noah has 8 species of animals to fit into 4 cages of the ark. He plans to put species in each cage. It turns out that, for each species, there are at most 3 other species with which it cannot share the accomodation. Prove that there is a way to assign the animals to their cages so that each species shares with compatible species.

Let $ABC$ be a triangle, and let $P$ be the midpoint of $AC$. A circle intersects $AP, CP, BC, AB$ sequentially at their inner points $K, L, M, N$. Let $S$ be the midpoint of $KL$. Let also $2 \cdot | AN |\cdot |AB |\cdot |CL | = 2 \cdot | CM | \cdot| BC | \cdot| AK| = | AC | \cdot| AK |\cdot |CL |.$ Prove that if $P\ne S$, then the intersection of $KN$ and $ML$ lies on the perpendicular bisector of the $PS$. (Jan Mazák)

In a game of Shipbattle, Willis secretly places his aircraft carrier somewhere in a $9 \times 9$ grid, represented by five consecutive squares. Two example positions are shown below. [asy] size(5cm); fill((2,7)--(7,7)--(7,8)--(2,8)--cycle); fill((5,1)--(6,1)--(6,6)--(5,6)--cycle); for (int i = 0; i <= 9; ++i) { draw((i,0)--(i,9)); draw((0,i)--(9,i)); } [/asy] Phyllis then takes shots at the grid, one square at a time, trying to hit Willis's aircraft carrier. What is the minimum number of shots that Phyllis must take to ensure that she hits the aircraft carrier at least once?