Three identical circles are packed into a unit square. Each of the three circles are tangent to each other and tangent to at least one side of the square. If $r$ is the maximum possible radius of the circle, what is $(2-\tfrac{1}{r})^2$?

For a positive integer $n$, denote $c_n=2017^n$. A function $f: \mathbb{N} \rightarrow \mathbb{R}$ satisfies the following two conditions. 1. For all positive integers $m, n$, $f(m+n) \le 2017 \cdot f(m) \cdot f(n+325)$. 2. For all positive integer $n$, we have $0<f(c_{n+1})<f(c_n)^{2017}$. Prove that there exists a sequence $a_1, a_2, \cdots $ which satisfies the following. For all $n, k$ which satisfies $a_k<n$, we have $f(n)^{c_k} < f(c_k)^n$.

Let $ P$ be a point in the interior of a convex $ n$-gon $ A_1 A_2 ... A_n$ $ (n \ge 3)$. Show that among the angles $ \beta _{ij}\equal{}\angle A_i P A_j,1 \le i \le n$, there are at least $ n\minus{}1$ angles satisfying $ 90^{\circ} \le \beta_{ij} \le 180^{\circ}$.

Given any triangle, show that we can always pick a point on each side so that the three points form an equilateral triangle with area at most one quarter of the original triangle.

Let $ABC$ be a triangle and let $X$ and $Y$ be points on the $A$-symmedian such that $AX = XB$ and $AY = YC$. Let $BX$ and $CY$ meet at $Z$. Let the $Z$-excircle of triangle $XYZ$ touch $ZX$ and $ZY$ at $E$ and $F$. Show that $A$, $E$, $F$ are collinear.

Does there exist an integer having the form $444...4443$ (all fours, and ending with a three) that is divisible by $13$? If so, give an integer having that form that is divisible by $13$, if not, prove that such an integer cannot exist.

Divide a segment in halves using a right triangle. (With a right triangle one can draw straight lines and erect perpendiculars but cannot draw perpendiculars.)

Let a polynomial $f(x)$ be given with real coefficients and has degree greater or equal than 1. Show that for every real number $c > 0$, there exists a positive integer $n_0$ satisfying the following condition: if polynomial $P(x)$ of degree greater or equal than $n_0$ with real coefficients and has leading coefficient equal to 1 then the number of integers $x$ for which $|f(P(x))| \leq c$ is not greater than degree of $P(x)$.

