Consider the sequence $x_n>0$ defined with the following recurrence relation: \[x_1 = 0\] and for $n>1$ \[(n+1)^2x_{n+1}^2 + (2^n+4)(n+1)x_{n+1}+ 2^{n+1}+2^{2n-2} = 9n^2x_n^2+36nx_n+32.\] Show that if $n$ is a prime number larger or equal to $5$, then $x_n$ is an integer.

In a dance party there are $n$ girls and $n$ boys, and some $m$ songs are played. Each song is danced to by at least one pair of a boy and a girl, who both receive a [i]malai [/i] each. Prove that for all positive integers $k \le n$, it is possible to select $k$ boys and $n - k$ girls so that the $n$ selected people received at least $m$ malai in total.

The numbers $1, 2, 3,\ldots , 64$ are placed on a chessboard, one number in each square. Consider all squares on the chessboard of size $2 \times 2.$ Prove that there are at least three such squares for which the sum of the $4$ numbers contained exceeds $100.$

Let $n$ be a positive integer. Show that there are infinitely many primes $p$ such that the smallest positive primitive root of $p$ is greater than $n$.

$AB$ and $AC$ are tangents to a circle $\omega$ with center $O$ at $B,C$ respectively. Point $P$ is a variable point on minor arc $BC$. The tangent at $P$ to $\omega$ meets $AB,AC$ at $D,E$ respectively. $AO$ meets $BP,CP$ at $U,V$ respectively. The line through $P$ perpendicular to $AB$ intersects $DV$ at $M$, and the line through $P$ perpendicular to $AC$ intersects $EU$ at $N$. Prove that as $P$ varies, $MN$ passes through a fixed point.

What is the smallest positive integer $n$ such that $\sqrt{n}-\sqrt{n-1}<.01$? $\textbf{(A) }2499\qquad\textbf{(B) }2500\qquad\textbf{(C) }2501\qquad\textbf{(D) }10,000\qquad \textbf{(E) }\text{There is no such integer}$

A straight line passing through the point $(0,4)$ is perpendicular to the line $x-3y-7=0$. Its equation is: $\textbf{(A)}\ y+3x-4=0 \qquad \textbf{(B)}\ y+3x+4=0 \qquad \textbf{(C)}\ y-3x-4=0 \qquad\\ \textbf{(D)}\ 3y+x-12=0 \qquad \textbf{(E)}\ 3y-x-12=0 $

Let $f(x) = (x^4 + 2x^3 + 4x^2 + 2x + 1)^5$. Compute the prime $p$ satisfying $f(p) = 418{,}195{,}493$. [i]Proposed by Eugene Chen[/i]

Let point $T$ be on side $AB$ of $\Delta ABC$ be such that $AT-BT=AC-BC$. The perpendicular from point $T$ to $AB$ intersects $AC$ in point $E$ and the angle bisectors of $\angle B$ and $\angle C$ intersect the circumscribed circle $k$ of $ABC$ in points $M$ and $L$. If $P$ is the second intersection point of the line $ME$ with $k$, then prove that $P,T,L$ are collinear.

Two unequal circles intersect at $X$ and $Y$. Their common tangents intersect at $Z$. One of the tangents touches the circles at $P$ and $Q$. Show that $ZX$ is tangent to the circumcircle of $PXQ$.

For $n\ne 0$, let f(n) be the largest $k$ such that $3^k$ divides $n$. If $M$ is a set of $n > 1$ integers, show that the number of possible values for $f(m-n)$, where $m, n$ belong to $M$ cannot exceed $n-1$.

$ABCD$ has $AB = CD$, but $AB$ not parallel to $CD$, and $AD$ parallel to $BC$. The triangle is $ABC$ is rotated about $C$ to $A'B'C$. Show that the midpoints of $BC, B'C$ and $A'D$ are collinear.

