There is a $2021 \times 2023$ board that has a white piece in the central square, on which Mich and Moka are going to play in turns. First Mich places a green token on any free space so that it is not in the same row or column as the white token, then Moka places a red token on any free space so that it is not in the same row or column as the white token. white or green. From now on, Mich will place green tokens and Moka will place red tokens alternately according to the following rules: $\bullet$ For the placed piece there must be another piece of the same color in its row or column, such that there is no other piece between both pieces. $\bullet$ If there is at least one box that meets the previous rule, then it is mandatory to place a token. When a token is placed, it changes all the tokens that are on squares adjacent to it to the same color. The game ends when one of the players can no longer place tiles. If when the game ends the board has more green tiles then Mich wins, and if it has more red tiles then Moka wins. Determine if either player has a winning strategy.

Let $a_1,a_2,...,a_9$ be nine real numbers, not necessarily distinct, with average $m$. Let $A$ denote the number of triples $1 \le i < j < k \le 9$ for which $a_i + a_j + a_k \ge 3m$. What is the minimum possible value of $A$? [i]Proposed by Ray Li[/i]

Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$.

[u]Round 1[/u] [b]p1.[/b] Suppose that gold satisfies the relation $p = v + v^2$, where $p$ is the price and $v$ is the volume. How many pieces of gold with volume $1$ can be bought for the price of a piece with volume $2$? [b]p2.[/b] Find the smallest prime number with each digit greater or equal to $8$. [b]p3.[/b] What fraction of regular hexagon $ZUMING$ is covered by both quadrilateral $ZUMI$ and quadrilateral$ MING$? [u]Round 2[/u] [b]p4.[/b] The two smallest positive integers expressible as the sum of two (not necessarily positive) perfect cubes are $1 = 1^3 +0^3$ and $2 = 1^3 +1^3$. Find the next smallest positive integer expressible in this form. [b]p5.[/b] In how many ways can the numbers $1, 2, 3,$ and $4$ be written in a row such that no two adjacent numbers differ by exactly $1$? [b]p6.[/b] A real number is placed in each cell of a grid with $3$ rows and $4$ columns. The average of the numbers in each column is $2016$, and the average of the numbers in each row is a constant $x$. Compute $x$. [u]Round 3[/u] [b]p7.[/b] Fardin is walking from his home to his oce at a speed of $1$ meter per second, expecting to arrive exactly on time. When he is halfway there, he realizes that he forgot to bring his pocketwatch, so he runs back to his house at $2$ meters per second. If he now decides to travel from his home to his office at $x$ meters per second, find the minimum $x$ that will allow him to be on time. [b]p8.[/b] In triangle $ABC$, the angle bisector of $\angle B$ intersects the perpendicular bisector of $AB$ at point $P$ on segment $AC$. Given that $\angle C = 60^o$, determine the measure of $\angle CPB$ in degrees. [b]p9.[/b] Katie colors each of the cells of a $6\times 6$ grid either black or white. From top to bottom, the number of black squares in each row are $1$, $2$, $3$, $4$, $5$, and $6$, respectively. From left to right, the number of black squares in each column are $6$, $5$, $4$, $3$, $2$, and $1$, respectively. In how many ways could Katie have colored the grid? [u]Round 4[/u] [b]p10.[/b] Lily stands at the origin of a number line. Each second, she either moves $2$ units to the right or $1$ unit to the left. At how many different places could she be after $2016$ seconds? [b]p11.[/b] There are $125$ politicians standing in a row. Each either always tells the truth or always lies. Furthermore, each politician (except the leftmost politician) claims that at least half of the people to his left always lie. Find the number of politicians that always lie. [b]p12.[/b] Two concentric circles with radii $2$ and $5$ are drawn on the plane. What is the side length of the largest square whose area is contained entirely by the region between the two circles? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2934055p26256296]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Lavidópolis is a city with 2024 neighborhoods. Lavi Dopes was elected mayor, and since he saw that there were no roads in the city, he asked Gil Bento, the monster engineer, to design the city's roads according to the following rules: 1. Any two neighborhoods are connected by at most one two-way road; 2. For any two neighborhoods, there is exactly one route from one neighborhood to another, which may pass through some intermediate neighborhoods, but never passes through the same neighborhood more than once. Mayor Lavi Dopes wants to try for re-election, but since he knows nothing about the city and only shows up during campaign times (he spent all this time stealing... I mean, thinking about math problems), he wants to find a pair of neighborhoods such that the number of roads that are part of the route connecting them is maximized among all pairs of neighborhoods. To do this, he starts asking Gil Bento various questions, all in the following manner: he chooses two of the 2024 neighborhoods, say A and B, and asks: "Given neighborhoods A and B, how many roads are part of the route connecting A to B?" Knowing that Gil Bento always answers correctly to each question, determine the minimum number of questions that Lavi Dopes needs to ask to achieve his goal, regardless of how Gil Bento has designed the roads of Lavidópolis.

