2 players A and B play the following game with A going first: On each player's turn, he puts a number from 1 to 99 among 99 equally spaced points on a circle (numbers cannot be repeated), and the player who completes 3 consecutive numbers that forms an arithmetic sequence around the circle wins the game. Who has the winning strategy? Explain your reasoning.

nic$\kappa$y is drawing kappas in the cells of a square grid. However, he does not want to draw kappas in three consecutive cells (horizontally, vertically, or diagonally). Find all real numbers $d>0$ such that for every positive integer $n,$ nic$\kappa$y can label at least $dn^2$ cells of an $n\times n$ square. [i]Proposed by Mihir Singhal and Michael Kural[/i]

In the plane we are given a set $ E$ of 1991 points, and certain pairs of these points are joined with a path. We suppose that for every point of $ E,$ there exist at least 1593 other points of $ E$ to which it is joined by a path. Show that there exist six points of $ E$ every pair of which are joined by a path. [i]Alternative version:[/i] Is it possible to find a set $ E$ of 1991 points in the plane and paths joining certain pairs of the points in $ E$ such that every point of $ E$ is joined with a path to at least 1592 other points of $ E,$ and in every subset of six points of $ E$ there exist at least two points that are not joined?

4. Let $v$ and $w$ be two randomly chosen roots of the equation $z^{1997} -1 = 0$ (all roots are equiprobable). Find the probability that $\sqrt{2+\sqrt{3}}\le |u+w|$

Let $A_1$, $A_2$, $\cdots$, $A_m$ be $m$ subsets of a set of size $n$. Prove that $$ \sum_{i=1}^{m} \sum_{j=1}^{m}|A_i|\cdot |A_i \cap A_j|\geq \frac{1}{mn}\left(\sum_{i=1}^{m}|A_i|\right)^3.$$

For a set \(S\) of positive integers and a positive integer \(n\), consider the game of [i]\((n,S)\)-nim[/i], which is as follows. A pile starts with \(n\) watermelons. Two players, Deric and Erek, alternate turns eating watermelons from the pile, with Deric going first. On any turn, the number of watermelons eaten must be an element of \(S\). The last player to move wins. Let \(f(S)\) denote the set of positive integers \(n\) for which Deric has a winning strategy in \((n,S)\)-nim. Let \(T\) be a set of positive integers. Must the sequence \[T, \; f(T), \; f(f(T)), \;\ldots\] be eventually constant? [i]Proposed by Brandon Wang and Edward Wan[/i]

For which values of $n$ is it possible to construct an $n$ by $n$ by $n$ cube with $n^3$ unit cubes, each of which is black or white, such that each cube shares a common face with exactly three cubes of the opposite colour? (S Tokarev)

Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$. Determine the smallest number of pieces Paul needs to make in order to accomplish this.

