In $\triangle ABC$, shown on the right, let $r$ denote the radius of the inscribed circle, and let $r_A$, $r_B$, and $r_C$ denote the radii of the smaller circles tangent to the inscribed circle and to the sides emanating from $A$, $B$, and $C$, respectively. Prove that $r \leq r_A + r_B + r_C$

Find all the real number triples $(x, y, z)$ satisfying the following system of inequalities under the condition $0 < x, y, z < \sqrt{2}$: $$y\sqrt{4-x^2y^2}\ge \frac{2}{\sqrt{xz}}$$ $$x\sqrt{4-x^2z^2}\ge \frac{2}{\sqrt{yz}}$$ $$z\sqrt{4-y^2z^2}\ge \frac{2}{\sqrt{xy}}$$.

Let $C, B, E$ be three points on a straight line $\ell$ in that order. Suppose that $A$ and $D$ are two points on the same side of $\ell$ such that (i) $\angle ACE = \angle CDE = 90^o$ and (ii) $CA = CB = CD$. Let $F$ be the point of intersection of the segment $AB$ and the circumcircle of $\vartriangle ADC$. Prove that $F$ is the incentre of $\vartriangle CDE$.

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]

Let the inequality $$Aa(Bb + Cc) + Bb(Aa + Cc) + Cc(Aa + Bb) > \frac{ABc^2 + BCa^2 + CAb^2}{2}$$ with given $a > 0, b > 0, c > 0$ hold for all $A > 0, B > 0, C > 0$. Is it possible to construct a triangle with sides of lengths $a, b, c$?

[u]Set 1[/u] [b]B1.[/b] Evaluate $2 + 0 - 2 \times 0$. [b]B2.[/b] It takes four painters four hours to paint four houses. How many hours does it take forty painters to paint forty houses? [b]B3.[/b] Let $a$ be the answer to this question. What is $\frac{1}{2-a}$? [u]Set 2[/u] [b]B4.[/b] Every day at Andover is either sunny or rainy. If today is sunny, there is a $60\%$ chance that tomorrow is sunny and a $40\%$ chance that tomorrow is rainy. On the other hand, if today is rainy, there is a $60\%$ chance that tomorrow is rainy and a $40\%$ chance that tomorrow is sunny. Given that today is sunny, the probability that the day after tomorrow is sunny can be expressed as n%, where n is a positive integer. What is $n$? [b]B5.[/b] In the diagram below, what is the value of $\angle DD'Y$ in degrees? [img]https://cdn.artofproblemsolving.com/attachments/0/8/6c966b13c840fa1885948d0e4ad598f36bee9d.png[/img] [b]B6.[/b] Christina, Jeremy, Will, and Nathan are standing in a line. In how many ways can they be arranged such that Christina is to the left of Will and Jeremy is to the left of Nathan? Note: Christina does not have to be next to Will and Jeremy does not have to be next to Nathan. For example, arranging them as Christina, Jeremy, Will, Nathan would be valid. [u]Set 3[/u] [b]B7.[/b] Let $P$ be a point on side $AB$ of square $ABCD$ with side length $8$ such that $PA = 3$. Let $Q$ be a point on side $AD$ such that $P Q \perp P C$. The area of quadrilateral $PQDB$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]B8.[/b] Jessica and Jeffrey each pick a number uniformly at random from the set $\{1, 2, 3, 4, 5\}$ (they could pick the same number). If Jessica’s number is $x$ and Jeffrey’s number is $y$, the probability that $x^y$ has a units digit of $1$ can be expressed as $m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]B9.[/b] For two points $(x_1, y_1)$ and $(x_2, y_2)$ in the plane, we define the taxicab distance between them as $|x_1 - x_2| + |y_1 - y_2|$. For example, the taxicab distance between $(-1, 2)$ and $(3,\sqrt2)$ is $6-\sqrt2$. What is the largest number of points Nathan can find in the plane such that the taxicab distance between any two of the points is the same? [u]Set 4[/u] [b]B10.[/b] Will wants to insert some × symbols between the following numbers: $$1\,\,\,2\,\,\,3\,\,\,4\,\,\,6$$ to see what kinds of answers he can get. For example, here is one way he can insert $\times$ symbols: $$1 \times 23 \times 4 \times 6 = 552.$$ Will discovers that he can obtain the number $276$. What is the sum of the numbers that he multiplied together to get $276$? [b]B11.[/b] Let $ABCD$ be a parallelogram with $AB = 5$, $BC = 3$, and $\angle BAD = 60^o$ . Let the angle bisector of $\angle ADC$ meet $AC$ at $E$ and $AB$ at $F$. The length $EF$ can be expressed as $m/n$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? [b]B12.[/b] Find the sum of all positive integers $n$ such that $\lfloor \sqrt{n^2 - 2n + 19} \rfloor = n$. Note: $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$. [u]Set 5[/u] [b]B13.[/b] This year, February $29$ fell on a Saturday. What is the next year in which February $29$ will be a Saturday? [b]B14.[/b] Let $f(x) = \frac{1}{x} - 1$. Evaluate $$f\left( \frac{1}{2020}\right) \times f\left( \frac{2}{2020}\right) \times f\left( \frac{3}{2020}\right) \times \times ... \times f\left( \frac{2019}{2020}\right) .$$ [b]B15.[/b] Square $WXYZ$ is inscribed in square $ABCD$ with side length $1$ such that $W$ is on $AB$, $X$ is on $BC$, $Y$ is on $CD$, and $Z$ is on $DA$. Line $W Y$ hits $AD$ and $BC$ at points $P$ and $R$ respectively, and line $XZ$ hits $AB$ and $CD$ at points $Q$ and $S$ respectively. If the area of $WXYZ$ is $\frac{13}{18}$ , then the area of $PQRS$ can be expressed as $m/n$ for relatively prime positive integers $m$ and $n$. What is $m + n$? PS. You had better use hide for answers. Last sets have been posted [url=https://artofproblemsolving.com/community/c4h2777424p24371574]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Minor base $BC$ of trapezoid $ABCD$ is equal to side $AB$, and diagonal $AC$ is equal to base $AD$. The line passing through B and parallel to $AC$ intersects line $DC$ in point $M$. Prove that $AM$ is the bisector of angle $\angle BAC$. A.Blinkov, Y.Blinkov