Consider all possible sets of natural numbers $(x_1, x_2, ..., x_{100})$ such that $1\leq x_i \leq 2017$ for every $i = 1,2, ..., 100$. We say that the set $(y_1, y_2, ..., y_{100})$ is greater than the set $(z_1, z_2, ..., z_{100})$ if $y_i> z_i$ for every $i = 1,2, ..., 100$. What is the largest number of sets that can be written on the board, so that any set is not more than the other set?

[b]p1.[/b] If Clark wants to divide $100$ pizzas among $25$ people so that each person receives the same number of pizzas, how many pizzas should each person receive? [b]p2.[/b] In a group of $3$ people, every pair of people shakes hands once. How many handshakes occur? [b]p3.[/b] Dylan and Joey have $14$ costumes in total. Dylan gives Joey $4$ costumes, and Joey now has the number of costumes that Dylan had before giving Joey any costumes. How many costumes does Dylan have now? [b]p4.[/b] At Banjo Borger, a burger costs $7$ dollars, a soda costs $2$ dollars, and a cookie costs $3$ dollars. Alex, Connor, and Tony each spent $11$ dollars on their order, but none of them got the same order. If Connor bought the most cookies, how many cookies did Connor buy? [b]p5.[/b] Joey, James, and Austin stand on a large, flat field. If the distance from Joey to James is $30$ and the distance from Austin to James is $18$, what is the minimal possible distance from Joey to Austin? [b]p6.[/b] If the first and third terms of a five-term arithmetic sequence are $3$ and $8$, respectively, what is the sum of all $5$ terms in the sequence? [b]p7.[/b] What is the area of the $S$-shaped figure below, which has constant vertical height $5$ and width $10$? [img]https://cdn.artofproblemsolving.com/attachments/3/c/5bbe638472c8ea8289b63d128cd6b449440244.png[/img] [b]p8.[/b] If the side length of square $A$ is $4$, what is the perimeter of square $B$, formed by connecting the midpoints of the sides of $A$? [b]p9.[/b] The Chan Shun Auditorium at UC Berkeley has room number $2050$. The number of seats in the auditorium is a factor of the room number, and there are between $150$ and $431$ seats, inclusive. What is the sum of all of the possible numbers of seats in Chan Shun Auditorium? [b]p10.[/b] Krishna has a positive integer $x$. He notices that $x^2$ has the same last digit as $x$. If Krishna knows that $x$ is a prime number less than $50$, how many possible values of $x$ are there? [b]p11.[/b] Jing Jing the Kangaroo starts on the number $1$. If she is at a positive integer $n$, she can either jump to $2n$ or to the sum of the digits of $n$. What is the smallest positive integer she cannot reach no matter how she jumps? [b]p12.[/b] Sylvia is $3$ units directly east of Druv and runs twice as fast as Druv. When a whistle blows, Druv runs directly north, and Sylvia runs along a straight line. If they meet at a point a distance $d$ units away from Druv's original location, what is the value of $d$? [b]p13.[/b] If $x$ is a real number such that $\sqrt{x} + \sqrt{10} = \sqrt{x + 20}$, compute $x$. [b]p14.[/b] Compute the number of rearrangments of the letters in $LATEX$ such that the letter $T$ comes before the letter $E$ and the letter $E$ comes before the letter $X$. For example, $TLEAX$ is a valid rearrangment, but $LAETX$ is not. [b]p15.[/b] How many integers $n$ greater than $2$ are there such that the degree measure of each interior angle of a regular $n$-gon is an even integer? [b]p16.[/b] Students are being assigned to faculty mentors in the Berkeley Math Department. If there are $7$ students and $3$ mentors and each student has exactly one mentor, in how many ways can students be assigned to mentors given that each mentor has at least one student? [b]p17.[/b] Karthik has a paper square of side length $2$. He folds the square along a crease that connects the midpoints of two opposite sides (as shown in the left diagram, where the dotted line indicates the fold). He takes the resulting rectangle and folds it such that one of its vertices lands on the vertex that is diagonally opposite. Find the area of Karthik's final figure. [img]https://cdn.artofproblemsolving.com/attachments/1/e/01aa386f6616cafeed5f95ababb27bf24657f6.png[/img] [b]p18.[/b] Sally is inside a pen consisting of points $(a, b)$ such that $0 \le a, b \le 4$. If she is currently on the point $(x, y)$, she can move to either $(x, y + 1)$, $(x, y - 1)$, or $(x + 1, y)$. Given that she cannot revisit any point she has visited before, find the number of ways she can reach $(4, 4)$ from $(0, 0)$. [b]p19.[/b] An ant sits on the circumference of the circular base of a party hat (a cone without a circular base for the ant to walk on) of radius $2$ and height $\sqrt{5}$. If the ant wants to reach a point diametrically opposite of its current location on the hat, what is the minimum possible distance the ant needs to travel? [img]https://cdn.artofproblemsolving.com/attachments/3/4/6a7810b9862fd47106c3c275c96337ef6d23c2.png[/img] [b]p20.[/b] If $$f(x) = \frac{2^{19}x + 2^{20}}{ x^2 + 2^{20}x + 2^{20}}.$$ find the value of $f(1) + f(2) + f(4) + f(8) + ... + f(220)$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

