[b]p1.[/b] Thirty players participate in a chess tournament. Every player plays one game with every other player. What maximal number of players can get exactly $5$ points? (any game adds $1$ point to the winner’s score, $0$ points to a loser’s score, in the case of a draw each player obtains $1/2$ point.) [b]p2.[/b] A father and his son returned from a fishing trip. To make their catches equal the father gave to his son some of his fish. If, instead, the son had given his father the same number of fish, then father would have had twice as many fish as his son. What percent more is the father's catch more than his son's? [b]p3.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p4.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from 1 to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number 3? The total number of all obtained points is $264$. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $b$ men take $c$ days to lay $f$ bricks, then the number of days it will take $c$ men working at the same rate to lay $b$ bricks, is $\textbf{(A) }fb^2\qquad\textbf{(B) }b/f^2\qquad\textbf{(C) }f^2/b\qquad\textbf{(D) }b^2/f\qquad \textbf{(E) }f/b^2$

Find all triples $(a,b,c)$ of integers for which the equation \[x^3-a^2x^2+b^2x-ab+3c=0\] has three distinct integer roots $x_1,x_2,x_3$ which are pairwise coprime.

Find, with justification, all positive real numbers $a,b,c$ satisfying the system of equations: \[a\sqrt{b}=a+c,b\sqrt{c}=b+a,c\sqrt{a}=c+b.\]

Aurick has a cup, a right cone with a circular base of radius $\frac12$, filled with milk tea. The slant height of the cup is $1$, and the tea fills the cup $\frac12$ of the way up the cup’s side. Suppose that Aurick tips the cup just to the point of spilling, as shown in the diagram. The new slant height EA and the tilted tea surface’s major axis $ET$ form $\angle T EA$. Compute $\cos(\angle T EA)$. [img]https://cdn.artofproblemsolving.com/attachments/e/e/76e12ee31ce4ba8a5daaf0f5538b98726a0d37.png[/img]

A function f : $R$ $\rightarrow$ $R$ satisfies the property $f(x^2) - f^2(x) \geq 1/4$ for all x. Verify if the function is one-one.

$a)$ Let $a$, $b$ and $c$ be positive real numbers. Prove that for all positive integers $m$ holds: $$(a+b)^m+(b+c)^m+(c+a)^m \leq 2^m(a^m+b^m+c^m)$$ $b)$ Does inequality $a)$ holds for $1)$ arbitrary real numbers $a$, $b$ and $c$ $2)$ any integer $m$

Let $A_1A_2A_3A_4A_5A_6A_7A_8$ be a right octagon with center $O$ and $\lambda_1$,$\lambda_2$, $\lambda_3$, $\lambda_4$ be some rational numbers for which: $\lambda_1 \overrightarrow{OA_1}+\lambda_2 \overrightarrow{OA_2}+\lambda_3 \overrightarrow{OA_3}+\lambda_4 \overrightarrow{OA_4} =\overrightarrow{o}$. Prove that $\lambda_1=\lambda_2=\lambda_3=\lambda_4=0$.

If the points $(1,y_1)$ and $(-1,y_2)$ lie on the graph of $y=ax^2+bx+c$, and $y_1-y_2=-6$, then $b$ equals: $\textbf{(A) }-3\qquad \textbf{(B) }0\qquad \textbf{(C) }3\qquad \textbf{(D) }\sqrt{ac}\qquad \textbf{(E) }\dfrac{a+c}2$

Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.

In triangle $ABC$, $D$ is a point on $AB$ between $A$ and $B$, $E$ is a point on $AC$ between $A$ and $C$, and $F$ is a point on $BC$ between $B$ and $C$ such that $AF$, $BE$, and $CD$ all meet inside $\triangle ABC$ at a point $G$. Given that the area of $\triangle ABC$ is $15$, the area of $\triangle ABE$ is $5$, and the area of $\triangle ACD$ is $10$, compute the area of $\triangle ABF$.

Prove that the equation $x^{2}+p|x| = qx - 1 $ has 4 distinct real solutions if and only if $p+|q|+2<0$ ($p$ and $q$ are two real parameters).

Let $ K$ be the circumscribed circle of the trapezoid $ ABCD$ . In this trapezoid the diagonals $ AC$ and $ BD$ are perpendicular. The parallel sides $ AB\equal{}a$ and $ CD\equal{}c$ are diameters of the circles $ K_{a}$ and $ K_{b}$ respectively. Find the perimeter and the area of the part inside the circle $ K$, that is outside circles $ K_{a}$ and $ K_{b}$.

