Consider a matrix of size $n\times n$ whose entries are real numbers of absolute value not exceeding $1$. The sum of all entries of the matrix is $0$. Let $n$ be an even positive integer. Determine the least number $C$ such that every such matrix necessarily has a row or a column with the sum of its entries not exceeding $C$ in absolute value. [i]Proposed by Marcin Kuczma, Poland[/i]

The schoolboy wrote a homework essay on the topic “How I spent my summer.” Two of his comrades from a neighboring school decided not to bother themselves with work and rewrote his essay. But while rewriting they made several mistakes - each their own. Before submitting their work, both students gave their essays to four other friends to rewrite (each gave them to two acquaintances). These four schoolchildren do the same, and so on. With each rewrite, all previous mistakes are saved and, possibly, new ones are made. It is known that on some day each new essay contained at least $10$ errors. Prove that there was a day when at least $11$ new mistakes were made in total.

There are $n$ students sitting on a round table. You collect all of $ n $ name tags and give them back arbitrarily. Each student gets one of $n$ name tags. Now $n$ students repeat following operation: The students who have their own name tags exit the table. The other students give their name tags to the student who is sitting right to him. Find the number of ways giving name tags such that there exist a student who don't exit the table after 4 operations.

Let $n$ be a positive integer. Let $P_n=\{2^n,2^{n-1}\cdot 3, 2^{n-2}\cdot 3^2, \dots, 3^n \}.$ For each subset $X$ of $P_n$, we write $S_X$ for the sum of all elements of $X$, with the convention that $S_{\emptyset}=0$ where $\emptyset$ is the empty set. Suppose that $y$ is a real number with $0 \leq y \leq 3^{n+1}-2^{n+1}.$ Prove that there is a subset $Y$ of $P_n$ such that $0 \leq y-S_Y < 2^n$

You have a $9 \times 9$ board with white squares. A tile can be moved from one square to another neighbor (tiles that share one side). If we paint some squares of black, we say that such coloration is [i]good [/i] if there is a white square where we can place a chip that moving through white squares can return to the initial square having passed through at least $3$ boxes, without passing the same square twice. Find the highest possible value of $k$ such that any form of painting $k$ squares of black are a [i]good [/i] coloring.

There are a) $26$; b) $30$ identical-looking coins in a circle. It is known that exactly two of them are fake. Real coins weigh the same, fake ones too, but they are lighter than the real ones. How can you determine in three weighings on a cup scale without weights whether there are fake coins lying nearby or not?? [i]Proposed by A. Gribalko[/i]

A graph $G$ has $n + k$ vertices. Let $A$ be a subset of $n$ vertices of the graph $G$, and $B$ be a subset of other $k$ vertices. Each vertex of $A$ is joined to at least $k - p$ vertices of $B$. Prove that if $np < k$ then there is a vertex in $B$ that can be joined to all vertices of $A$.

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

Prove that there exists such a number $A$ that you can inscribe $1978$ different size squares in the plot of the function $y = A sin(x)$. (The square is inscribed if all its vertices belong to the plot.)

Show that we cannot form more than $4096$ binary sequences of length $24$ so that any two differ in at least $8$ positions.

Determine the largest possible number of groups one can compose from the integers $1,2,3,..., 19,20$, so that the product of the numbers in each group is a perfect square. (The group may contain exactly one number, in that case the product equals this number, each number must be in exactly one group.) (E. Barabanov, I. Voronovich)

[b]p1.[/b] One out of $12$ coins is counterfeited. It is known that its weight differs from the weight of a valid coin but it is unknown whether it is lighter or heavier. How to detect the counterfeited coin with the help of four trials using only a two-pan balance without weights? [b]p2.[/b] Below a $3$-digit number $c d e$ is multiplied by a $2$-digit number $a b$ . Find all solutions $a, b, c, d, e, f, g$ if it is known that they represent distinct digits. $\begin{tabular}{ccccc} & & c & d & e \\ x & & & a & b \\ \hline & & f & e & g \\ + & c & d & e & \\ \hline & b & b & c & g \\ \end{tabular}$ [b]p3.[/b] Find all integer $n$ such that $\frac{n + 1}{2n - 1}$is an integer. [b]p4[/b]. There are several straight lines on the plane which split the plane in several pieces. Is it possible to paint the plane in brown and green such that each piece is painted one color and no pieces having a common side are painted the same color? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The “flying rook” moves as the usual chess rook but can’t move to a neighbouring square in one move. Is it possible for the flying rook on a $4 \times 4$ chess-board to visit every square once and return to the initial square in $16$ moves? (A. Tolpygo, Kiev)