A circle touches the sides $AC$ and $AB$ of the triangle $ABC $ at the points ${{B}_ {1}} $ and ${{C}_ {1}}$ respectively. The segments $B {{B} _ {1}} $ and $C {{C} _ {1}}$ are equal. Prove that the triangle $ABC $ is isosceles. (Timoshkevich Taras)

A sequence of real numbers $\{a_n\}_{n = 1}^\infty (n=1,2,...)$ has the following property: \begin{align*} 6a_n+5a_{n-2}=20+11a_{n-1}\ (\text{for }n\geq3). \end{align*} The first two elements are $a_1=0, a_2=1$. Find the integer closest to $a_{2011}$.

If $d$ is a positive integer such that $d \mid 5+2022^{2022}$, show that $d=2x^2+2xy+3y^2$ for some $x, y \in \mathbb{Z}$ iff $d \equiv 3,7 \pmod {20}$.

Find the smallest positive integer $a$ such that $x^4+a^2$ is not prime for any integer $x$.

There is a point $D$ on side $AC$ of acute triangle $\triangle ABC$. Let $AM$ be the median drawn from $A$ (so $M$ is on $BC$) and $CH$ be the altitude drawn from $C$ (so $H$ is on $AB$). Let $I$ be the intersection of $AM$ and $CH$, and let $K$ be the intersection of $AM$ and line segment $BD$. We know that $AK=8$, $BK=8$, and $MK=6$. Find the length of $AI$.

In $\triangle ABC$, $\angle B = \angle C = 30^{\circ}$ and $BC=2\sqrt 3$. $P, Q$ lie on segments $\overline{AB}, \overline{AC}$ such that $AP=1$ and $AQ=\sqrt 2$. Let $D$ be the foot of the altitude from $A$ to $BC$. We fold $\triangle ABC$ along line $AD$ in three dimensions such that the dihedral angle between planes $ADB$ and $ADC$ equals $60$ degrees. Under this transformation, compute the length $PQ$. [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 8)[/i]

For any $p, q \in N$, we can express $\frac{p}{q}$ as the base $10$ decimal $x_1x_2... x_{\ell}.x_{\ell+1}... x_a \overline{y_1y_2... y_b}$, with the digits $y_1, . . . y_b$ repeating. In other words, $\frac{p}{q}$ can be expressed with integer part $x_1x_2... x_{\ell}$ and decimal part $0.x_{\ell+1}... x_a \overline{y_1y_2... y_b}$. Given that $\frac{p}{q}= \frac{(2021)^{2021}}{2021!}$ , estimate the minimum value of $a$. If $E$ is the exact answer to this question and $A$ is your answer, your score is given by $\max \, \left(0, \left\lfloor 25 - \frac{1}{10}|E - A|\right\rfloor \right)$.

Does there exist a positive integer $n{}$ such that for any real $x{}$ and $y{}$ there exist real numbers $a_1, \ldots , a_n$ satisfying \[x=a_1+\cdots+a_n\text{ and }y=\frac{1}{a_1}+\cdots+\frac{1}{a_n}?\] [i]Artemiy Sokolov[/i]

Let $ABC$ be a triangle, $\Gamma$ its circumcircle, $I$ its incenter, and $\omega$ a tangent circle to the line $AI$ at $I$ and to the side $BC$. Prove that the circles $\Gamma$ and $\omega$ are tangent. Malik Talbi

Let $G$ be a finite group with the following property: If $f$ is an automorphism of $G$, then there exists $m\in\mathbb{N^\star}$, so that $f(x)=x^{m} $ for all $x\in G$. Prove that G is commutative. [i]Marian Andronache[/i]