Through the midpoints of the sides of the triangle $T$, straight lines are drawn perpendicular to the bisectors of the opposite angles of the triangle. These lines formed a triangle $T_1$. Prove that the center of the circle circumscribed about $T_1$ is in the midpoint of the segment formed by the center of the inscribed circle and the intersection point of the heights of triangle $T$.

$8$ singers take part in a festival. The organiser wants to plan $m$ concerts. For every concert there are $4$ singers who go on stage, with the restriction that the times of which every two singers go on stage in a concert are all equal. Find a schedule that minimises $m$.

A sequence $a_0, a_1, \dots , a_n, \dots$ of positive integers is constructed as follows: [list] [*] If the last digit of $a_n$ is less than or equal to $5$, then this digit is deleted and $a_{n+1}$ is the number consisting of the remaining digits. (If $a_{n+1}$ contains no digits, the process stops.) [*] Otherwise, $a_{n+1}= 9a_n$. [/list] Can one choose $a_0$ so that this sequence is infinite?

Let $a_{n}$ be the last nonzero digit in the decimal representation of the number $n!$. Does the sequence $a_{1}$, $a_{2}$, $a_{3}$, $\cdots$ become periodic after a finite number of terms?

Let $ABCD$ be a convex quadrilateral, and let $P$, $Q$, $R$, and $S$ be points on the sides $AB$, $BC$, $CD$, and $DA$, respectively. Let the line segment $PR$ and $QS$ meet at $O$. Suppose that each of the quadrilaterals $APOS$, $BQOP$, $CROQ$, and $DSOR$ has an incircle. Prove that the lines $AC$, $PQ$, and $RS$ are either concurrent or parallel to each other.

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Circle $O$ has three chords, $AD$, $DF$, and $EF$. Point E lies along the arc $AD$. Point $C$ is the intersection of chords $AD$ and $EF$. Point $B$ lies on segment $AC$ such that $EB = EC = 8$. Given $AB = 6$, $BC = 10$, and $CD = 9$, find $DF$. [img]https://cdn.artofproblemsolving.com/attachments/f/c/c36bff9ad04f13f7e227c57bddb53a0bfc0569.png[/img]

