The positive integers from 1 to $n^2$ are placed arbitrarily on the $n^2$ squares of a $n\times n$ chessboard. Two squares are called [i]adjacent[/i] if they have a common side. Show that two opposite corner squares can be joined by a path of $2n-1$ adjacent squares so that the sum of the numbers placed on them is at least $\left\lfloor \frac{n^3} 2 \right\rfloor + n^2 - n + 1$. [i]Radu Gologan[/i]

In each square of a garden shaped like a $2022 \times 2022$ board, there is initially a tree of height $0$. A gardener and a lumberjack alternate turns playing the following game, with the gardener taking the first turn: [list] [*] The gardener chooses a square in the garden. Each tree on that square and all the surrounding squares (of which there are at most eight) then becomes one unit taller. [*] The lumberjack then chooses four different squares on the board. Each tree of positive height on those squares then becomes one unit shorter. [/list] We say that a tree is [i]majestic[/i] if its height is at least $10^6$. Determine the largest $K$ such that the gardener can ensure there are eventually $K$ majestic trees on the board, no matter how the lumberjack plays.

A coloring of all plane points with coordinates belonging to the set $S=\{0,1,\ldots,99\}$ into red and white colors is said to be [i]critical[/i] if for each $i,j\in S$ at least one of the four points $(i,j),(i + 1,j),(i,j + 1)$ and $(i + 1, j + 1)$ $(99 + 1\equiv0)$ is colored red. Find the maximal possible number of red points in a critical coloring which loses its property after recoloring of any red point into white.

Let $n$ be a positive integer and $N=n^{2021}$. There are $2021$ concentric circles centered at $O$, and $N$ equally-spaced rays are emitted from point $O$. Among the $2021N$ intersections of the circles and the rays, some are painted red while the others remain unpainted. It is known that, no matter how one intersection point from each circle is chosen, there is an angle $\theta$ such that after a rotation of $\theta$ with respect to $O$, all chosen points are moved to red points. Prove that the minimum number of red points is $2021n^{2020}$. [I]Proposed by usjl.[/i]

You have $9$ colors of socks and $5$ socks of each type of color. Pick two socks randomly. What is the probability that they are the same color?

$A_1, A_2,\dots A_k$ are different subsets of the set $\{1,2,\dots ,2016\}$. If $A_i\cap A_j$ forms an arithmetic sequence for all $1\le i <j\le k$, what is the maximum value of $k$?