[b]p1.[/b] Eric is playing Brawl Stars. If he starts playing at $11:10$ AM, and plays for $2$ hours total, then how many minutes past noon does he stop playing? [b]p2.[/b] James is making a mosaic. He takes an equilateral triangle and connects the midpoints of its sides. He then takes the center triangle formed by the midsegments and connects the midpoints of its sides. In total, how many equilateral triangles are in James’ mosaic? [b]p3.[/b] What is the greatest amount of intersections that $3$ circles and $3$ lines can have, given that they all lie on the same plane? [b]p4.[/b] In the faraway land of Arkesia, there are two types of currencies: Silvers and Gold. Each Silver is worth $7$ dollars while each Gold is worth $17$ dollars. In Daniel’s wallet, the total dollar value of the Silvers is $1$ more than that of the Golds. What is the smallest total dollar value of all of the Silvers and Golds in his wallet? [b]p5.[/b] A bishop is placed on a random square of a $8$-by-$8$ chessboard. On average, the bishop is able to move to $s$ other squares on the chessboard. Find $4s$. Note: A bishop is a chess piece that can move diagonally in any direction, as far as it wants. [b]p6.[/b] Andrew has a certain amount of coins. If he distributes them equally across his $9$ friends, he will have $7$ coins left. If he apportions his coins for each of his $15$ classmates, he will have $13$ coins to spare. If he splits the coins into $4$ boxes for safekeeping, he will have $2$ coins left over. What is the minimum number of coins Andrew could have? [b]p7.[/b] A regular polygon $P$ has three times as many sides as another regular polygon $Q$. The interior angle of $P$ is $16^o$ greater than the interior angle of $Q$. Compute how many more diagonals $P$ has compared to $Q$. [b]p8.[/b] In an certain airport, there are three ways to switch between the ground floor and second floor that are 30 meters apart: either stand on an escalator, run on an escalator, or climb the stairs. A family on vacation takes 65 seconds to climb up the stairs. A solo traveller late for their flight takes $25$ seconds to run upwards on the escalator. The amount of time (in seconds) it takes for someone to switch floors by standing on the escalator can be expressed as $\frac{u}{v}$ , where $u$ and $v$ are relatively prime. Find $u + v$. (Assume everyone has the same running speed, and the speed of running on an escalator is the sum of the speeds of riding the escalator and running on the stairs.) [b]p9.[/b] Avanish, being the studious child he is, is taking practice tests to improve his score. Avanish has a $60\%$ chance of passing a practice test. However, whenever Avanish passes a test, he becomes more confident and instead has a $70\%$ chance of passing his next immediate test. If Avanish takes $3$ practice tests in a row, the expected number of practice tests Avanish will pass can be expressed as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime. Find $a + b$. [b]p10.[/b] Triangle $\vartriangle ABC$ has sides $AB = 51$, $BC = 119$, and $AC = 136$. Point $C$ is reflected over line $\overline{AB}$ to create point $C'$. Next, point $B$ is reflected over line $\overline{AC'}$ to create point $B'$. If $[B'C'C]$ can be expressed in the form of $a\sqrt{b}$, where $b$ is not divisible by any perfect square besides $1$, find $a + b$. [b]p11[/b]. Define the following infinite sequence $s$: $$s = \left\{\frac{1}{1},\frac{1}{1 + 3},\frac{1}{1 + 3 + 6}, ... ,\frac{1}{1 + 3 + 6 + ...+ t_k},...\right\},$$ where $t_k$ denotes the $k$th triangular number. The sum of the first $2024$ terms of $s$, denoted $S$, can be expressed as $$S = 3 \left(\frac{1}{2}+\frac{1}{a}-\frac{1}{b}\right),$$ where $a$ and $b$ are positive integers. Find the minimal possible value of $a + b$. [b]p12.[/b] Omar writes the numbers from $1$ to $1296$ on a whiteboard and then converts each of them into base $6$. Find the sum of all of the digits written on the whiteboard (in base $10$), including both the base $10$ and base $6$ numbers. [b]p13.[/b] A mountain number is a number in a list that is greater than the number to its left and right. Let $N$ be the amount of lists created from the integers $1$ - $100$ such that each list only has one mountain number. $N$ can be expressed as $$N = 2^a(2^b - c^2),$$ where $a$, $b$ and $c$ are positive integers and $c$ is not divisible by $2$. Find $a + b+c$. (The numbers at the beginning or end of a list are not considered mountain numbers.)[hide]Original problem was voided because the original format of the answer didn't match the result's format. So I changed it in the wording, in order the problem to be correct[/hide] [b]p14.[/b] A circle $\omega$ with center $O$ has a radius of $25$. Chords $\overline{AB}$ and $\overline{CD}$ are drawn in $\omega$ , intersecting at $X$ such that $\angle BXC = 60^o$ and $AX > BX$. Given that the shortest distance of $O$ with $\overline{AB}$ and $\overline{CD}$ is $7$ and $15$ respectively, the length of $BX$ can be expressed as $x - \frac{y}{\sqrt{z}}$ , where $x$, $y$, and $z$ are positive integers such that $z$ is not divisible by any perfect square. Find $x + y + z.$ [hide]two answers were considered correct according to configuration[/hide] [b]p15.[/b] How many ways are there to split the first $10$ natural numbers into $n$ sets (with $n \ge 1$) such that all the numbers are used and each set has the same average? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine the minimum value of $a^{2} + b^{2}$ when $(a,b)$ traverses all the pairs of real numbers for which the equation \[ x^{4} + ax^{3} + bx^{2} + ax + 1 = 0 \] has at least one real root.

Let $AD$ be the inner angle bisector of the triangle $ABC$. The perpendicular on the side $BC$ at the point $D$ intersects the outer bisector of $\angle CAB$ at point $I$. The circle with center $I$ and radius $ID$ intersects the sides $AB$ and $AC$ at points $F$ and $E$ respectively. $A$-symmedian of $\Delta AFE$ intersects the circumcircle of $\Delta AFE$ again at point $X$. Prove that the circumcircles of $\Delta AFE$ and $\Delta BXC$ are tangent.

Each of the $36$ squares of a $6 \times 6$ table is to be coloured either Red, Yellow or Blue. (a) No row or column is contain more than two squares of the same colour. (b) In any four squares obtained by intersecting two rows with two columns, no colour is to occur exactly three times. In how many dierent ways can the table be coloured if both of these rules are to be respected?

For each integer $n\geq 1$, let $S_n$ be the set of integers $k > n$ such that $k$ divides $30n-1$. How many elements of the set \[\mathcal{S} = \bigcup_{i\geq 1}S_i = S_1\cup S_2\cup S_3\cup\ldots\] are less than $2016$?

Find all positive numbers $x$ such that $20\{x\}+0.5\lfloor x\rfloor = 2005$.

Find x, y, z $\in Z$\\$x^2+y^2+z^2=2^n(x+y+z)$\\$n\in N$

Right triangle $\vartriangle ABC$ with its right angle at $B$ has angle bisector $\overline{AD}$ with $D$ on $\overline{BC}$, as well as altitude $\overline{BE}$ with $E$ on $\overline{AC}$. If $\overline{DE} \perp \overline{BC}$ and $AB = 1$, compute $AC$.

Find all triples $(p,M, z)$ of integers, where $p$ is prime, $m$ is positive and $z$ is negative, that satisfy the equation $$p^3 + pm + 2zm = m^2 + pz + z^2$$