Let $C$ be a circle, $A_1 , A_2,\ldots ,A_n$ be distinct points inside $C$ and $B_1 , B_2 ,\ldots ,B_n$ be distinct points on $C$ such that no two of the segments $A_1B_1 , A_2 B_2 ,\ldots ,A_n B_n$ intersect. A grasshopper can jump from $A_r$ to $A_s$ if the line segment $A_r A_s$ does not intersect any line segment $A_t B_t (t \neq r, s)$. Prove that after a certain number of jumps, the grasshopper can jump from any $A_u$ to any $A_v$ .

An $n\times n$ Latin square is a $n\times n$ grid that is filled with $n$ $1$'s, $n$ $2$'s, $\dots$, and $n$ $n$'s such that each column and row of the grid contains exactly one of each $1$, $2$, $\dots$, $n$. For example, the following is a valid $2\times2$ Latin square: $\textstyle\begin{bmatrix}2&1\\1&2\end{bmatrix}$, but this is not: $\textstyle\begin{bmatrix}2&1\\2&1\end{bmatrix}$. How many $4\times4$ Latin squares are there?

Let $ABC$ be a triangle and $h_a$ be the altitude through $A$. Prove that \[ (b+c)^2 \geq a^2 + 4h_a ^2 . \]

[u]Round 1[/u] [b]p1.[/b] A box contains $1$ ball labelledW, $1$ ball labelled $E$, $1$ ball labelled $L$, $1$ ball labelled $C$, $1$ ball labelled $O$, $8$ balls labelled $M$, and $1$ last ball labelled $E$. One ball is randomly drawn from the box. The probability that the ball is labelled $E$ is $\frac{1}{a}$ . Find $a$. [b]p2.[/b] Let $$G +E +N = 7$$ $$G +E +O = 15$$ $$N +T = 22.$$ Find the value of $T +O$. [b]p3.[/b] The area of $\vartriangle LMT$ is $22$. Given that $MT = 4$ and that there is a right angle at $M$, find the length of $LM$. [u]Round 2[/u] [b]p4.[/b] Kevin chooses a positive $2$-digit integer, then adds $6$ times its unit digit and subtracts $3$ times its tens digit from itself. Find the greatest common factor of all possible resulting numbers. [b]p5.[/b] Find the maximum possible number of times circle $D$ can intersect pentagon $GRASS'$ over all possible choices of points $G$, $R$, $A$, $S$, and $S'$. [b]p6.[/b] Find the sum of the digits of the integer solution to $(\log_2 x) \cdot (\log_4 \sqrt{x}) = 36$. [u]Round 3[/u] [b]p7.[/b] Given that $x$ and $y$ are positive real numbers such that $x^2 + y = 20$, the maximum possible value of $x + y$ can be written as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a +b$. [b]p8.[/b] In $\vartriangle DRK$, $DR = 13$, $DK = 14$, and $RK = 15$. Let $E$ be the point such that $ED = ER = EK$. Find the value of $\lfloor DE +RE +KE \rfloor$. [b]p9.[/b] Subaru the frog lives on lily pad $1$. There is a line of lily pads, numbered $2$, $3$, $4$, $5$, $6$, and $7$. Every minute, Subaru jumps from his current lily pad to a lily pad whose number is either $1$ or $2$ greater, chosen at random from valid possibilities. There are alligators on lily pads $2$ and $5$. If Subaru lands on an alligator, he dies and time rewinds back to when he was on lily pad number $1$. Find how many times Subaru is expected to die before he reaches pad $7$. [u]Round 4[/u] [b]p10.[/b] Find the sum of the following series: $$\sum^{\infty}_{i=1} = \frac{\sum^i_{j=1} j}{2^i}=\frac{1}{2^1}+\frac{1+2}{2^2}+\frac{1+2+3}{2^3}+\frac{1+2+3+4}{2^4}+... $$ [b]p11.[/b] Let $\phi (x)$ be the number of positive integers less than or equal to $x$ that are relatively prime to $x$. Find the sum of all $x$ such that $\phi (\phi(x)) = x -3$. Note that $1$ is relatively prime to every positive integer. [b]p12.[/b] On a piece of paper, Kevin draws a circle. Then, he draws two perpendicular lines. Finally, he draws two perpendicular rays originating from the same point (an $L$ shape). What is the maximum number of sections into which the lines and rays can split the circle? [u]Round 5 [/u] [b]p13.[/b] In quadrilateral $ABCD$, $\angle A = 90^o$, $\angle C = 60^o$, $\angle ABD = 25^o$, and $\angle BDC = 5^o$. Given that $AB = 4\sqrt3$, the area of quadrilateral $ABCD$ can be written as $a\sqrt{b}$. Find $10a +b$. [b]p14.[/b] The value of $$\sum^6_{n=2} \left( \frac{n^4 +1}{n^4 -1}\right) -2 \sum^6_{n=2}\left(\frac{n^3 -n^2+n}{n^4 -1}\right)$$ can be written as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $100m+n$. [b]p15.[/b] Positive real numbers $x$ and $y$ satisfy the following $2$ equations. $$x^{1+x^{1+x^{1+...}}}= 8$$ $$\sqrt[24]{y +\sqrt[24]{y + \sqrt[24]{y +...}}} = x$$ Find the value of $\lfloor y \rfloor$. PS. You should use hide for answers. Rounds 6-9 have been posted [url=https://artofproblemsolving.com/community/c3h3167130p28823260]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The perimeter of triangle $ABC$ is $k$ times larger than side $BC$, $AB \ne AC$. In what ratio does the median to side $BC$ divide the diameter of the circle inscribed in this triangle, perpendicular to this side?

How many three-digit numbers are not divisible by $5$, have digits that sum to less than $20$, and have the first digit equal to the third digit? $\textbf{(A) }52\qquad \textbf{(B) }60\qquad \textbf{(C) }66\qquad \textbf{(D) }68\qquad \textbf{(E) }70\qquad$

Consider all the possible subsets of the set $\{1,2,..., N\}$ which do not contain any consecutive numbers. Prove that the sum of the squares of the products of the numbers in these subsets is $(N + 1)! - 1$. (Based on idea of R.P. Stanley)

Marc has an $n\times n$ board, where $n\ge 3$ is an integer, and an unlimited supply of green and red apples. Marc wants to place some apples on the board, so that the following conditions hold. [list] [*] Every cell of the board has exactly one apple, be it red or green. [*] All rows and columns of the board have at least one red apple. [*] No two rows or columns have the same apple color sequence. Note that rows are read from left to right, and columns are read from top to bottom. Also note that we [b]do not[/b] allow a row and a column to have the same color sequence. [/list] Find, in terms of $n$, the minimal number of red apples that Marc needs in order to fill the board in this way.

Find the largest possible number of intersection points of the diagonals of a convex $n$-gon.

Evaluate the following $$\prod^{50}_{j=1} \left( 2 cos \left( \frac{4\pi j}{101} \right) + 1\right).$$

The ancient One-Dimensional Empire was located along a straight line. Initially, there were no cities. A total of $n$ different point-like cities were founded one by one; from the second onwards, each newly founded city and the nearest existing city (the older one, if there were two) were declared sister cities. The surviving map of the empire shows the cities and the distances between them, but not the order in which they were founded. Historians have tried to deduce from the map that each city had at most 41 sister cities. [list=a] [*] For $n=10^6$, give a map from which this deduction can be made. [*] Prove that for $n=10^{13}$, this conclusion cannot be drawn from any map. [/list]