We say that a prism is [i]binary[/i] if there exists a labelling of the vertices of the prism with integers from the set $\{-1,1\}$ such that the product of the numbers assigned to the vertices of each face (base or lateral face) is equal to $-1$. a) Prove that any [i]binary[/i] prism has the number of total vertices divisible by 8; b) Prove that any prism with 2000 vertices is [i]binary[/i].

[u]Round 9[/u] [b]p25.[/b] Maisy the Bear is at the origin of the Cartesian Plane. WhenMaisy is on the point $(m,n)$ then it can jump to either $(m,n +1)$ or $(m+1,n)$. Let $L(x, y)$ be the number of pathsMaisy can take to reach the point $(x, y)$. The sum of $L(x, y)$ over all lattice points $(x, y)$ with both coordinates between $0$ and $2020$, inclusive, can be written as ${2k \choose k} - j$ for a minimum positive integer k and corresponding positive integer $j$ . Find $k + j$ . [b]p26.[/b] A circle with center $O$ and radius $2$ and a circle with center $P$ and radius $3$ are externally tangent at $A$. Points $B$ and $C$ are on the circle with center $O$ such that $\vartriangle ABC$ is equilateral. Segment $AB$ extends past B to point $D$ and $AC$ extends past $C$ to point $E$ such that $BD = CE =\sqrt3$. A line through $D$ is tangent to circle $P$ at $F$. The value of $EF^2$ can be expressed as $\frac{a+b\sqrt{c}}{d}$ where $a$, $b$, $c$, and $d$ are integers, c is squarefree, and $gcd(a,b,d) = 1$. Find $a +b +c +d$. [b]p27.[/b] Find the number of trailing zeroes at the end of $$\sum^{2021}_{i=1}(2021^i -1) = (2021^1 -1)...(2021^{2021}-1).$$ [u]Round 10[/u] [b]p28.[/b] Points $A, B, C, P$, and $D$ lie on circle ω in that order. Let $AC$ and $BD$ intersect at $I$ . Given that $PI = PC = PD$, $\angle DAB = 137^o$, and $\angle ABC = 109^o$, find the measure of $\angle BIC$ in degrees. [b]p29.[/b] Find the sum of all positive integers $n < 2021$ such that when ${d_1,d_2,... ,d_k}$ are the positive integer factors of $n$, then $$\left( \sum^{k}_{i=1}d_i \right) \left( \sum^{k}_{i=1} \frac{1}{d_i} \right)= r^2$$ for some rational number $r$ . [b]p30.[/b] Let $a, b, c, d$ and $e$ be positive real numbers. Define the function $f (x, y) = \frac{x}{y}+\frac{y}{x}$ for all positive real numbers. Given that $f (a,b) = 7$, $f (b,c) = 5$, $f (c,d) = 3$, and $f (d,e) = 2$, find the sum of all possible values of $f (e,a)$. [u]Round 11[/u] [b]p31.[/b] There exist $100$ (not necessarily distinct) complex numbers $r_1, r_2,..., r_{100}$ such that for any positive integer $1 \le k \le 100$, we have that $P(r_k ) = 0$ where the polynomial $P$ is defined as $$P(x) = \sum^{101}_{i=1}i \cdot x^{101-i} = x^{100} +2x^{99} +3x^{98} +...+99x^2 +100x +101.$$ Find the value of $$\prod^{100}_{j=1} (r^2_j+1) = (r^2_1 +1)(r^2_2 +1)...(r^2_{100} +1).$$ [b]p32.[/b] Let $BT$ be the diameter of a circle $\omega_1$, and $AT$ be a tangent of $\omega_1$. Line $AB$ intersects $\omega_1$ at $C$, and $\vartriangle ACT$ has circumcircle $\omega_2$. Points $P$ and $S$ exist such that $PA$ and $PC$ are tangent to $\omega_2$ and $SB = BT = 20$. Given that $AT = 15$, the length of $PS$ can be written as $\frac{a\sqrt{b}}{c}$ , where $a$, $b$, and $c$ are positive integers, $b$ is squarefree, and $gcd(a,b) = 1$. Find $a +b +c$. [b]p33.[/b] There are a hundred students in math team. Each pair of students are either mutually friends or mutually enemies. It is given that if any three students are chosen, then they are not all mutually friends. The maximum possible number of ways to choose four students such that it is possible to label them $A, B, C$, and $D$ such that $A$ and $B$ are friends, $B$ and $C$ are friends, $C$ and $D$ are friends, and D and A are friends can be expressed as $n^4$. Find $n$. [u]Round 12[/u] [b]p34.[/b] Let $\{p_i\}$ be the prime numbers, such that $p_1 = 2, p_2 = 3, p_3 = 5, ...$ For each $i$ , let $q_i$ be the nearest perfect square to $p_i$ . Estimate $\sum^{2021}_{i=1}|p_i=q_i |$. If the correct answer is $A$ and your answer is $E$, your score will be $\left \lfloor 30 \cdot \max - \left(0,1-5 \cdot \left| \log_{10} \frac{A}{E} \right| \right)\right \rfloor.$ [b]p35.[/b] Estimate the number of digits of $(2021!)^{2021}$. If the correct answer is $A$ and your answer is $E$, your score will be $\left \lfloor 15 \cdot \max \left(0,2- \cdot \left| \log_{10} \frac{A}{E} \right| \right) \right \rfloor.$ [b]p36.[/b] Pick a positive integer between$ 1$ and $1000$, inclusive. If your answer is $E$ and a quarter of the mean of all the responses to this problem is $A$, your score will be $$ \lfloor \max \left(0,30- |A-E|, 2-|E-1000| \right) \rfloor.$$ Note that if you pick $1000$, you will automatically get $2$ points. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3166489p28814241]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3166494p28814284]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $N$ be the orthocentre of triangle $ABC$ (i .e. the point where the altitudes meet). Prove that the circumscribed circles of triangles $ABN, ACN$ and $BCN$ each have equal radius.

