The rectangular table has four rows. The first one contains arbitrary natural numbers (some of them may be equal). The consecutive lines are filled according to the rule: we look through the previous row from left to the certain number $n$ and write the number $k$ if $n$ was met $k$ times. Prove that the second row coincides with the fourth one.

Points on a spherical surface with radius $4$ are colored in $4$ different colors. Prove that there exist two points with the same color such that the distance between them is either $4\sqrt{3}$ or $2\sqrt{6}$. (Distance is Euclidean, that is, the length of the straight segment between the points)

Let \( A \) be a set of 2025 positive real numbers. For a subset \( T \subseteq A \), define \( M_T \) as the median of \( T \) when all elements of \( T \) are arranged in increasing order, with the convention that \( M_\emptyset = 0 \). Define \[ P(A) = \sum_{\substack{T \subseteq A \\ |T| \text{ odd}}} M_T, \quad Q(A) = \sum_{\substack{T \subseteq A \\ |T| \text{ even}}} M_T. \] Find the smallest real number \( C \) such that for any set \( A \) of 2025 positive real numbers, the following inequality holds: \[ P(A) - Q(A) \leq C \cdot \max(A), \] where \(\max(A)\) denotes the largest element in \( A \).

In each square of a $4\times 4$ board, we are to write an integer in such a way that the sums of the numbers in each column and in each row are nonnegative integral powers of $2$. Is it possible to do this in such a way that every two of these eight sums are different? Justify your answer.

Alice and Bob play a game on a connected graph with $2n$ vertices, where $n\in \mathbb{N}$ and $n>1$.. Alice and Bob have tokens named A and B respectively. They alternate their turns with Alice going first. Alice gets to decide the starting positions of A and B. Every move, the player with the turn moves their token to an adjacent vertex. Bob's goal is to catch Alice, and Alice's goal is to prevent this. Note that positions of A, B are visible to both Alice and Bob at every moment. Provided they both play optimally, what is the maximum possible number of edges in the graph if Alice is able to evade Bob indefinitely? [i]Proposed by Shashank Ingalagavi and Vighnesh Sangle[/i]

An island has $10$ cities, where some of the possible pairs of cities are connected by roads. A [i]tour route[/i] is a route starting from a city, passing exactly eight out of the other nine cities exactly once each, and returning to the starting city. (In other words, it is a loop that passes only nine cities instead of all ten cities.) For each city, there exists a tour route that doesn't pass the given city. Find the minimum number of roads on the island.

There are several coins in a row, and the [i]allowed move[/i] is to remove exactly one coin from the row, which can either be the first or the last. In the initial distribution, there are $n$ coins with not necessarily equal values. Ana and María alternate turns. Ana starts, making two moves, then María makes one move, then Ana makes two moves, and so on until no coins remain: Ana makes two moves and María makes one. (Only in the last move can Ana take one coin if only one coin is left.) Ana's goal is to ensure she takes at least $\dfrac{2}{3}$ of the total value of the coins. Determine if Ana can achieve her goal with certainty if [list=a] [*]$n=2013$ [*]$n=2014$ [/list] If the answer is yes, provide a strategy to achieve it; if the answer is no, give a specific sequence of coins and explain how María prevents Ana from achieving her goal.

In the governor elections, there were three candidates: $A$, $B$, and $C$. In the first round, $A$ received $44\%$ of the votes that were cast between $B$ and $C$. No candidate obtained the majority needed to win in the first round, and $C$ was the one who received the least votes of the three, so there was a runoff between $A$ and $B$. The voters for the runoff were the same as in the first round, except for $p\%$ of those who voted for $C$, who chose not to participate in the runoff; $p$ is an integer, $1 \leqslant p \leqslant 100$. It is also known that all those who voted for $B$ in the first round also voted for him again in the runoff, but it is unknown what those who voted for $A$ in the first round did. A journalist claims that, knowing all this, one can infer with certainty who will win the runoff. Determine for which values of $p$ the journalist is telling the truth. [b]Note:[/b] The winner of the runoff is the one who receives more than half of the total votes cast in the runoff.

Consider a $5\times 5$ grid with $25$ cells. What is the least number of cells that should be colored, such that every $2\times 3$ or $3\times 2$ rectangle in the grid has at least two colored cells?

Sergio thinks of a positive integer $S$, less than or equal to $100$. Iván must guess the number that Sergio thought of, using the following procedure: in each step, he chooses two positive integers $A$ and $B$ less than $100$, and asks Sergio what is the greatest common factor between $A+ S$ and $B$. Give a sequence of seven steps that ensures Iván guesses the number $S$ that Sergio thought of. Clarification:In each step, Sergio correctly answers Iván's question.

Is it possible to cover a circle of area $1$ with finitely many equilateral triangles whose areas sum to $1.01$, all pointing in the same direction? [i]Proposed by Ethan Tan[/i]

