In an $8\times 8$ chessboard, the rows are numbers from $1$ to $8$ and the columns are labelled from $a$ to $h$. In a two-player game on this chessboard, the first player has a White Rook which starts on the square $b2$, and the second player has a Black Rook which starts on the square $c4$. The two players take turns moving their rooks. In each move, a rook lands on another square in the same row or the same column as its starting square. However, that square cannot be under attack by the other rook, and cannot have been landed on before by either rook. The player without a move loses the game. Which player has a winning strategy?

[u]Round 9[/u] [b]p25.[/b] Let $a$, $b$, and $c$ be positive numbers with $a +b +c = 4$. If $a,b,c \le 2$ and $$M =\frac{a^3 +5a}{4a^2 +2}+\frac{b^3 +5b}{4b^2 +2}+\frac{c^3 +5c}{4c^2 +2},$$ then find the maximum possible value of $\lfloor 100M \rfloor$. [b]p26.[/b] In $\vartriangle ABC$, $AB = 15$, $AC = 16$, and $BC = 17$. Points $E$ and $F$ are chosen on sides $AC$ and $AB$, respectively, such that $CE = 1$ and $BF = 3$. A point $D$ is chosen on side $BC$, and let the circumcircles of $\vartriangle BFD$ and $\vartriangle CED$ intersect at point $P \ne D$. Given that $\angle PEF = 30^o$, the length of segment $PF$ can be expressed as $\frac{m}{n}$ . Find $m+n$. [b]p27.[/b] Arnold and Barnold are playing a game with a pile of sticks with Arnold starting first. Each turn, a player can either remove $7$ sticks or $13$ sticks. If there are fewer than $7$ sticks at the start of a player’s turn, then they lose. Both players play optimally. Find the largest number of sticks under $200$ where Barnold has a winning strategy [u]Round 10[/u] [b]p28.[/b] Let $a$, $b$, and $c$ be positive real numbers such that $\log_2(a)-2 = \log_3(b) =\log_5(c)$ and $a +b = c$. What is $a +b +c$? [b]p29.[/b] Two points, $P(x, y)$ and $Q(-x, y)$ are selected on parabola $y = x^2$ such that $x > 0$ and the triangle formed by points $P$, $Q$, and the origin has equal area and perimeter. Find $y$. [b]p30.[/b] $5$ families are attending a wedding. $2$ families consist of $4$ people, $2$ families consist of $3$ people, and $1$ family consists of $2$ people. A very long row of $25$ chairs is set up for the families to sit in. Given that all members of the same family sit next to each other, let the number of ways all the people can sit in the chairs such that no two members of different families sit next to each other be $n$. Find the number of factors of $n$. [u]Round 11[/u] [b]p31.[/b] Let polynomial $P(x) = x^3 +ax^2 +bx +c$ have (not neccessarily real) roots $r_1$, $r_2$, and $r_3$. If $2ab = a^3 -20 = 6c -21$, then the value of $|r^3_1+r^3_2+r^3_3|$ can be written as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find the value of $m+n$. [b]p32.[/b] In acute $\vartriangle ABC$, let $H$, $I$ , $O$, and $G$ be the orthocenter, incenter, circumcenter, and centroid of $\vartriangle ABC$, respectively. Suppose that there exists a circle $\omega$ passing through $B$, $I$ , $H$, and $C$, the circumradius of $\vartriangle ABC$ is $312$, and $OG = 80$. Let $H'$, distinct from $H$, be the point on $\omega$ such that $\overline{HH'}$ is a diameter of $\omega$. Given that lines $H'O$ and $BC$ meet at a point $P$, find the length $OP$. [b]p33.[/b] Find the number of ordered quadruples $(x, y, z,w)$ such that $0 \le x, y, z,w \le 1000$ are integers and $$x!+ y! =2^z \cdot w!$$ holds (Note: $0! = 1$). [u]Round 12[/u] [b]p34.[/b] Let $Z$ be the product of all the answers from the teams for this question. Estimate the number of digits of $Z$. If your estimate is $E$ and the answer is $A$, your score for this problem will be $$\max \left( 0, \lceil 15- |A-E| \rceil \right).$$ Your answer must be a positive integer. [b]p35.[/b] Let $N$ be number of ordered pairs of positive integers $(x, y)$ such that $3x^2 -y^2 = 2$ and $x < 2^{75}$. Estimate $N$. If your estimate is $E$ and the answer is $A$, your score for this problem will be $$\max \left( 0, \lceil 15- 2|A-E| \rceil \right).$$ [b]p36.[/b] $30$ points are located on a circle. How many ways are there to draw any number of line segments between the points such that none of the line segments overlap and none of the points are on more than one line segment? (It is possible to draw no line segments). If your estimate is $E$ and the answer is $A$, your score for this problem will be $$\max \left( 0, \left \lceil 15- \ln \frac{A}{E} \right \rceil \right).$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3166472p28814057]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3166476p28814111]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that $m$ and $k$ are non-negative integers, and $p = 2^{2^m}+1$ is a prime number. Prove that [b](a)[/b] $2^{2^{m+1}p^k} \equiv 1$ $(\text{mod } p^{k+1})$; [b](b)[/b] $2^{m+1}p^k$ is the smallest positive integer $n$ satisfying the congruence equation $2^n \equiv 1$ $(\text{mod } p^{k+1})$.