A $k$-set is a set with exactly $k$ elements. For a $6$-set $A$ and any collection $\mathcal{F}$ of $4$-sets, we say that $A$ is [i]$\mathcal{F}$-good[/i] if there are exactly three elements $B_1, B_2, B_3$ in $\mathcal{F}$ that are subsets of $A$, and they furthermore satisfy $$(A \backslash B_1) \cup (A \backslash B_2) \cup (A \backslash B_3) = A.$$ Find all $n \geq 6$ so that there exists a collection $\mathcal{F}$ of $4$-subsets of $\{1, 2, \ldots , n\}$ such that every $6$-set $A \subseteq \{1, 2, \ldots , n\}$ is $\mathcal{F}$-good. [i] Proposed by usjl[/i]

On the board, the numbers from $1$ to $n$ are written. Achka (A) and Bavachka (B) play the following game. First, A erases one number, then B erases two consecutive numbers, then A erases three consecutive numbers, and finally B erases four consecutive numbers. What is the smallest $n$ such that B can definitely make her moves, no matter how A plays?

A collection of short stories written by Papadiamantis contains $70$ short stories, one of $1$ page, one of $2$ pages, ... one of $70$ pages . and not nessecarily in that order. Every short story starts on a new page and numbering of pages of the book starts from the first page . What is the maximum number of short stories that start on page with odd number?

A grasshopper is in the left above corner of a $10\times 10$ square. At each step he can jump a square below or a square to the right. Also, he can also fly from a cell of the bottom row to a cell of the above row, and from a cell of the rightmost column to a cell of the leftmost column. Prove that the grasshopper has to do at leat $9$ flies in order to visit each cell of the square at least once. [I]Proposed by N. Vlasova[/I]

On a circle noted $n$ points. It turned out that among the triangles with vertices in these points exactly half of the acute. Find all values $n$ in which this is possible.

Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.

Consider a table consisting of $2\times 7$ squares. Each little square is surrounded by walls (each internal wall belongs to two squares). We would like to remove some internal walls to make it possible to get from any square to any other one without crossing walls. How many ways can we do this while removing the minimal possible number of internal walls? [i]The figure shows a possible configuration, the remaining walls are marked in red, the removed ones are marked in light pink. Two configurations are considered the same if the same walls are removed.[/i] [img]https://cdn.artofproblemsolving.com/attachments/d/c/1a3d9ab0d0971929e6d484a970d4b1f36f0031.png[/img]

The workers laid a floor of size $n\times n$ ($10 <n <20$) with two types of tiles: $2 \times 2$ and $5\times 1$. It turned out that they were able to completely lay the floor so that the same number of tiles of each type was used. For which $n$ could this happen? (You can’t cut tiles and also put them on top of each other.)

