Let's call a pair of positive integers $\overline{a_1a_2\ldots a_k}$ and $\overline{b_1b_2\ldots b_k}$ $k$-similar if all digits $a_1, a_2, \ldots, a_k , b_1 , b_2, \ldots, b_k$ are distinct, and there exist distinct positive integers $m, n$, for which the following equality holds: $$a_1^m + a_2^m + \ldots + a_k^m = b_1^n + b_2^n + \ldots + b_k^n$$ For which largest $k$ do there exist $k$-similar numbers? [i]Proposed by Oleksiy Masalitin[/i]

Let $x,y,z>0 $ and $\sqrt{xyz}=xy+yz+zx$. Prove that$$x+y+z\leq \frac{1}{3}.$$

On a table there are $2013$ cards that have written, each one, a different integer number, from $1$ to $2013$; all the cards face down (you can't see what number they are). It is allowed to select any set of cards and ask if the average of the numbers written on those cards is integer. The answer will be true. a) Find all the numbers that can be determined with certainty by several of these questions. b) We want to divide the cards into groups such that the content of each group is known even though the individual value of each card in the group is not known. (For example, finding a group of $3$ cards that contains $1, 2$, and $3$, without knowing what number each card has.) What is the maximum number of groups that can be obtained?

We color some cells in $10000 \times 10000$ square, such that every $10 \times 10$ square and every $1 \times 100$ line have at least one coloring cell. What minimum number of cells we should color ?

[b]p1.[/b] Alex and Sam have a friend Pat, who is younger than they are. Alex, Sam and Pat all share a birthday. When Pat was born, Alex’s age times Sam’s age was $42$. Now Pat’s age is $33$ and Alex’s age is a prime number. How old is Sam now? Show your work and justify your answer. (All ages are whole numbers.) [b]p2.[/b] Let $ABCD$ be a square with side length $2$. The four sides of $ABCD$ are diameters of four semicircles, each of which lies inside the square. The set of all points which lie on or inside two of these semicircles is a four petaled flower. Find (with proof) the area of this flower. [img]https://cdn.artofproblemsolving.com/attachments/5/5/bc724b9f74c3470434c322020997a533986d33.png[/img] [b]p3.[/b] A prime number is called [i]strongly prime[/i] if every integer obtained by permuting its digits is also prime. For example $113$ is strongly prime, since $113$, $131$, and $311$ are all prime numbers. Prove that there is no strongly prime number such that each of the digits $1, 3, 7$, and $9$ appears at least once in its decimal representation. [b]p4.[/b] Suppose $n$ is a positive integer. Let an be the number of permutations of $1, 2, . . . , n$, where $i$ is not in the $i$-th position, for all $i$ with $1 \le i \le n$. For example $a_3 = 2$, where the two permutations that are counted are $231$, and $312$. Let bn be the number of permutations of $1, 2, . . . , n$, where no $i$ is followed by $i + 1$, for all $i$ with $1 \le i \le n - 1$. For example $b_3 = 3$, where the three permutations that are counted are $132$, $213$, and $321$. For every $n \ge 1$, find (with proof) a simple formula for $\frac{a_{n+1}}{b_n}$. Your formula should not involve summations. Use your formula to evaluate $\frac{a_{2020}}{b_{2019}}$. [b]p5.[/b] Let $n \ge 2$ be an integer and $a_1, a_2, ... , a_n$ be positive real numbers such that $a_1 + a_2 +... + a_n = 1$. Prove that $$\sum^n_{k=1}\frac{a_k}{1 + a_{k+1} - a_{k-1}}\ge 1.$$ (Here $a_0 = a_n$ and $a_{n+1} = a_1$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Maria has a balance scale that can indicate which of its pans is heavier or whether they have equal weight. She also has 4 weights that look the same but have masses of 1001, 1002, 1004 and 1005g. Can Maria determine the mass of each weight in 4 weightings? The weights for a new weighing may be picked when the result of the previous ones is known. [i]The Jury[/i] (For the senior paper) The same question when the left pan of the scale is lighter by 1g than the right one, so the scale indicates equality when the mass on the left pan is heavier by 1g than the mass on the right pan. [i]Alexey Tolpygo[/i]

Consider the set $E = \{1,2,\ldots,2n\}$. Prove that an element $c \in E$ can belong to a subset $A \subset E$, having $n$ elements, and such that any two distinct elements in $A$ do not divide one each other, if and only if \[c > n \left( \frac{2}{3}\right )^{k+1},\] where $k$ is the exponent of $2$ in the factoring of $c$.

Let $D$, $E$, $F$ be points on the sides $BC$, $CA$, $AB$ respectively of a triangle $ABC$ (distinct from the vertices). If the quadrilateral $AFDE$ is cyclic, prove that \[ \frac{ 4 \mathcal A[DEF] }{\mathcal A[ABC] } \leq \left( \frac{EF}{AD} \right)^2 . \] [i]Greece[/i]

Shining tells Prajit a positive integer $n \ge 2025$. Prajit then tries to place n points such that no four points are concyclic and no $3$ points are collinear in Euclidean plane, such that Shining cannot find a group of three points such that their circumcircle contains none of the other remaining points. Is he always able to do so? [i](Prajit Adhikari, Nepal and Shining Sun, USA)[/i]

Let $n!=ab^2$ where $a$ is free from squares. Prove, that for every $\epsilon>0$ for every big enough $n$ it is true, that $$2^{(1-\epsilon)n}<a<2^{(1+\epsilon)n}$$ [i]M. Ivanov[/i]

Three squares $ABB_1B_2,BCC_1C_2,CAA_1A_2$ are constructed in the exterior of a triangle $ABC$. In the exterior of these squares, another three squares $A_1B_2B_3B_4,B_1C_2C_3C_4,C_1A_2A_3A_4$ are constructed. Prove that the area of a triangle with sides $C_3A_4,A_3B_4,B_3C_4$ is $16$ times the area of $\triangle ABC$.

Determine, with proof, all integers $ x$ for which $ x(x\plus{}1)(x\plus{}7)(x\plus{}8)$ is a perfect square.

The space diagonal (interior diagonal) of a cube has length $6$. Find the $\textit{surface area}$ of the cube.

Given an $8 \times 8$ chess board. Each knight is allowed to move between two squares located at opposite vertices of $2 \times 3$ or $3 \times 2$ rectangles. There are four knights that move on the board, evenly start from the same cell $X$ and return to $X$ and then stop. Assume that every square on the chessboard has at least one of these four roosters moving through. Prove that there exists a square $Y$ that is different from $X$ such that it is moved over no less than twice by the same knight or by different knights.

Some numbers from $1$ to $100$ are painted red so that the following two conditions are met: $\bullet$ The number $1 $ is painted red. $\bullet$ If the numbers other than $a$ and $b$ are painted red then no number between $a$ and $b$ divides the number $ab$. What is the maximum number of numbers that can be painted red?

Let $ABC$ be a triangle where $AB > BC$, and $D$ and $E$ be points on sides $AB$ and $AC$ respectively, such that $DE$ and $AC$ are parallel. Consider the circumscribed circumference of triangle $ABC$. A circumference that passes through points $D$ and $E$ is tangent to the arc $AC$ that does not contain $B$ at point $P$. Let $Q$ be the reflection of point $P$ with respect to the perpendicular bisector of $AC$. The segments $BQ$ and $DE$ intersect at $X$. Prove that $AX = XC$.

A city is a point on the plane. Suppose there are $n\geq 2$ cities. Suppose that for each city $X$, there is another city $N(X)$ that is strictly closer to $X$ than all the other cities. The government builds a road connecting each city $X$ and its $N(X)$; no other roads have been built. Suppose we know that, starting from any city, we can reach any other city through a series of road. We call a city $Y$ [i]suburban[/i] if it is $N(X)$ for some city $X$. Show that there are at least $(n-2)/4$ suburban cities. [i]Proposed by usjl.[/i]