[u]Round 5[/u] [b]p13.[/b] A $2016 \times 2016$ chess board is cut into $k \ge 1$ rectangle(s) with positive integer sidelengths. Let $p$ be the sum of the perimeters of all $k$ rectangles. Additionally, let $m$ and $M$ be the minimum and maximum possible value of $\frac{p}{k}$, respectively. Determine the ordered pair $(m,M)$. [b]p14.[/b] For nonnegative integers $n$, let $f (n)$ be the product of the digits of $n$. Compute $\sum^{1000}_{i=1}f (i )$. [b]p15.[/b] How many ordered pairs of positive integers $(m,n)$ have the property that $mn$ divides $2016$? [u]Round 6[/u] [b]p16.[/b] Let $a,b,c$ be distinct integers such that $a +b +c = 0$. Find the minimum possible positive value of $|a^3 +b^3 +c^3|$. [b]p17.[/b] Find the greatest positive integer $k$ such that $11^k -2^k$ is a perfect square. [b]p18.[/b] Find all ordered triples $(a,b,c)$ with $a \le b \le c$ of nonnegative integers such that $2a +2b +2c = ab +bc +ca$. [u]Round 7[/u] [b]p19.[/b] Let $f :N \to N$ be a function such that $f ( f (n))+ f (n +1) = n +2$ for all positive integers $n$. Find $f (20)+ f (16)$. [b]p20.[/b] Let $\vartriangle ABC$ be a triangle with area $10$ and $BC = 10$. Find the minimum possible value of $AB \cdot AC$. [b]p21.[/b] Let $\vartriangle ABC$ be a triangle with sidelengths $AB = 19$, $BC = 24$, $C A = 23$. Let $D$ be a point on minor arc $BC$ of the circumcircle of $\vartriangle ABC$ such that $DB =DC$. A circle with center $D$ that passes through $B$ and $C$ interests $AC$ again at a point $E \ne C$. Find the length of $AE$. [u]Round 8[/u] [b]p22.[/b] Let $m =\frac12 \sqrt{2+\sqrt{2+... \sqrt2}}$, where there are $2014$ square roots. Let $f_1(x) =2x^2 -1$ and let $f_n(x) = f_1( f_{n-1}(x))$. Find $f_{2015}(m)$. [b]p23.[/b] How many ordered triples of integers $(a,b,c)$ are there such that $0 < c \le b \le a \le 2016$, and $a +b-c = 2016$? [b]p24.[/b] In cyclic quadrilateral $ABCD$, $\angle B AD = 120^o$,$\angle ABC = 150^o$,$CD = 8$ and the area of $ABCD$ is $6\sqrt3$. Find the perimeter of $ABCD$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3158461p28714996]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3162282p28763571]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Sasha wants to bake $6$ cookies in his $8$ inch $\times$ $8$ inch square baking sheet. With a cookie cutter, he cuts out from the dough six circular shapes, each exactly $3$ inches in diameter. Can he place these six dough shapes on the baking sheet without the shapes touching each other? If yes, show us how. If no, explain why not. (Assume that the dough does not expand during baking.)

Determine the sets $S{}$ of positive integers satisfying the following two conditions: [list=a] [*]For any positive integers $a, b, c{}$, if $ab + bc + ca{}$ is in $S$, then so are $a + b + c{}$ and $abc$; and [*]The set $S{}$ contains an integer $N \geqslant 160$ such that $N-2$ is not divisible by $4$. [/list] [i]Bogdan Blaga, United Kingdom[/i]

On a circle are arranged $100$ baskets, each containing at least one candy. The total number of candies is $780$. Asad and Sevinch make moves alternatingly, with Asad going first. On one move, Asad takes all the candies from $9$ consecutive non-empty baskets, while Sevinch takes all the candies from a single non-empty basket that has at least one empty neighboring basket. Prove that Asad can take overall at least $700$ candies, regardless of the initial distribution of candies and Sevinch's actions. [i] Shubin Yakov, Russia [/i]

Find the maximum number of rectangles with sides equal to 1 and 2 and parallel to the coordinate axes such that each two have an area equal to 1 in common.

In a given community of people, each person has at least two friends within the community. Whenever some people from this community sit on a round table such that each adjacent pair of people are friends, it happens that no non-adjacent pair of people are friends. Prove that there exist two people in this community such that each has exactly two friends and they have at least one common friend.

Given a set $S=\{1,2,3,\ldots,3n\},(n\in N^*)$, let $T$ be a subset of $S$, such that for any $x, y, z\in T$ (not necessarily distinct) we have $x+y+z\not \in T$. Find the maximum number of elements $T$ can have.

On a straight track are several runners, each running at a different constant speed. They start at one end of the track at the same time. When a runner reaches any end of the track, he immediately turns around and runs back with the same speed (then he reaches the other end and turns back again, and so on). Some time after the start, all runners meet at the same point. Prove that this will happen again.

In a town there are $n$ avenues running from south to north. They are numbered $1$ through $n$ (from west to east). There are $n$ streets running from west to east – they are also numbered $1$ through $n$ (from south to north). If you drive through the junction of the $k$th avenue and the $\ell$th street, you have to pay $k\ell$ kroner. How much do you at least have to pay for driving from the junction of the $1$st avenue and the $1$st street to the junction of the nth avenue and the $n$th street? (You also pay for the starting and finishing junctions.)