The ratio of the radii of two concentric circles is $1:3$. If $\overline{AC}$ is a diameter of the larger circle, $\overline{BC}$ is a chord of the larger circle that is tangent to the smaller circle, and $AB = 12$, then the radius of the larger circle is [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair O=origin, A=3*dir(180), B=3*dir(140), C=3*dir(0); dot(O); draw(Arc(origin,1,0,360)); draw(Arc(origin,3,0,360)); draw(A--B--C--A); label("$A$", A, dir(O--A)); label("$B$", B, dir(O--B)); label("$C$", C, dir(O--C)); [/asy] $ \textbf{(A)}\ 13\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 21\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 26 $

Find all natural numbers $a$ such that for every positive integer $n$ the number $n(a+n)$ is not a perfect square.

Let $x,y,$ and $z$ be nonnegative real numbers with $x+y+z=120$. Compute the largest possible value of the median of the three numbers $2x+y,2y+z,$ and $2z+x$. [i]Proposed by Ankit Bisain[/i]

If $a=\tfrac{1}{2}$ and $(a+1)(b+1)=2$ then the radian measure of $\arctan a + \arctan b$ equals $\textbf{(A) }\frac{\pi}{2}\qquad\textbf{(B) }\frac{\pi}{3}\qquad\textbf{(C) }\frac{\pi}{4}\qquad\textbf{(D) }\frac{\pi}{5}\qquad\textbf{(E) }\frac{\pi}{6}$

Using white cubes of side $1$, a prism (without holes) was assembled. The faces of the prism were painted black. It is known that the cubes left with exactly $4$ white faces are $20$ in total. Determine what the dimensions of the prism can be. Give all the possibilities.

In how many ways can we place the numbers from $1$ to $100$ in a $2\times 50$ rectangle (divided into $100$ unit squares) so that any two consecutive numbers are always placed in squares with a common side?

[b]Q12.[/b] Find all positive integers $P$ such that the sum and product of all its divisors are $2P$ and $P^2$, respectively.

Joao had blue, white and red pearls and with them he made a necklace with $20$ pearls that has as many blue as white pearls. João noticed that, regardless of how he cut the necklace into two parts, both with an even number of pearls, one of the parts would always have more blue pearls than white ones. How many red pearls are in Joao's necklace?

Let $R$ be a ring of characteristic zero. Let $e,f,g\in R$ be idempotent elements (an element $x$ is called idempotent if $x^2=x$) satisfying $e+f+g=0$. Show that $e=f=g=0$.

A hexagon is inscribed in a circle. Five of the sides have length 81 and the sixth, denoted by $\overline{AB}$, has length 31. Find the sum of the lengths of the three diagonals that can be drawn from $A$.

Find the number of ordered pairs $(m, n)$ such that $m$ and $n$ are positive integers in the set $\{1, 2, ..., 30\}$ and the greatest common divisor of $2^m + 1$ and $2^n - 1$ is not $1.$

A triangle $ ABC$ is given in the plane. Let $ M$ be a point inside the triangle and $ A'$, $ B'$, $ C'$ be its projections on the sides $ BC$, $ CA$, $ AB$, respectively. Find the locus of $ M$ for which $ MA \cdot MA' \equal{} MB \cdot MB' \equal{} MC \cdot MC'$.

The three distinct points$ B, C, D$ are collinear with C between B and D. Another point A not on the line BD is such that $|AB| = |AC| = |CD|.$ Prove that ∠$BAC = 36$ if and only if $1/|CD|-1/|BD|=1/(|CD| + |BD|)$ .

An urn initially contains one red ball and one blue ball. In each step, we choose a uniform random ball from the urn. If it is red, then another red ball and another blue ball are placed in the urn. And when we choose a blue ball for the $k$-th time, we put a blue ball and $2k + 1$ red balls in the urn. (The chosen balls are not removed; they remain in the urn.) Let $G_n$ denote the number of red balls in the urn after $n$ steps. Prove that there exist constants $0 < c, \alpha < \infty$ such that $\frac{G_n}{n^\alpha} \to c$ almost surely.

Positive integers $a, b, c$ satisfy $\frac1a +\frac1b +\frac1c<1$. Prove that $\frac1a +\frac1b +\frac1c\le \frac{41}{42}$. Also prove that equality in fact holds in the second inequality.

A marker is placed at the origin of an integer lattice. Calvin and Hobbes play the following game. Calvin starts the game and each of them takes turns alternatively. At each turn, one can choose two (not necessarily distinct) integers $a, b$, neither of which was chosen earlier by any player and move the marker by $a$ units in the horizontal direction and $b$ units in the vertical direction. Hobbes wins if the marker is back at the origin any time after the first turn. Prove or disprove that Calvin can prevent Hobbes from winning. Note: A move in the horizontal direction by a positive quantity will be towards the right, and by a negative quantity will be towards the left (and similar directions in the vertical case as well).

Let $P$ be a point in the interior of a triangle $ABC$ and let the rays $\overrightarrow{AP}, \overrightarrow{BP}$ and $\overrightarrow{CP}$ intersect the sides $BC, CA$ and $AB$ in $A_1,B_1$ and $C_1$, respectively. Let $D$ be the foot of the perpendicular from $A_1$ to $B_1C_1$. Show that \[\frac{CD}{BD}=\frac{B_1C}{BC_1} \cdot \frac{C_1A}{AB_1}.\]

Let $ a_{1},a_{2},\cdots,a_{n}$ be positive real numbers satisfying $ a_{1} \plus{} a_{2} \plus{} \cdots \plus{} a_{n} \equal{} 1$. Prove that \[\left(a_{1}a_{2} \plus{} a_{2}a_{3} \plus{} \cdots \plus{} a_{n}a_{1}\right)\left(\frac {a_{1}}{a_{2}^2 \plus{} a_{2}} \plus{} \frac {a_{2}}{a_{3}^2 \plus{} a_{3}} \plus{} \cdots \plus{} \frac {a_{n}}{a_{1}^2 \plus{} a_{1}}\right)\ge\frac {n}{n \plus{} 1}\]

Is it possible to divide a $6 \times 6$ chessboard into $18$ rectangles, each either $1 \times 2$ or $2 \times 1$, and to draw exactly one diagonal on each rectangle such that no two of these diagonals have a common endpoint? (A Shapovalov)

Let $a,b$ be natural numbers with $ab>2$. Suppose that the sum of their greatest common divisor and least common multiple is divisble by $a+b$. Prove that the quotient is at most $\frac{a+b}{4}$. When is this quotient exactly equal to $\frac{a+b}{4}$

Let a, b be positive integers. a, b and a.b are not perfect squares. Prove that at most one of following equations $ ax^2 \minus{} by^2 \equal{} 1$ and $ ax^2 \minus{} by^2 \equal{} \minus{} 1$ has solutions in positive integers.

Two quadratic polynomials $ f_{1},f_{2}$ satisfy $ f_{1}'(x)f_{2}'(x)\geq |f_{1}(x)|\plus{}|f_{2}(x)|\forall x\in\mathbb{R}$ . Prove that $ f_{1}\cdot f_{2}\equal{} g^{2}$ for some $ g\in\mathbb{R}[x]$.