The target below is made up of concentric circles with diameters $4$, $8$, $12$, $16$, and $20$. The area of the dark region is $n\pi$. Find $n$. [asy] size(150); defaultpen(linewidth(0.8)); int i; for(i=5;i>=1;i=i-1) { if (floor(i/2)==i/2) { filldraw(circle(origin,4*i),white); } else { filldraw(circle(origin,4*i),red); } } [/asy]

The game of [b]Hive [/b]is played on a regular hexagonal grid (as shown in the figure) by 3 players. The grid consists of $k$ layers (where $k$ is a natural number) surrounding a regular hexagon, with each layer constructed around the previous layer. The figure below shows a grid with 2 layers. The players, [i]Ali[/i], [i]Shayan[/i], and [i]Sajad[/i], take turns playing the game. In each turn, a player places a tile, similar to the one shown in the figure, on the empty cells of the grid (rotation of the tile is also allowed). The first player who is unable to place a tile on the grid loses the game. Prove that two players can collaborate in such a way that the third player always loses. Proposed by [size=110]Pouria Mahmoudkhan Shirazi[/size].

Let $P,Q,R,S$ be non constant polynomials with real coefficients, such that $P(Q(x))=R(S(x)) $ and the degree of $P$ is multiple of the degree of $R. $ Prove that there exists a polynomial $T$ with real coefficients such that $$\displaystyle P(x)=R(T(x))$$

Marie repeatedly flips a fair coin and stops after she gets tails for the second time. What is the expected number of times Marie flips the coin?

We have $4$ circles in plane such that any two of them are tangent to each other. we connect the tangency point of two circles to the tangency point of two other circles. Prove that these three lines are concurrent. [i]proposed by Masoud Nourbakhsh[/i]

The closed curve in the figure is made up of $9$ congruent circular arcs each of length $\frac{2\pi}{3}$, where each of the centers of the corresponding circles is among the vertices of a regular hexagon of side $2$. What is the area enclosed by the curve? [asy] size(170); defaultpen(fontsize(6pt)); dotfactor=4; label("$\circ$",(0,1)); label("$\circ$",(0.865,0.5)); label("$\circ$",(-0.865,0.5)); label("$\circ$",(0.865,-0.5)); label("$\circ$",(-0.865,-0.5)); label("$\circ$",(0,-1)); dot((0,1.5)); dot((-0.4325,0.75)); dot((0.4325,0.75)); dot((-0.4325,-0.75)); dot((0.4325,-0.75)); dot((-0.865,0)); dot((0.865,0)); dot((-1.2975,-0.75)); dot((1.2975,-0.75)); draw(Arc((0,1),0.5,210,-30)); draw(Arc((0.865,0.5),0.5,150,270)); draw(Arc((0.865,-0.5),0.5,90,-150)); draw(Arc((0.865,-0.5),0.5,90,-150)); draw(Arc((0,-1),0.5,30,150)); draw(Arc((-0.865,-0.5),0.5,330,90)); draw(Arc((-0.865,0.5),0.5,-90,30)); [/asy] $ \textbf{(A)}\ 2\pi+6\qquad\textbf{(B)}\ 2\pi+4\sqrt3 \qquad\textbf{(C)}\ 3\pi+4 \qquad\textbf{(D)}\ 2\pi+3\sqrt3+2 \qquad\textbf{(E)}\ \pi+6\sqrt3 $

[b]a)[/b] Show that there exists exactly a sequence $ \left( x_n,y_n \right)_{n\ge 0} $ of pairs of nonnegative integers, that satisfy the property that $ \left( 1+\sqrt 33 \right)^n=x_n+y_n\sqrt 33, $ for all nonegative integers $ n. $ [b]b)[/b] Having in mind the sequence from [b]a),[/b] prove that, for any natural prime $ p, $ at least one of the numbers $ y_{p-1} ,y_p $ and $ y_{p+1} $ are divisible by $ p. $

Find all functions $f : \mathbb{R} \to \mathbb{R}$ that satisfy the condition \[f(f(x) + y) = 2x + f(f(y) - x)\quad \text{ for all } x, y \in\mathbb{R}.\]

Let $ABCD$ be a cyclic quadrilateral so that $\overline{AC} \perp \overline{BD}$. Let $E$ be the intersection of $\overline{AC}$ and $\overline{BD}$, and let $F$ be the foot of the altitude from $E$ to $\overline{AB}$. Let $\overline{EF}$ intersect $\overline{CD}$ at $G$, and let the foot of the perpendiculars from $G$ to $\overline{AC}$ and $\overline{BD}$ be $H, I$ respectively. If $\overline{AB} = \sqrt{5}, \overline{BC} = \sqrt{10}, \overline{CD} = 3\sqrt{5}, \overline{DA} = 2\sqrt{10}$, find the length of $\overline{HI}$. [i]Proposed by Timothy Qian[/i]

Numbers $a, b$ and $c$ are positive integers and $\frac{1}{a}+\frac{1}{b}+\frac{ 1}{c}< 1.$ Show that \[\frac{1}{a}+\frac{1}{b}+\frac{ 1}{c}\leq \frac{41}{42}.\]