[b]p1.[/b] In rectangle $ABMC$, $AB= 5$ and $BM= 8$. If point $X$ is the midpoint of side $AC$, what is the area of triangle $XCM$? [b]p2.[/b] Find the sum of all possible values of $a+b+c+d$ such that $(a, b, c, d)$ are quadruplets of (not necessarily distinct) prime numbers satisfying $a \cdot b \cdot c \cdot d = 4792$. [b]p3.[/b] How many integers from $1$ to $2022$ inclusive are divisible by $6$ or $24$, but not by both? [b]p4.[/b] Jerry begins his English homework at $07:39$ a.m. At $07:44$ a.m., he has finished $2.5\%$ of his homework. Subsequently, for every five minutes that pass, he completes three times as much homework as he did in the previous five minute interval. If Jerry finishes his homework at $AB : CD$ a.m., what is $A + B + C + D$? For example, if he finishes at $03:14$ a.m., $A + B + C + D = 0 + 3 + 1 + 4$. [b]p5.[/b] Advay the frog jumps $10$ times on Mondays, Wednesdays and Fridays. He jumps $7$ times on Tuesdays and Saturdays. He jumps $5$ times on Thursdays and Sundays. How many times in total did Advay jump in November if November $17$th falls on a Thursday? (There are $30$ days in November). [b]p6.[/b] In the following diagram, $\angle BAD\cong \angle DAC$, $\overline{CD} = 2\overline{BD}$, and $ \angle AEC$ and $\angle ACE$ are complementary. Given that $\overline{BA} = 210$ and $\overline{EC} = 525$, find $\overline{AE}$. [img]https://cdn.artofproblemsolving.com/attachments/5/3/8e11caf2d7dbb143a296573f265e696b4ab27e.png[/img] [b]p7.[/b] How many trailing zeros are there when $2021!$ is expressed in base $2021$? [b]p8.[/b] When two circular rings of diameter $12$ on the Olympic Games Logo intersect, they meet at two points, creating a $60^o$ arc on each circle. If four such intersections exist on the logo, and no region is in $3$ circles, the area of the regions of the logo that exist in exactly two circles is $a\pi - b\sqrt{c}$ where $a$, $b$, $c$ are positive integers and $\sqrt{c}$ is fully simplified find $a + b + c$. [b]p9.[/b] If $x^2 + ax - 3$ is a factor of $x^4 - x^3 + bx^2 - 5x - 3$, then what is $|a + b|$? [b]p10.[/b] Let $(x, y, z)$ be the point on the graph of $x^4 +2x^2y^2 +y^4 -2x^2 -2y^2 +z^2 +1 = 0$ such that $x+y +z$ is maximized. Find $a+b$ if $xy +xz +yz$ can be expressed as $\frac{a}{b}$ where $a$, $b$ are relatively prime positive integers. [b]p11.[/b] Andy starts driving from Pittsburgh to Columbus and back at a random time from $12$ pm to $3$ pm. Brendan starts driving from Pittsburgh to Columbus and back at a random time from $1$ pm to $4$ pm. Both Andy and Brendan take $3$ hours for the round trip, and they travel at constant speeds. The probability that they pass each other closer to Pittsburgh than Columbus is$ m/n$, for relatively prime positive integers $m$ and $n$. What is $m + n$? [b]p12.[/b] Consider trapezoid $ABCD$ with $AB$ parallel to $CD$ and $AB < CD$. Let $AD \cap BC = O$, $BO = 5$, and $BC = 11$. Drop perpendicular $AH$ and $BI$ onto $CD$. Given that $AH : AD = \frac23$ and $BI : BC = \frac56$ , calculate $a + b + c + d - e$ if $AB + CD$ can be expressed as $\frac{a\sqrt{b} + c\sqrt{d}}{e}$ where $a$, $b$, $c$, $d$, $e$ are integers with $gcd(a, c, e) = 1$ and $\sqrt{b}$, $\sqrt{d}$ are fully simplified. [b]p13.[/b] The polynomials $p(x)$ and $q(x)$ are of the same degree and have the same set of integer coefficients but the order of the coefficients is different. What is the smallest possible positive difference between $p(2021)$ and $q(2021)$? [b]p14.[/b] Let $ABCD$ be a square with side length $12$, and $P$ be a point inside $ABCD$. Let line $AP$ intersect $DC$ at $E$. Let line $DE$ intersect the circumcircle of $ADP$ at $F \ne D$. Given that line $EB$ is tangent to the circumcircle of $ABP$ at $B$, and $FD = 8$, find $m + n$ if $AP$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$, $n$. [b]p15.[/b] A three digit number $m$ is chosen such that its hundreds digit is the sum of the tens and units digits. What is the smallest positive integer $n$ such that $n$ cannot divide $m$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In fencing, you win a round if you are the first to reach $15$ points. Suppose that when $A$ plays against $B$, at any point during the round, $A$ scores the next point with probability $p$ and $B$ scores the next point with probability $q=1-p$. (However, they never can both score a point at the same time.) Suppose that in this round, $A$ already has $14-k$ points, and $B$ has $14-\ell$ (where $0\le k,\ell\le 14$). By how much will the probability that $A$ wins the round increase if $A$ scores the next point?

A set of lines in the plane is in [i]general position[/i] if no two are parallel and no three pass through the same point. A set of lines in general position cuts the plane into regions, some of which have finite area; we call these its [i]finite regions[/i]. Prove that for all sufficiently large $n$, in any set of $n$ lines in general position it is possible to colour at least $\sqrt{n}$ lines blue in such a way that none of its finite regions has a completely blue boundary. [i]Note[/i]: Results with $\sqrt{n}$ replaced by $c\sqrt{n}$ will be awarded points depending on the value of the constant $c$.

The game of circulate is played with a deck of $kn$ cards each with a number in $1,2,\ldots,n$ such that there are $k$ cards with each number. First, $n$ piles numbered $1,2,\ldots,n$ of $k$ cards each are dealt out face down. The player then flips over a card from pile $1$, places that card face up at the bottom of the pile, then next flips over a card from the pile whose number matches the number on the card just flipped. The player repeats this until he reaches a pile in which every card has already been flipped and wins if at that point every card has been flipped. Hamster has grown tired of losing every time, so he decides to cheat. He looks at the piles beforehand and rearranges the $k$ cards in each pile as he pleases. When can Hamster perform this procedure such that he will win the game? [i]Brian Hamrick.[/i]