A real symmetric $2018\times 2018$ matrix $A=(a_{ij})$ satisfies $|a_{ij}-2018|\leq 1$ for every $1\leq i,j\leq 2018$. Denote the largest eigenvalue of $A$ by $\lambda(A)$. Find maximum and minumum value of $\lambda(A)$.

Two integers $n, k$ satisfies $n \ge 2$ and $k \ge \frac{5}{2}n-1$. Prove that whichever $k$ lattice points with $x$ and $y$ coordinate no less than $1$ and no more than $n$ we pick, there must be a circle passing through at least four of these points.

Show that one can color all the points of a plane using only two colors such that no line segment has all points of the same color.

Let $p = 1+\frac{1}{2}+\frac{1}{2^2}+\frac{1}{2^3}+\frac{1}{2^4}+\frac{1}{2^5}. $ For nonnegative reals $x, y,z$ satisfying $(x-1)^2 + (y-1)^2 + (z-1)^2 = 27,$ find the maximum value of $x^p + y^p + z^p.$

Let $w_1, w_2$ be non-intersecting, congruent circles with centers $O_1, O_2$ and let $P$ be in the exterior of both of them. The tangents from $P$ to $w_1$ meet $w_1$ at $A_1, B_1$ and define $A_2, B_2$ similarly. If lines $A_1B_1, A_2B_2$ meet at $Q$ show that the midpoint of $PQ$ is equidistant from $O_1, O_2$.

Let $ABCD$ be a rectangle and denote by $M$ and $N$ the midpoints of $AD$ and $BC$ respectively. The point $P$ is on $(CD$ such that $D\in (CP)$, and $PM$ intersects $AC$ in $Q$. Prove that $m(\angle{MNQ})=m(\angle{MNP})$.

Consider a hexagon with vertices labeled $M$, $M$, $A$, $T$, $H$, $S$ in that order. Clayton starts at the $M$ adjacent to $M$ and $A$, and writes the letter down. Each second, Clayton moves to an adjacent vertex, each with probability $\frac{1}{2}$, and writes down the corresponding letter. Clayton stops moving when the string he's written down contains the letters $M, A, T$, and $H$ in that order, not necessarily consecutively (for example, one valid string might be $MAMMSHTH$.) What is the expected length of the string Clayton wrote? [i]Proposed by Andrew Milas and Andrew Wu[/i]

Find the smallest real number $A$, such that there are two different triangles, with integer sidelengths and so that the area of each be $A$.

We have $ n \geq 2$ lamps $ L_{1}, . . . ,L_{n}$ in a row, each of them being either on or off. Every second we simultaneously modify the state of each lamp as follows: if the lamp $ L_{i}$ and its neighbours (only one neighbour for $ i \equal{} 1$ or $ i \equal{} n$, two neighbours for other $ i$) are in the same state, then $ L_{i}$ is switched off; – otherwise, $ L_{i}$ is switched on. Initially all the lamps are off except the leftmost one which is on. $ (a)$ Prove that there are infinitely many integers $ n$ for which all the lamps will eventually be off. $ (b)$ Prove that there are infinitely many integers $ n$ for which the lamps will never be all off.