Fill in each of the ten boxes with a 3-digit number so that the following conditions are satisfied. [list=1] [*]Every number has three distinct digits that sum to $15$. $0$ may not be a leading digit. One digit of each number has been given to you. [*]No two numbers in any pair of boxes use the same three digits. For example, it is not allowed for two different boxes to have the numbers $456$ and $645$. [*]Two boxes joined by an arrow must have two numbers that share an equal hundreds digit, tens digit, or ones digit. Also, the smaller number must point to the larger.[/list] You do not need to prove that your configuration is the only one possible; you merely need to find a configuration that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.) [asy] size(200); defaultpen(linewidth(0.8)); path arrow; pair squares[]={(2,4),(6,4),(10,4),(0,0),(4,0),(8,0),(12,0),(2,-4),(6,-4),(10,-4)}; pair horizarrows[]={(4,4),(2,0),(6,0),(10,0),(4,-4),(8,-4)}; bool isLeft[]={false,false,true,false,false,false}; pair diagarrows[]={(1,2),(7,2),(9,2),(1,-2),(5,-2),(11,-2)}; bool isDown[]={true,false,true,false,false,true}; for(int i=0;i<=9;i=i+1) { draw(box(squares[i]-(1,1),squares[i]+(1,1))); label("$"+(string)i+"$",squares[i]); } for(int j=0;j<=5;j=j+1) { if(isLeft[j]) arrow=(horizarrows[j].x-1,horizarrows[j].y)--(horizarrows[j].x+1,horizarrows[j].y); else arrow=(horizarrows[j].x+1,horizarrows[j].y)--(horizarrows[j].x-1,horizarrows[j].y); draw(arrow,BeginArrow(size=7)); } for(int k=0;k<=5;k=k+1) { if(isDown[k]) arrow=(diagarrows[k].x-1/3,diagarrows[k].y-1)--(diagarrows[k].x+1/3,diagarrows[k].y+1); else arrow=(diagarrows[k].x-1/3,diagarrows[k].y+1)--(diagarrows[k].x+1/3,diagarrows[k].y-1); draw(arrow,BeginArrow(size=7)); } [/asy]

Given the sequence $(u_n)_{n=1}^{\infty}$, where $u_1 = 1, u_2 = 2$, and $u_{n + 2} = u_{n + 1} +u_ n+ \frac{(-1)^n-1}{2}$ for any positive integers $n$. Prove that every positive integers can be expressed as the sum of some distinguished numbers of the sequence of numbers $(u_n)_{n=1}^{\infty}$ Nguyen Duy Thai Son, The University of Danang, Da Nang.

In a convex quadrilateral $ABCD$, $\angle ABC = \angle ADC = 90^\circ$. A point $P$ is chosen from the diagonal $BD$ such that $\angle APB = 2\angle CPD$, points $X$, $Y$ is chosen from the segment $AP$ such that $\angle AXB = 2\angle ADB$, $\angle AYD = 2\angle ABD$. Prove that: $BD = 2XY$.

Find all nonnegative integers $x,y$ such that \[ 2 \cdot 3^{x} +1 = 7 \cdot 5^{y}. \]

Let $\{a_n\}$ be a sequence defined by $a_1=0$ and $$a_n=\frac{1}{n}+\frac{1}{\lceil \frac{n}{2} \rceil}\sum_{k=1}^{\lceil \frac{n}{2} \rceil}a_k$$ for any positive integer $n$. Find the maximal term of this sequence.

Let $P$ be a point chosen on the interior of side $\overline{BC}$ of triangle $\triangle ABC$ with side lengths $\overline{AB} = 10, \overline{BC} = 10, \overline{AC} = 12$. If $X$ and $Y$ are the feet of the perpendiculars from $P$ to the sides $AB$ and $AC$, then the minimum possible value of $PX^2 + PY^2$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by Andrew Wen[/i]

Each vertex of a convex polygon has integer coordinates, and no side of this polygon is horizontal or vertical. Prove that the sum of the lengths of the segments of lines of the form $x = m$, $m$ an integer, that lie within the polygon is equal to the sum of the lengths of the segments of lines of the form $y = n$, $n$ an integer, that lie within the polygon. (G Galperin)

Let $ABCD$ be a parallelogram. Let $M$ be the midpoint of the arc $AC$ containing $B$ of the circumcircle of $ABC$ . Let $E$ be a point on segment $AD$ and $F$ a point on segment $CD$ such that $ME=MD=MF$. Show that $BMEF$ is cyclic. [i]Proposed by A. Tereshin[/i]

Let $f$ be a smooth function on $\mathbb{R}^n$, denote by $G_f=\{(x,f(x)) \in \mathbb{R}^{n+1}: x \in \mathbb{R}^n\}$. Let $g$ be the restriction of the Euclidean metric on $G_f$. (1) Prove that $g$ is a complete metric. (2) If there exists $\Lambda>0$, such that $-\Lambda I_n \le \text{Hess}(f) \le \Lambda I_n$, where $I_n$ is the unit matrix of order $n$, and $\text{Hess}8f)$ is the Hessian matrix of $f$, then the injectivity radius of $(G_f,g)$ is at least $\frac{\pi}{2\Lambda}$.