p1. A quadratic equation has the natural roots $a$ and $ b$. Another quadratic equation has roots $ b$ and $c$ with $a\ne c$. If $a$, $ b$, and $c$ are prime numbers less than $15$, how many triplets $(a,b,c)$ that might meet these conditions are there (provided that the coefficient of the quadratic term is equal to $ 1$)? p2. In Indonesia, was formerly known the "Archipelago Fraction''. The [i]Archipelago Fraction[/i] is a fraction $\frac{a}{b}$ such that $a$ and $ b$ are natural numbers with $a < b$. Find the sum of all Archipelago Fractions starting from a fraction with $b = 2$ to $b = 1000$. p3. Look at the following picture. The letters $a, b, c, d$, and $e$ in the box will replaced with numbers from $1, 2, 3, 4, 5, 6, 7, 8$, or $9$, provided that $a,b, c, d$, and $e$ must be different. If it is known that $ae = bd$, how many arrangements are there? [img]https://cdn.artofproblemsolving.com/attachments/f/2/d676a57553c1097a15a0774c3413b0b7abc45f.png[/img] p4. Given a triangle $ABC$ with $A$ as the vertex and $BC$ as the base. Point $P$ lies on the side $CA$. From point $A$ a line parallel to $PB$ is drawn and intersects extension of the base at point $D$. Point $E$ lies on the base so that $CE : ED = 2 :3$. If $F$ is the midpoint between $E$ and $C$, and the area of ​​triangle ABC is equal with $35$ cm$^2$, what is the area of ​​triangle $PEF$? p5. Each side of a cube is written as a natural number. At the vertex of each angle is given a value that is the product of three numbers on three sides that intersect at the vertex. If the sum of all the numbers at the points of the angle is equal to $1001$, find the sum of all the numbers written on the sides of the cube.

Given an isosceles trapezoid and draw one of its diagonals (so we get $2$ triangles). On each triangle we get, there is an ant walking along the edge. There speed are equal and unchanged. These $2$ ants also didn't change their walking directions and their directions are opposite. Prove that: for all initial locations of the ants, they will meet each other at some time.

Find the number of trapeziums that it can be formed with the vertices of a regular polygon.

$(GDR 4)$ Find the maximal number of regions into which a sphere can be partitioned by $n$ circles.

Points $A_1, \ldots A_n$ with rational coordinates lie on a plane. It turned out that the distance between every pair of points is an integer. Prove that there exist points $B_1, \ldots ,B_n$ with integer coordinates such that $A_iA_j=B_iB_j$ for every pair $1 \leq i \leq j \leq n$ [i]N. Sheshko, D. Zmiaikou[/i]

A set $A$ contains exactly $n$ integers, each of which is greater than $1$ and every of their prime factors is less than $10$. Determine the smallest $n$ such that $A$ must contain at least two distinct elements $a$ and $b$ such that $ab$ is the square of an integer.