[b]p1.[/b] James has $8$ Instagram accounts, $3$ Facebook accounts, $4$ QQ accounts, and $3$ YouTube accounts. If each Instagram account has $19$ pictures, each Facebook account has $5$ pictures and $9$ videos, each QQ account has a total of $17$ pictures, and each YouTube account has $13$ videos and no pictures, how many pictures in total does James have in all these accounts? [b]p2.[/b] If Poonam can trade $7$ shanks for $4$ shinks, and she can trade $10$ shinks for $17$ shenks. How many shenks can Poonam get if she traded all of her $105$ shanks? [b]p3.[/b] Jerry has a bag with $3$ red marbles, $5$ blue marbles and $2$ white marbles. If Jerry randomly picks two marbles from the bag without replacement, the probability that he gets two different colors can be expressed as a fraction $\frac{m}{n}$ in lowest terms. What is $m + n$? [b]p4.[/b] Bob's favorite number is between $1200$ and $4000$, divisible by $5$, has the same units and hundreds digits, and the same tens and thousands digits. If his favorite number is even and not divisible by $3$, what is his favorite number? [b]p5.[/b] Consider a unit cube $ABCDEFGH$. Let $O$ be the center of the face $EFGH$. The length of $BO$ can be expressed in the form $\frac{\sqrt{a}}{b}$, where $a$ and $b$ are simplified to lowest terms. What is $a + b$? [b]p6.[/b] Mr. Eddie Wang is a crazy rich boss who owns a giant company in Singapore. Even though Mr. Wang appears friendly, he finds great joy in firing his employees. His immediately fires them when they say "hello" and/or "goodbye" to him. It is well known that $1/2$ of the total people say "hello" and/or "goodbye" to him everyday. If Mr. Wang had $2050$ employees at the end of yesterday, and he hires $2$ new employees at the beginning of each day, in how many days will Mr. Wang first only have $6$ employees left? [b]p7.[/b] In $\vartriangle ABC$, $AB = 5$, $AC = 6$. Let $D,E,F$ be the midpoints of $\overline{BC}$, $\overline{AC}$, $\overline{AB}$, respectively. Let $X$ be the foot of the altitude from $D$ to $\overline{EF}$. Let $\overline{AX}$ intersect $\overline{BC}$ at $Y$ . Given $DY = 1$, the length of $BC$ is $\frac{p}{q}$ for relatively prime positive integers $p, q$: Find $p + q$. [b]p8.[/b] Given $\frac{1}{2006} = \frac{1}{a} + \frac{1}{b}$ where $a$ is a $4$ digit positive integer and $b$ is a $6$ digit positive integer, find the smallest possible value of $b$. [b]p9.[/b] Pocky the postman has unlimited stamps worth $5$, $6$ and $7$ cents. However, his post office has two very odd requirements: On each envelope, an odd number of $7$ cent stamps must be used, and the total number of stamps used must also be odd. What is the largest amount of postage money Pocky cannot make with his stamps, in cents? [b]p10.[/b] Let $ABCDEF$ be a regular hexagon with side length $2$. Let $G$ be the midpoint of side $DE$. Now let $O$ be the intersection of $BG$ and $CF$. The radius of the circle inscribed in triangle $BOC$ can be expressed in the form $\frac{a\sqrt{b}-\sqrt{c}}{d} $ where $a$, $b$, $c$, $d$ are simplified to lowest terms. What is $a + b + c + d$? [b]p11.[/b] Estimation (Tiebreaker): What is the total number of characters in all of the participants' email addresses in the Accuracy Round? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the number of ways to arrange the letters in $LE X I NGTON$ such that the string $LE X$ does not appear.

Given a finite number of points in the plane as well as many different rays starting at the origin. It is always possible to pair the points with the rays so that they parallell displaced rays starting in respective points do not intersect?

On a table, cards numbered $1, 2, \ldots , 200$ are laid out in a row in some order, and a line is drawn on the table between some two of them. It is allowed to swap two adjacent cards if the number on the left is greater than the number on the right. After a few such moves, the cards were arranged in ascending order. Prove we have swapped pairs of cards separated by the line no more than 1884 times.

On each cell of a $2005\times2005$ chessboard, there is a marker. In each move, we are allowed to remove a marker that is a neighbor to an even number of markers (but at least one). Two markers are considered neighboring if their cells share a vertex. (a) Find the least number $n$ of markers that we can end up with on the chessboard. (b) If we end up with this minimum number $n$ of markers, prove that no two of them will be neighboring.

A $10\times10\times10$ cube has $1000$ unit cubes. $500$ of them are coloured black and $500$ of them are coloured white. Show that there are at least $100$ unit squares, being the common face of a white and a black unit cube.

Let $n>1$ be an integer. Hippo chooses a list of $n$ points in the plane $P_1, \dots, P_n$; some of these points may coincide, but not all of them can be identical. After this, Wombat picks a point from the list $X$ and measures the distances from it to the other $n-1$ points in the list. The average of the resulting $n-1$ numbers will be denoted $m(X)$. Find all values of $n$ for which Hippo can prepare the list in such a way, that for any point $X$ Wombat may pick, he can point to a point $Y$ from the list such that $XY=m(X)$.

Let $n\ge 2$ be an integer. Elwyn is given an $n\times n$ table filled with real numbers (each cell of the table contains exactly one number). We define a [i]rook set[/i] as a set of $n$ cells of the table situated in $n$ distinct rows as well as in n distinct columns. Assume that, for every rook set, the sum of $n$ numbers in the cells forming the set is nonnegative.\\ \\ By a move, Elwyn chooses a row, a column, and a real number $a,$ and then he adds $a$ to each number in the chosen row, and subtracts $a$ from each number in the chosen column (thus, the number at the intersection of the chosen row and column does not change). Prove that Elwyn can perform a sequence of moves so that all numbers in the table become nonnegative.