The letter F shown below is rotated $90^\circ$ clockwise around the origin, then reflected in the $y$-axis, and then rotated a half turn around the origin. What is the final image? [asy] import cse5;pathpen=black;pointpen=black; size(2cm); D((0,-2)--MP("y",(0,7),N)); D((-3,0)--MP("x",(5,0),E)); D((1,0)--(1,2)--(2,2)--(2,3)--(1,3)--(1,4)--(3,4)--(3,5)--(0,5)); [/asy][asy] import cse5;pathpen=black;pointpen=black; unitsize(0.2cm); D((0,-2)--MP("y",(0,7),N)); D(MP("\textbf{(A) }",(-3,0),W)--MP("x",(5,0),E)); D((1,0)--(1,2)--(2,2)--(2,3)--(1,3)--(1,4)--(3,4)--(3,5)--(0,5)); // D((18,-2)--MP("y",(18,7),N)); D(MP("\textbf{(B) }",(13,0),W)--MP("x",(21,0),E)); D((17,0)--(17,2)--(16,2)--(16,3)--(17,3)--(17,4)--(15,4)--(15,5)--(18,5)); // D((36,-2)--MP("y",(36,7),N)); D(MP("\textbf{(C) }",(29,0),W)--MP("x",(38,0),E)); D((31,0)--(31,1)--(33,1)--(33,2)--(34,2)--(34,1)--(35,1)--(35,3)--(36,3)); // D((0,-17)--MP("y",(0,-8),N)); D(MP("\textbf{(D) }",(-3,-15),W)--MP("x",(5,-15),E)); D((3,-15)--(3,-14)--(1,-14)--(1,-13)--(2,-13)--(2,-12)--(1,-12)--(1,-10)--(0,-10)); // D((15,-17)--MP("y",(15,-8),N)); D(MP("\textbf{(E) }",(13,-15),W)--MP("x",(22,-15),E)); D((15,-14)--(17,-14)--(17,-13)--(18,-13)--(18,-14)--(19,-14)--(19,-12)--(20,-12)--(20,-15)); [/asy]