[hide=D stands for Dedekind, Z stands for Zermelo]they had two problem sets under those two names[/hide] [b]Z15.[/b] Let $AOB$ be a quarter circle with center $O$ and radius $4$. Let $\omega_1$ and $\omega_2$ be semicircles inside $AOB$ with diameters $OA$ and $OB$, respectively. Find the area of the region within $AOB$ but outside of $\omega_1$ and $\omega_2$. [u]Set 4[/u] [b]Z16.[/b] Integers $a, b, c$ form a geometric sequence with an integer common ratio. If $c = a + 56$, find $b$. [b]Z17 / D24.[/b] In parallelogram $ABCD$, $\angle A \cdot \angle C - \angle B \cdot \angle D = 720^o$ where all angles are in degrees. Find the value of $\angle C$. [b]Z18.[/b] Steven likes arranging his rocks. A mountain formation is where the sequence of rocks to the left of the tallest rock increase in height while the sequence of rocks to the right of the tallest rock decrease in height. If his rocks are $1, 2, . . . , 10$ inches in height, how many mountain formations are possible? For example: the sequences $(1-3-5-6-10-9-8-7-4-2)$ and $(1-2-3-4-5-6-7-8-9-10)$ are considered mountain formations. [b]Z19.[/b] Find the smallest $5$-digit multiple of $11$ whose sum of digits is $15$. [b]Z20.[/b] Two circles, $\omega_1$ and $\omega_2$, have radii of $2$ and $8$, respectively, and are externally tangent at point $P$. Line $\ell$ is tangent to the two circles, intersecting $\omega_1$ at $A$ and $\omega_2$ at $B$. Line $m$ passes through $P$ and is tangent to both circles. If line $m$ intersects line $\ell$ at point $Q$, calculate the length of $P Q$. [u]Set 5[/u] [b]Z21.[/b] Sen picks a random $1$ million digit integer. Each digit of the integer is placed into a list. The probability that the last digit of the integer is strictly greater than twice the median of the digit list is closest to $\frac{1}{a}$, for some integer $a$. What is $a$? [b]Z22.[/b] Let $6$ points be evenly spaced on a circle with center $O$, and let $S$ be a set of $7$ points: the $6$ points on the circle and $O$. How many equilateral polygons (not self-intersecting and not necessarily convex) can be formed using some subset of $S$ as vertices? [b]Z23.[/b] For a positive integer $n$, define $r_n$ recursively as follows: $r_n = r^2_{n-1} + r^2_{n-2} + ... + r^2_0$,where $r_0 = 1$. Find the greatest integer less than $$\frac{r_2}{r^2_1}+\frac{r_3}{r^2_2}+ ...+\frac{r_{2023}}{r^2_{2022}}.$$ [b]Z24.[/b] Arnav starts at $21$ on the number line. Every minute, if he was at $n$, he randomly teleports to $2n^2$, $n^2$, or $\frac{n^2}{4}$ with equal chance. What is the probability that Arnav only ever steps on integers? [b]Z25.[/b] Let $ABCD$ be a rectangle inscribed in circle $\omega$ with $AB = 10$. If $P$ is the intersection of the tangents to $\omega$ at $C$ and $D$, what is the minimum distance from $P$ to $AB$? PS. You should use hide for answers. D.1-15 / Z.1-8 problems have been collected [url=https://artofproblemsolving.com/community/c3h2916240p26045561]here [/url]and D.16-30/Z.9-14, 17, 26-30 [url=https://artofproblemsolving.com/community/c3h2916250p26045695]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ S \equal{} \{x_1, x_2, \ldots, x_{k \plus{} l}\}$ be a $ (k \plus{} l)$-element set of real numbers contained in the interval $ [0, 1]$; $ k$ and $ l$ are positive integers. A $ k$-element subset $ A\subset S$ is called [i]nice[/i] if \[ \left |\frac {1}{k}\sum_{x_i\in A} x_i \minus{} \frac {1}{l}\sum_{x_j\in S\setminus A} x_j\right |\le \frac {k \plus{} l}{2kl}\] Prove that the number of nice subsets is at least $ \dfrac{2}{k \plus{} l}\dbinom{k \plus{} l}{k}$. [i]Proposed by Andrey Badzyan, Russia[/i]

Find the digits left and right of the decimal point in the decimal form of the number \[ (\sqrt{2} + \sqrt{3})^{1980}. \]

Determine whether there exist a positive integer $n<10^9$, such that $n$ can be expressed as a sum of three squares of positive integers by more than $1000$ distinct ways?

We are given more than $2^k$ integers, where $k\in\mathbb{N}$. Prove that we can choose $k+2$ of them such that if some of our selected numbers satisfy \[x_1+x_2+\dots+x_m=y_1+y_2+\dots+y_m\] where $x_1<\dots<x_m$ and $y_1<\dots<y_m$, then $x_i=y_i$ for any $1\le i\le m$.