It is known that $n$ is a positive integer and $n \le 144$. Ten questions of the type “Is $n$ smaller than $a$?” are allowed. Answers are given with a delay: for $i = 1, \ldots , 9$, the $i$-th question is answered only after the $(i + 1)$-th question is asked. The answer to the tenth question is given immediately. Find a strategy for identifying $n$.

Let $ G$ be a $ 2$-connected nonbipartite graph on $ 2n$ vertices. Show that the vertex set of $ G$ can be split into two classes of $ n$ elements such that the edges joining the two classes form a connected, spanning subgraph. [i]L. Lovasz[/i]

There are 2020 inhabitants in a town. Before Christmas, they are all happy; but if an inhabitant does not receive any Christmas card from any other inhabitant, he or she will become sad. Unfortunately, there is only one post company which offers only one kind of service: before Christmas, each inhabitant may appoint two different other inhabitants, among which the company chooses one to whom to send a Christmas card on behalf of that inhabitant. It is known that the company makes the choices in such a way that as many inhabitants as possible will become sad. Find the least possible number of inhabitants who will become sad.

In an island, there exist 7 towns and a railway system which connected some of the towns. Every railway segment connects 2 towns, and in every town there exists at least 3 railway segments that connects the town to another towns. Prove that there exists a route that visits 4 different towns once and go back to the original town. (Example: $ A\minus{}B\minus{}C\minus{}D\minus{}A$)

We want to cover totally a square(side is equal to $k$ integer and $k>1$) with this rectangles: $1$ rectangle ($1\times 1$), $2$ rectangles ($2\times 1$), $4$ rectangles ($3\times 1$),...., $2^n$ rectangles ($n + 1 \times 1$), such that the rectangles can't overlap and don't exceed the limits of square. Find all $k$, such that this is possible and for each $k$ found you have to draw a solution

What is the greatest possible number of edges in a planar graph with $12$ vertices? A planar graph is one that can be drawn in a plane with none of the edges crossing (they intersect only at vertices).

The edges of a graph with $2n$ vertices ($n \ge 4$) are colored in blue and red such that there is no blue triangle and there is no red complete subgraph with $n$ vertices. Find the least possible number of blue edges.

$2022$ points are arranged in a circle, one of which is colored in black, and others in white. In one operation, The Hedgehog can do one of the following actions: 1) Choose two adjacent points of the same color and flip the color of both of them (white becomes black, black becomes white) 2) Choose two points of opposite colors with exactly one point in between them, and flip the color of both of them Is it possible to achieve a configuration where each point has a color opposite to its initial color with these operations? [i](Proposed by Oleksii Masalitin)[/i]

Let $0<\alpha<1$ be a fixed number. On a lake shaped like a convex polygon, at some point there is a duck and at another point a water lily grows. If the duck is at point $X{}$, then in one move it can swim towards one of the vertices $Y$ of the polygon a distance equal to a $\alpha\cdot XY$. Find all $\alpha{}$ for which, regardless of the shape of the lake and the initial positions of the duck and the lily, after a sequence of adequate moves, the distance between the duck and the lily will be at most one meter.

Let $A_1A_2A_3A_4A_5A_6A_7A_8$ be convex 8-gon (no three diagonals concruent). The intersection of arbitrary two diagonals will be called "button".Consider the convex quadrilaterals formed by four vertices of $A_1A_2A_3A_4A_5A_6A_7A_8$ and such convex quadrilaterals will be called "sub quadrilaterals".Find the smallest $n$ satisfying: We can color n "button" such that for all $i,k \in\{1,2,3,4,5,6,7,8\},i\neq k,s(i,k)$ are the same where $s(i,k)$ denote the number of the "sub quadrilaterals" has $A_i,A_k$ be the vertices and the intersection of two its diagonals is "button".

Let $\omega= \cos \frac{2\pi}{727} + i \sin \frac{2\pi}{727}$. The imaginary part of the complex number $$\prod^{13}_{k=8} \left(1 + \omega^{3^{k-1}}+ \omega^{2\cdot 3^{k-1}}\right)$$ is equal to $\sin a$ for some angle $a$ between $-\frac{\pi}{2}$ and $\frac{\pi}{2}$ , inclusive. Find $a$.