On a large chessboard, there are $4$ puddings that form a square with size $1$. A pudding $A$ could jump over a pudding $B$, or equivalently, $A$ moves to the symmetric point with respect to $B$. Is it possible that after finite times of jumping, the puddings form a square with size $2$?

Numbers $1,2,3...,100$ are written on a board. $A$ and $B$ plays the following game: They take turns choosing a number from the board and deleting them. $A$ starts first. They sum all the deleted numbers. If after a player's turn (after he deletes a number on the board) the sum of the deleted numbers can't be expressed as difference of two perfect squares,then he loses, if not, then the game continues as usual. Which player got a winning strategy?

The vertices of a regular polygon with $N$ sides are marked on the blackboard. Ana and Beto play alternately, Ana begins. Each player, in turn, must do the following: $\bullet$ join two vertices with a segment, without cutting another already marked segment; or $\bullet$ delete a vertex that does not belong to any marked segment. The player who cannot take any action on his turn loses the game. Determine which of the two players can guarantee victory: a) if $N=28$ b) if $N=29$

A little boy wrote the numbers $1,2,\cdots,2011$ on a blackboard. He picks any two numbers $x,y$, erases them with a sponge and writes the number $|x-y|$. This process continues until only one number is left. Prove that the number left is even.

Suppose that $n$ triangles are given in the plane such that any three of them have a common vertex, but no four of them do. Find the greatest possible $n$.

Let $m,n$ and $N$ be positive integers and $\mathbb{Z}_{N}=\{0,1,\dots,N-1\}$ a set of residues modulo $N$. Consider a table $m\times n$ such that each one of the $mn$ cells has an element of $\mathbb{Z}_{N}$. A [i]move[/i] is choose an element $g\in \mathbb{Z}_{N}$, a cell in the table and add $+g$ to the elements in the same row/column of the chosen cell(the sum is modulo $N$). Prove that if $N$ is coprime with $m-1,n-1,m+n-1$ then any initial arrangement of your elements in the table cells can become any other arrangement using an finite quantity of moves.

Let $G$ be a planar graph, which is also bipartite. Is it always possible to assign a vertex to each face of the graph such that no two faces have the same vertex assigned to them? [i]Submitted by Dávid Matolcsi, Budapest[/i]

Portraits of famous scientists hang on a wall. The scientists lived between 1600 and 2008, and none of them lived longer than 80 years. Vasya multiplied the years of birth of these scientists, and Petya multiplied the years of their death. Petya's result is exactly $ 5\over 4$ times greater than Vasya's result. What minimum number of portraits can be on the wall? [i]Author: V. Frank[/i]

For each $n$ find the number of ways one can put the numbers $\{1,2,3,...,n\}$ numbers on the circle, such that if for any $4$ numbers $a,b,c,d$ where $n|a+b-c-d$. The segments joining $a,b$ and $c,d$ do not meet inside the circle. (Two ways are said to be identical , if one can be obtained from rotaiting the other)

Denote by $E(n)$ the number of $1$'s in the binary representation of a positive integer $n$. Call $n$ [i]interesting[/i] if $E(n)$ divides $n$. Prove that (a) there cannot be five consecutive interesting numbers, and (b) there are infinitely many positive integers $n$ such that $n$, $n+1$ and $n+2$ are each interesting.

Three gamblers play against each other for money. They each start by placing a pile of one-krone coins on the table, and from this point on the total number of coins on the table does not change. The ratio between the number of coins they start with is $6 : 5 : 4$. At the end of the game, the ratio of the number of coins they have is $7 : 6 : 5$ in some order. At the end of the game, one of the gamblers has three coins more than at the beginning. How many coins does this gambler have at the end?

For any polynomial $P(x)=a_0+a_1x+\ldots+a_kx^k$ with integer coefficients, the number of odd coefficients is denoted by $o(P)$. For $i-0,1,2,\ldots$ let $Q_i(x)=(1+x)^i$. Prove that if $i_1,i_2,\ldots,i_n$ are integers satisfying $0\le i_1<i_2<\ldots<i_n$, then: \[ o(Q_{i_{1}}+Q_{i_{2}}+\ldots+Q_{i_{n}})\ge o(Q_{i_{1}}). \]

Determine the number of sequences of points $(x_1, y_1),(x_2, y_2), \dots ,(x_{4570}, y_{4570})$ on the plane satisfying the following two properties: $\text{(i)}$ $\{x_1,x_2,\dots,x_{4570}\}=\{1,2,\dots,2014\}$ and $\{y_1,y_2,\dots,y_{4570}\}=\{1,2,\dots,2557\}$ $\text{(ii)} $ For each $i = 1, 2,\dots , 4569$, exactly one of $x_i = x_{i+1}$ and $y_i = y_{i+1}$ holds.