Let $ABC$ an acute triangle and $D$ and $E$ the feet of heights by $A$ and $B$, respectively, and let $M$ be the midpoint of $AC$. The circle that passes through $D$ and $B$ and is tangent to $BE$ in $B$ intersects the line $BM$ in $F, F\neq B$. Show that $FM$ is the angle bisector of $\angle AFD$.

Suppose that $x, y, z$ are non-zero real numbers such that $$\begin{cases}x = 2 - \dfrac{y}{z} \\ \\ y = 2 -\dfrac{z}{x} \\ \\ z = 2 -\dfrac{x}{y}.\end{cases}$$ Find all possible values of $T = x + y + z$

Let $ABCC_1B_1A_1$ be a convex hexagon such that $AB=BC$, and suppose that the line segments $AA_1, BB_1$, and $CC_1$ have the same perpendicular bisector. Let the diagonals $AC_1$ and $A_1C$ meet at $D$, and denote by $\omega$ the circle $ABC$. Let $\omega$ intersect the circle $A_1BC_1$ again at $E \neq B$. Prove that the lines $BB_1$ and $DE$ intersect on $\omega$.

[b]p1.[/b] James has $8$ Instagram accounts, $3$ Facebook accounts, $4$ QQ accounts, and $3$ YouTube accounts. If each Instagram account has $19$ pictures, each Facebook account has $5$ pictures and $9$ videos, each QQ account has a total of $17$ pictures, and each YouTube account has $13$ videos and no pictures, how many pictures in total does James have in all these accounts? [b]p2.[/b] If Poonam can trade $7$ shanks for $4$ shinks, and she can trade $10$ shinks for $17$ shenks. How many shenks can Poonam get if she traded all of her $105$ shanks? [b]p3.[/b] Jerry has a bag with $3$ red marbles, $5$ blue marbles and $2$ white marbles. If Jerry randomly picks two marbles from the bag without replacement, the probability that he gets two different colors can be expressed as a fraction $\frac{m}{n}$ in lowest terms. What is $m + n$? [b]p4.[/b] Bob's favorite number is between $1200$ and $4000$, divisible by $5$, has the same units and hundreds digits, and the same tens and thousands digits. If his favorite number is even and not divisible by $3$, what is his favorite number? [b]p5.[/b] Consider a unit cube $ABCDEFGH$. Let $O$ be the center of the face $EFGH$. The length of $BO$ can be expressed in the form $\frac{\sqrt{a}}{b}$, where $a$ and $b$ are simplified to lowest terms. What is $a + b$? [b]p6.[/b] Mr. Eddie Wang is a crazy rich boss who owns a giant company in Singapore. Even though Mr. Wang appears friendly, he finds great joy in firing his employees. His immediately fires them when they say "hello" and/or "goodbye" to him. It is well known that $1/2$ of the total people say "hello" and/or "goodbye" to him everyday. If Mr. Wang had $2050$ employees at the end of yesterday, and he hires $2$ new employees at the beginning of each day, in how many days will Mr. Wang first only have $6$ employees left? [b]p7.[/b] In $\vartriangle ABC$, $AB = 5$, $AC = 6$. Let $D,E,F$ be the midpoints of $\overline{BC}$, $\overline{AC}$, $\overline{AB}$, respectively. Let $X$ be the foot of the altitude from $D$ to $\overline{EF}$. Let $\overline{AX}$ intersect $\overline{BC}$ at $Y$ . Given $DY = 1$, the length of $BC$ is $\frac{p}{q}$ for relatively prime positive integers $p, q$: Find $p + q$. [b]p8.[/b] Given $\frac{1}{2006} = \frac{1}{a} + \frac{1}{b}$ where $a$ is a $4$ digit positive integer and $b$ is a $6$ digit positive integer, find the smallest possible value of $b$. [b]p9.[/b] Pocky the postman has unlimited stamps worth $5$, $6$ and $7$ cents. However, his post office has two very odd requirements: On each envelope, an odd number of $7$ cent stamps must be used, and the total number of stamps used must also be odd. What is the largest amount of postage money Pocky cannot make with his stamps, in cents? [b]p10.[/b] Let $ABCDEF$ be a regular hexagon with side length $2$. Let $G$ be the midpoint of side $DE$. Now let $O$ be the intersection of $BG$ and $CF$. The radius of the circle inscribed in triangle $BOC$ can be expressed in the form $\frac{a\sqrt{b}-\sqrt{c}}{d} $ where $a$, $b$, $c$, $d$ are simplified to lowest terms. What is $a + b + c + d$? [b]p11.[/b] Estimation (Tiebreaker): What is the total number of characters in all of the participants' email addresses in the Accuracy Round? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Nine identical spheres of radius $r$ are packed into a unit cube. One sphere is centered at the center of the cube and is tangent to the other eight spheres, each of which is located in a corner of the cube and is tangent to three faces of the cube. Compute the radius of the spheres $r$.

The circumference of a circle is arbitrarily divided into four arcs. The midpoints of the arcs are connected by segments. Show that two of these segments are perpendicular.