[u]Set 7[/u] [b]p19.[/b] Let circles $\omega_1$ and $\omega_2$, with centers $O_1$ and $O_2$, respectively, intersect at $X$ and $Y$ . A lies on $\omega_1$ and $B$ lies on $\omega_2$ such that $AO_1$ and $BO_2$ are both parallel to $XY$, and $A$ and $B$ lie on the same side of $O_1O_2$. If $XY = 60$, $\angle XAY = 45^o$, and $\angle XBY = 30^o$, then the length of $AB$ can be expressed in the form $\sqrt{a - b\sqrt2 + c\sqrt3}$, where $a, b, c$ are positive integers. Determine $a + b + c$. [b]p20.[/b] If $x$ is a positive real number such that $x^{x^2}= 2^{80}$, find the largest integer not greater than $x^3$. [b]p21.[/b] Justin has a bag containing $750$ balls, each colored red or blue. Sneaky Sam takes out a random number of balls and replaces them all with green balls. Sam notices that of the balls left in the bag, there are $15$ more red balls than blue balls. Justin then takes out $500$ of the balls chosen randomly. If $E$ is the expected number of green balls that Justin takes out, determine the greatest integer less than or equal to $E$. [u]Set 8[/u] These three problems are interdependent; each problem statement in this set will use the answers to the other two problems in this set. As such, let the positive integers $A, B, C$ be the answers to problems $22$, $23$, and $24$, respectively, for this set. [b]p22.[/b] Let $WXYZ$ be a rectangle with $WX =\sqrt{5B}$ and $XY =\sqrt{5C}$. Let the midpoint of $XY$ be $M$ and the midpoint of $YZ$ be $N$. If $XN$ and $W Y$ intersect at $P$, determine the area of $MPNY$ . [b]p23.[/b] Positive integers $x, y, z$ satisfy $$xy \equiv A \,\, (mod 5)$$ $$yz \equiv 2A + C\,\, (mod 7)$$ $$zx \equiv C + 3 \,\, (mod 9).$$ (Here, writing $a \equiv b \,\, (mod m)$ is equivalent to writing $m | a - b$.) Given that $3 \nmid x$, $3 \nmid z$, and $9 | y$, find the minimum possible value of the product $xyz$. [b]p24.[/b] Suppose $x$ and $y$ are real numbers such that $$x + y = A$$ $$xy =\frac{1}{36}B^2.$$ Determine $|x - y|$. [u]Set 9[/u] [b]p25. [/b]The integer $2017$ is a prime which can be uniquely represented as the sum of the squares of two positive integers: $$9^2 + 44^2 = 2017.$$ If $N = 2017 \cdot 128$ can be uniquely represented as the sum of the squares of two positive integers $a^2 +b^2$, determine $a + b$. [b]p26.[/b] Chef Celia is planning to unveil her newest creation: a whole-wheat square pyramid filled with maple syrup. She will use a square flatbread with a one meter diagonal and cut out each of the five polygonal faces of the pyramid individually. If each of the triangular faces of the pyramid are to be equilateral triangles, the largest volume of syrup, in cubic meters, that Celia can enclose in her pyramid can be expressed as $\frac{a-\sqrt{b}}{c}$ where $a, b$ and $c$ are the smallest possible possible positive integers. What is $a + b + c$? [b]p27.[/b] In the Cartesian plane, let $\omega$ be the circle centered at $(24, 7)$ with radius $6$. Points $P, Q$, and $R$ are chosen in the plane such that $P$ lies on $\omega$, $Q$ lies on the line $y = x$, and $R$ lies on the $x$-axis. The minimum possible value of $PQ+QR+RP$ can be expressed in the form $\sqrt{m}$ for some integer $m$. Find m. [u]Set 10[/u] [i]Deja vu?[/i] [b]p28. [/b] Let $ABC$ be a triangle with incircle $\omega$. Let $\omega$ intersect sides $BC$, $CA$, $AB$ at $D, E, F$, respectively. Suppose $AB = 7$, $BC = 12$, and $CA = 13$. If the area of $ABC$ is $K$ and the area of $DEF$ is $\frac{m}{n}\cdot K$, where $m$ and $n$ are relatively prime positive integers, then compute $m + n$. [b]p29.[/b] Sebastian is playing the game Split! again, but this time in a three dimensional coordinate system. He begins the game with one token at $(0, 0, 0)$. For each move, he is allowed to select a token on any point $(x, y, z)$ and take it off, replacing it with three tokens, one at $(x + 1, y, z)$, one at $(x, y + 1, z)$, and one at $(x, y, z + 1)$ At the end of the game, for a token on $(a, b, c)$, it is assigned a score $\frac{1}{2^{a+b+c}}$ . These scores are summed for his total score. If the highest total score Sebastian can get in $100$ moves is $m/n$, then determine $m + n$. [b]p30.[/b] Determine the number of positive $6$ digit integers that satisfy the following properties: $\bullet$ All six of their digits are $1, 5, 7$, or $8$, $\bullet$ The sum of all the digits is a multiple of $5$. [u]Set 11[/u] [b]p31.[/b] The triangular numbers are defined as $T_n =\frac{n(n+1)}{2}$. We also define $S_n =\frac{n(n+2)}{3}$. If the sum $$\sum_{i=16}^{32} \left(\frac{1}{T_i}+\frac{1}{S_i}\right)= \left(\frac{1}{T_{16}}+\frac{1}{S_{16}}\right)+\left(\frac{1}{T_{17}}+\frac{1}{S_{17}}\right)+...+\left(\frac{1}{T_{32}}+\frac{1}{S_{32}}\right)$$ can be written in the form $a/b$ , where $a$ and $b$ are positive integers with $gcd(a, b) = 1$, then find $a + b$. [b]p32.[/b] Farmer Will is considering where to build his house in the Cartesian coordinate plane. He wants to build his house on the line $y = x$, but he also has to minimize his travel time for his daily trip to his barnhouse at $(24, 15)$ and back. From his house, he must first travel to the river at $y = 2$ to fetch water for his animals. Then, he heads for his barnhouse, and promptly leaves for the long strip mall at the line $y =\sqrt3 x$ for groceries, before heading home. If he decides to build his house at $(x_0, y_0)$ such that the distance he must travel is minimized, $x_0$ can be written in the form $\frac{a\sqrt{b}-c}{d}$ , where $a, b, c, d$ are positive integers, $b$ is not divisible by the square of a prime, and $gcd(a, c, d) = 1$. Compute $a+b+c+d$. [b]p33.[/b] Determine the greatest positive integer $n$ such that the following two conditions hold: $\bullet$ $n^2$ is the difference of consecutive perfect cubes; $\bullet$ $2n + 287$ is the square of an integer. [u]Set 12[/u] The answers to these problems are nonnegative integers that may exceed $1000000$. You will be awarded points as described in the problems. [b]p34.[/b] The “Collatz sequence” of a positive integer n is the longest sequence of distinct integers $(x_i)_{i\ge 0}$ with $x_0 = n$ and $$x_{n+1} =\begin{cases} \frac{x_n}{2} & if \,\, x_n \,\, is \,\, even \\ 3x_n + 1 & if \,\, x_n \,\, is \,\, odd \end{cases}.$$ It is conjectured that all Collatz sequences have a finite number of elements, terminating at $1$. This has been confirmed via computer program for all numbers up to $2^{64}$. There is a unique positive integer $n < 10^9$ such that its Collatz sequence is longer than the Collatz sequence of any other positive integer less than $10^9$. What is this integer $n$? An estimate of $e$ gives $\max\{\lfloor 32 - \frac{11}{3}\log_{10}(|n - e| + 1)\rfloor, 0\}$ points. [b]p35.[/b] We define a graph $G$ as a set $V (G)$ of vertices and a set $E(G)$ of distinct edges connecting those vertices. A graph $H$ is a subgraph of $G$ if the vertex set $V (H)$ is a subset of $V (G)$ and the edge set $E(H)$ is a subset of $E(G)$. Let $ex(k, H)$ denote the maximum number of edges in a graph with $k$ vertices without a subgraph of $H$. If $K_i$ denotes a complete graph on $i$ vertices, that is, a graph with $i$ vertices and all ${i \choose 2}$ edges between them present, determine $$n =\sum_{i=2}^{2018} ex(2018, K_i).$$ An estimate of $e$ gives $\max\{\lfloor 32 - 3\log_{10}(|n - e| + 1)\rfloor, 0\}$ points. [b]p36.[/b] Write down an integer between $1$ and $100$, inclusive. This number will be denoted as $n_i$ , where your Team ID is $i$. Let $S$ be the set of Team ID’s for all teams that submitted an answer to this problem. For every ordered triple of distinct Team ID’s $(a, b, c)$ such that a, b, c ∈ S, if all roots of the polynomial $x^3 + n_ax^2 + n_bx + n_c$ are real, then the teams with ID’s $a, b, c$ will each receive one virtual banana. If you receive $v_b$ virtual bananas in total and $|S| \ge 3$ teams submit an answer to this problem, you will be awarded $$\left\lfloor \frac{32v_b}{3(|S| - 1)(|S| - 2)}\right\rfloor$$ points for this problem. If $|S| \le 2$, the team(s) that submitted an answer to this problem will receive $32$ points for this problem. PS. You had better use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c4h2777264p24369138]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n \ge 5$ be an integer and let $x_1, x_2, ... , x_n$ be $n$ distinct integer numbers such that no $3$ of them can be in arithmetic progression. Prove that if for all $1 \le i, j \le n$ we have $$2|x_i - x_j | \le n(n - 1)$$ then there exist $4$ distinct indices $i, j, k, l \in \{1, 2, ... , n\}$ such that $$x_i + x_j = x_k + x_l.$$