Let $a_1,a_2,\cdots,a_n$ be a sequence of positive numbers, so that $a_1 + a_2 +\cdots + a_n \leq \frac 12$. Prove that \[(1 + a_1)(1 + a_2) \cdots (1 + a_n) < 2.\] [hide="Remark"]Remark. I think this problem was posted before, but I can't find the link now.[/hide]

Construct a geometric gure in a sequence of steps. In step $1$, begin with a $4\times 4$ square. In step $2$, attach a $1\times 1$ square onto the each side of the original square so that the new squares are on the outside of the original square, have a side along the side of the original square, and the midpoints of the sides of the original square and the attached square coincide. In step $3$, attach a $\frac14\times  \frac14$ square onto the centers of each of the $3$ exposed sides of each of the $4$ squares attached in step $2$. For each positive integer $n$, in step $n + 1$, attach squares whose sides are $\frac14$ as long as the sides of the squares attached in step n placing them at the centers of the $3$ exposed sides of the squares attached in step $n$. The diagram shows the gure after step $4$. If this is continued for all positive integers $n$, the area covered by all the squares attached in all the steps is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [img]https://cdn.artofproblemsolving.com/attachments/2/1/d963460373b56906e93c4be73bc6a15e15d0d6.png[/img]

Given the list \[A=[9,12,1,20,17,4,10,7,15,8,13,14],\] we would like to sort it in increasing order. To accomplish this, we will perform the following operation repeatedly: remove an element, then insert it at any position in the list, shifting elements if necessary. What is the minimum number of applications of this operation necessary to sort $A$?

[b]p1.[/b] A right triangle has a hypotenuse of length $25$ and a leg of length $16$. Compute the length of the other leg of this triangle. [b]p2.[/b] Tanya has a circular necklace with $5$ evenly-spaced beads, each colored red or blue. Find the number of distinct necklaces in which no two red beads are adjacent. If a necklace can be transformed into another necklace through a series of rotations and reflections, then the two necklaces are considered to be the same. [b]p3.[/b] Find the sum of the digits in the decimal representation of $10^{2016} - 2016$. [b]p4.[/b] Let $x$ be a real number satisfying $$x^1 \cdot x^2 \cdot x^3 \cdot x^4 \cdot x^5 \cdot x^6 = 8^7.$$ Compute the value of $x^7$. [b]p5.[/b] What is the smallest possible perimeter of an acute, scalene triangle with integer side lengths? [b]p6.[/b] Call a sequence $a_1, a_2, a_3,..., a_n$ mountainous if there exists an index $t$ between $1$ and $n$ inclusive such that $$a_1 \le a_2\le ... \le a_t \,\,\,\, and \,\,\,\, a_t \ge a_{t+1} \ge ... \ge a_n$$ In how many ways can Bishal arrange the ten numbers $1$, $1$, $2$, $2$, $3$, $3$, $4$, $4$, $5$, and $5$ into a mountainous sequence? (Two possible mountainous sequences are $1$, $1$, $2$, $3$, $4$, $4$, $5$, $5$, $3$, $2$ and $5$, $5$, $4$, $4$, $3$, $3$, $2$, $2$, $1$, $1$.) [b]p7.[/b] Find the sum of the areas of all (non self-intersecting) quadrilaterals whose vertices are the four points $(-3,-6)$, $(7,-1)$, $(-2, 9)$, and $(0, 0)$. [b]p8.[/b] Mohammed Zhang's favorite function is $f(x) =\sqrt{x^2 - 4x + 5} +\sqrt{x^2 + 4x + 8}$. Find the minumum possible value of $f(x)$ over all real numbers $x$. [b]p9.[/b] A segment $AB$ with length $1$ lies on a plane. Find the area of the set of points $P$ in the plane for which $\angle APB$ is the second smallest angle in triangle $ABP$. [b]p10.[/b] A binary string is a dipalindrome if it can be produced by writing two non-empty palindromic strings one after the other. For example, $10100100$ is a dipalindrome because both $101$ and $00100$ are palindromes. How many binary strings of length $18$ are both palindromes and dipalindromes? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $\forall x\in \mathbb{R} \ \ f(x) = max(2xy-f(y))$ where $y\in \mathbb{R}$.

The plane has been partitioned into $N$ regions by three bunches of parallel lines. What is the least number of lines needed in order that $N > 1981$?

There are given $20$ points in the plane, no three of which lie on a single line. Prove that there exist at least $969$ quadrilaterals with vertices from the given points.

Mattis is hosting a badminton tournament for $40$ players on $20$ courts numbered from $1$ to $20$. The players are distributed with $2$ players on each court. In each round a winner is determined on each court. Afterwards, the player who lost on court $1$, and the player who won on court $20$ stay in place. For the remaining $38$ players, the winner on court $i$ moves to court $i + 1$ and the loser moves to court $i - 1$. The tournament continues until every player has played every other player at least once. What is the minimal number of rounds the tournament can last?