There are $ n$ websites $ 1,2,\ldots,n$ ($ n \geq 2$). If there is a link from website $ i$ to $ j$, we can use this link so we can move website $ i$ to $ j$. For all $ i \in \left\{1,2,\ldots,n - 1 \right\}$, there is a link from website $ i$ to $ i+1$. Prove that we can add less or equal than $ 3(n - 1)\log_{2}(\log_{2} n)$ links so that for all integers $ 1 \leq i < j \leq n$, starting with website $ i$, and using at most three links to website $ j$. (If we use a link, website's number should increase. For example, No.7 to 4 is impossible). Sorry for my bad English.

Natural numbers from $1$ to $200$ were divided into $50$ sets. Prove that one of them contains three numbers that are the lengths of the sides some triangle.

[b]p1.[/b] Given any four digit number $X = \underline{ABCD}$, consider the quantity $Y(X) = 2 \cdot \underline{AB}+\underline{CD}$. For example, if $X = 1234$, then $Y(X) = 2 \cdot 12+34 = 58$. Find the sum of all natural numbers $n \le 10000$ such that over all four digit numbers $X$, the number $n$ divides $X$ if and only if it also divides $Y(X)$. [b]p2.[/b] A sink has a red faucet, a blue faucet, and a drain. The two faucets release water into the sink at constant but different rates when turned on, and the drain removes water from the sink at a constant rate when opened. It takes $5$ minutes to fill the sink (from empty to full) when the drain is open and only the red faucet is on, it takes $10$ minutes to fill the sink when the drain is open and only the blue faucet is on, and it takes $15$ seconds to fill the sink when both faucets are on and the drain is closed. Suppose that the sink is currently one-thirds full of water, and the drain is opened. Rounded to the nearest integer, how many seconds will elapse before the sink is emptied (keeping the two faucets closed)? [b]p3.[/b] One of the bases of a right triangular prism is a triangle $XYZ$ with side lengths $XY = 13$, $YZ = 14$, $ZX = 15$. Suppose that a sphere may be positioned to touch each of the five faces of the prism at exactly one point. A plane parallel to the rectangular face of the prism containing $\overline{YZ}$ cuts the prism and the sphere, giving rise to a cross-section of area $A$ for the prism and area $15\pi$ for the sphere. Find the sum of all possible values of $A$. [b]p4.[/b] Albert, Brian, and Christine are hanging out by a magical tree. This tree gives each of them a stick, each of which have a non-negative real length. Say that Albert gets a branch of length $x$, Brian a branch of length $y$, and Christine a branch of length $z$, and the lengths follow the condition that $x+y+z = 2$. Let $m$ and $n$ be the minimum and maximum possible values of $xy+yz+xz-xyz$, respectively. What is $m+n$? [b]p5.[/b] Let $S := MATHEMATICSMATHEMATICSMATHE...$ be the sequence where $7$ copies of the word $MATHEMATICS$ are concatenated together. How many ways are there to delete all but five letters of $S$ such that the resulting subsequence is $CHMMC$? [b]p6.[/b] Consider two sequences of integers $a_n$ and $b_n$ such that $a_1 = a_2 = 1$, $b_1 = b_2 = 1$ and that the following recursive relations are satisfied for integers $n > 2$: $$a_n = a_{n-1}a_{n-2}-b_{n-1}b_{n-2},$$ $$b_n = b_{n-1}a_{n-2}+a_{n-1}b_{n-2}.$$ Determine the value of $$\sum_{1\le n\le2023,b_n \ne 0} \frac{a_n}{b_n}.$$ [b]p7.[/b] Suppose $ABC$ is a triangle with circumcenter $O$. Let $A'$ be the reflection of $A$ across $\overline{BC}$. If $BC =12$, $\angle BAC = 60^o$, and the perimeter of $ABC$ is $30$, then find $A'O$. [b]p8.[/b] A class of $10$ students wants to determine the class president by drawing slips of paper from a box. One of the students, Bob, puts a slip of paper with his name into the box. Each other student has a $\frac12$ probability of putting a slip of paper with their own name into the box and a $\frac12$ probability of not doing so. Later, one slip is randomly selected from the box. Given that Bob’s slip is selected, find the expected number of slips of paper in the box before the slip is selected. [b]p9.[/b] Let $a$ and $b$ be positive integers, $a > b$, such that $6! \cdot 11$ divides $x^a -x^b$ for all positive integers $x$. What is the minimum possible value of $a+b$? [b]p10.[/b] Find the number of pairs of positive integers $(m,n)$ such that $n < m \le 100$ and the polynomial $x^m+x^n+1$ has a root on the unit circle. [b]p11.[/b] Let $ABC$ be a triangle and let $\omega$ be the circle passing through $A$, $B$, $C$ with center $O$. Lines $\ell_A$, $\ell_B$, $\ell_C$ are drawn tangent to $\omega$ at $A$, $B$, $C$ respectively. The intersections of these lines form a triangle $XYZ$ where $X$ is the intersection of $\ell_B$ and $\ell_C$, $Y$ is the intersection of $\ell_C$ and $\ell_A$, and $Z$ is the intersection of $\ell_A$ and $\ell_B$. Let $P$ be the intersection of lines $\overline{OX}$ and $\overline{YZ}$. Given $\angle ACB = \frac32 \angle ABC$ and $\frac{AC}{AB} = \frac{15}{16}$ , find $\frac{ZP}{YP}$. [b]p12.[/b] Compute the remainder when $$\sum_{1\le a,k\le 2021} a^k$$ is divided by $2022$ (in the above summation $a,k$ are integers). [b]p13.[/b] Consider a $7\times 2$ grid of squares, each of which is equally likely to be colored either red or blue. Madeline would like to visit every square on the grid exactly once, starting on one of the top two squares and ending on one of the bottom two squares. She can move between two squares if they are adjacent or diagonally adjacent. What is the probability that Madeline may visit the squares of the grid in this way such that the sequence of colors she visits is alternating (i.e., red, blue, red,... or blue, red, blue,... )? [b]p14.[/b] Let $ABC$ be a triangle with $AB = 8$, $BC = 10$, and $CA = 12$. Denote by $\Omega_A$ the $A$-excircle of $ABC$, and suppose that $\Omega_A$ is tangent to $\overline{AB}$ and $\overline{AC}$ at $F$ and $E$, respectively. Line $\ell \ne \overline{BC}$ is tangent to $\Omega_A$ and passes through the midpoint of $\overline{BC}$. Let $T$ be the intersection of $\overline{EF}$ and $\ell$. Compute the area of triangle $ATB$. [b]p15.[/b] For any positive integer $n$, let $D_n$ be the set of ordered pairs of positive integers $(m,d)$ such that $d$ divides $n$ and gcd$(m,n) = 1$, $1 \le m \le n$. For any positive integers $a$, $b$, let $r(a,b)$ be the non-negative remainder when $a$ is divided by $b$. Denote by $S_n$ the sum $$S_n = \sum_{(m,d)\in D_n} r(m,d).$$ Determine the value of $S_{396}$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A ticket for the tram costs 1 leva. On the queue in front of the ticket seller are standing $n$ people with a banknote of 1 leva and $m$ people with a banknote of 2 leva. The ticket seller has no money in his cash deck so he can only sell a ticket to a buyer with a banknote of 2 leva, if he has at least 1 banknote of 1 leva. Determine the probability that the ticket seller could sell tickets to all of the people standing in the queue.