Let $n \ge 1$ be a positive integer. An $n \times n$ matrix is called [i]good[/i] if each entry is a non-negative integer, the sum of entries in each row and each column is equal. A [i]permutation[/i] matrix is an $n \times n$ matrix consisting of $n$ ones and $n(n-1)$ zeroes such that each row and each column has exactly one non-zero entry. Prove that any [i]good[/i] matrix is a sum of finitely many [i]permutation[/i] matrices.

Ann and Max play a game on a $100 \times 100$ board. First, Ann writes an integer from 1 to 10 000 in each square of the board so that each number is used exactly once. Then Max chooses a square in the leftmost column and places a token on this square. He makes a number of moves in order to reach the rightmost column. In each move the token is moved to a square adjacent by side or vertex. For each visited square (including the starting one) Max pays Ann the number of coins equal to the number written in that square. Max wants to pay as little as possible, whereas Ann wants to write the numbers in such a way to maximise the amount she will receive. How much money will Max pay Ann if both players follow their best strategies? [i]Lev Shabanov[/i]

For which $n\in\{3900, 3901,\cdots, 3909\}$ can the set $\{1, 2, . . . , n\}$ be partitioned into (disjoint) triples in such a way that in each triple one of the numbers equals the sum of the other two?

A $3\times 3$ table is filled with real numbers in such a way that each number in the table is equal to the absolute value of the difference of the sum of numbers in its row and the sum of numbers in its column. (a) Show that any number in this table can be expressed as a sum or a difference of some two numbers in the table. (b) Show that there is such a table not all of whose entries are $0$.

Prove that for each $ n$: \[ \sum_{k\equal{}1}^n\binom{n\plus{}k\minus{}1}{2k\minus{}1}\equal{}F_{2n}\]

Prove that the plane is not a union of the inner regions of finitely many parabolas. (The outer region of a parabola is the union of the lines not intersecting the parabola. The inner region of a parabola is the set of points of the plane that do not belong to the outer region of the parabola)

A convex polygon on the plane is called [i]wide[/i] if the projection of the polygon onto any line in the same plane is a segment with length at least 1. Prove that a circle of radius $\tfrac{1}{3}$ can be placed completely inside any wide polygon.

Let $N$ a positive integer. In a spaceship there are $2 \cdot N$ people, and each two of them are friends or foes (both relationships are symmetric). Two aliens play a game as follows: 1) The first alien chooses any person as she wishes. 2) Thenceforth, alternately, each alien chooses one person not chosen before such that the person chosen on each turn be a friend of the person chosen on the previous turn. 3) The alien that can't play in her turn loses. Prove that second player has a winning strategy [i]if, and only if[/i], the $2 \cdot N$ people can be divided in $N$ pairs in such a way that two people in the same pair are friends.

Given a positive integer $n \ge 2$, let $\mathcal{P}$ and $\mathcal{Q}$ be two sets, each consisting of $n$ points in three-dimensional space. Suppose that these $2n$ points are distinct. Show that it is possible to label the points of $\mathcal{P}$ as $P_1,P_2,\dots,P_n$ and the points of $\mathcal{Q}$ as $Q_1,Q_2,\dots,Q_n$ such that for any indices $i$ and $j$, the balls of diameters $P_iQ_i$ and $P_jQ_j$ have at least one common point.

Determine the minimum number of lines that can be drawn on the plane so that they intersect in exactly $200$ distinct points. (Note that for $3$ distinct points, the minimum number of lines is $3$ and for $4$ distinct points, the minimum is $4$)

Find all pairs of integers $(c, d)$, both greater than 1, such that the following holds: For any monic polynomial $Q$ of degree $d$ with integer coefficients and for any prime $p > c(2c+1)$, there exists a set $S$ of at most $\big(\tfrac{2c-1}{2c+1}\big)p$ integers, such that \[\bigcup_{s \in S} \{s,\; Q(s),\; Q(Q(s)),\; Q(Q(Q(s))),\; \dots\}\] contains a complete residue system modulo $p$ (i.e., intersects with every residue class modulo $p$).

A crossword is a grid of black and white cells such that every white cell belongs to some $2\times 2$ square of white cells. A word in the crossword is a contiguous sequence of two or more white cells in the same row or column, delimited on each side by either a black cell or the boundary of the grid. Show that the total number of words in an $n\times n$ crossword cannot exceed $(n+1)^2/2$. [i]Proposed by Nikolai Beluhov, Bulgaria[/i]