In the figure, $ PA$ is tangent to semicircle $ SAR$; $ PB$ is tangent to semicircle $ RBT$; $ SRT$ is a straight line; the arcs are indicated in the figure. Angle $ APB$ is measured by: [asy]unitsize(1.2cm); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=3; pair O1=(0,0), O2=(3,0), Sp=(-2,0), R=(2,0), T=(4,0); pair A=O1+2*dir(60), B=O2+dir(85); pair Pa=rotate(90,A)*O1, Pb=rotate(-90,B)*O2; pair P=extension(A,Pa,B,Pb); pair[] dots={Sp,R,T,A,B,P}; draw(P--P+5*(A-P)); draw(P--P+5*(B-P)); clip((-2,0)--(-2,2.5)--(4,2.5)--(4,0)--cycle); draw(Arc(O1,2,0,180)--cycle); draw(Arc(O2,1,0,180)--cycle); dot(dots); label("$S$",Sp,S); label("$R$",R,S); label("$T$",T,S); label("$A$",A,NE); label("$B$",B,N); label("$P$",P,NNE); label("$a$",midpoint(Arc(O1,2,0,60)),SW); label("$b$",midpoint(Arc(O2,1,85,180)),SE); label("$c$",midpoint(Arc(O1,2,60,180)),SE); label("$d$",midpoint(Arc(O2,1,0,85)),SW);[/asy]$ \textbf{(A)}\ \frac {1}{2}(a \minus{} b) \qquad \textbf{(B)}\ \frac {1}{2}(a \plus{} b) \qquad \textbf{(C)}\ (c \minus{} a) \minus{} (d \minus{} b) \qquad \textbf{(D)}\ a \minus{} b \qquad \textbf{(E)}\ a \plus{} b$

In how many distinguishable ways can $10$ distinct pool balls be formed into a pyramid ($6$ on the bottom, $3$ in the middle, one on top), assuming that all rotations of the pyramid are indistinguishable?

Given any triangle $ABC$, show how to construct $A'$ on the side $AB$, $B'$ on the side $BC$ and $C'$ on the side $CA$, such that $ABC$ and $A'B'C'$ are similar (with $\angle A = \angle A', \angle B = \angle B', \angle C = \angle C'$) and $A'B'C'$ has the least possible area.

Three circles touch each other externally and all these cirlces also touch a fixed straight line. Let $A,B,C$ be the mutual points of contact of these circles. If $\omega$ denotes the Brocard angle of the triangle $ABC$, prove that $\cot{\omega}$ = 2.

Given two points $P,Q$ of the plane, denote $P+Q$ the midpoint of (possibly degenerate) segment $PQ$ and $P\cdot Q$ the image of $P$ in rotation around the origin $Q$ under $+90^\circ.$ a) Are these operations commutative? b) Given two distinct points $A,B$ the equation \[Y\cdot X=(A\cdot X)+B\] defines a map $X\mapsto Y.$ Determine what the mapping is. c) Construct all fixed points of the map from b).

There is a complex number $ z$ with imaginary part $ 164$ and a positive integer $ n$ such that \[ \frac {z}{z \plus{} n} \equal{} 4i. \]Find $ n$.

Given is a tetrahedron $ABCD$ in which $AB=CD$ and the sum of measures of the angles $BAD$ and $BCD$ equals $180$ degrees. Prove that the measure of the angle $BAD$ is larger than the measure of the angle $ADC$.

Given are three points $A(2,\ 0,\ 2),\ B(1,\ 1,\ 0),\ C(0,\ 0,\ 3)$ in the coordinate space. Find the volume of the solid of a triangle $ABC$ generated by a rotation about $z$-axis.

Let $A$, $B$ and $C$ be equidistant points on the circumference of a circle of unit radius centered at $O$, and let $P$ be any point in the circle's interior. Let $a$, $b$, $c$ be the distances from $P$ to $A$, $B$, $C$ respectively. Show that there is a triangle with side lengths $a$, $b$, $c$, and that the area of this triangle depends only on the distance from $P$ to $O$.

How many ways are there to color the $8$ regions of a three-set Venn Diagram with $3$ colors such that each color is used at least once? Two colorings are considered the same if one can be reached from the other by rotation and/or reflection.

Let $C$ be the part of the graph $y=\frac{1}{x}\ (x>0)$. Take a point $P\left(t,\ \frac{1}{t}\right)\ (t>0)$ on $C$. (i) Find the equation of the tangent $l$ at the point $A(1,\ 1)$ on the curve $C$. (ii) Let $m$ be the line passing through the point $P$ and parallel to $l$. Denote $Q$ be the intersection point of the line $m$ and the curve $C$ other than $P$. Find the coordinate of $Q$. (iii) Express the area $S$ of the part bounded by two line segments $OP,\ OQ$ and the curve $C$ for the origin $O$ in terms of $t$. (iv) Express the volume $V$ of the solid generated by a rotation of the part enclosed by two lines passing through the point $P$ and pararell to the $y$-axis and passing through the point $Q$ and pararell to $y$-axis, the curve $C$ and the $x$-axis in terms of $t$. (v) $\lim_{t\rightarrow 1-0} \frac{S}{V}.$

The parabola $\mathcal P$ given by equation $y=x^2$ is rotated some acute angle $\theta$ clockwise about the origin such that it hits both the $x$ and $y$ axes at two distinct points. Suppose the length of the segment $\mathcal P$ cuts the $x$-axis is $1$. What is the length of the segment $\mathcal P$ cuts the $y$-axis?

A plane contains points $ A$ and $ B$ with $ AB \equal{} 1$. Let $ S$ be the union of all disks of radius $ 1$ in the plane that cover $ \overline{AB}$. What is the area of $ S$? $ \textbf{(A)}\ 2\pi \plus{} \sqrt3 \qquad \textbf{(B)}\ \frac {8\pi}{3} \qquad \textbf{(C)}\ 3\pi \minus{} \frac {\sqrt3}{2} \qquad \textbf{(D)}\ \frac {10\pi}{3} \minus{} \sqrt3 \qquad \textbf{(E)}\ 4\pi \minus{} 2\sqrt3$

Let $T$ be the triangle in the coordinate plane with vertices $\left(0,0\right)$, $\left(4,0\right)$, and $\left(0,3\right)$. Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}$, $180^{\circ}$, and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.) $\textbf{(A) } 12\qquad\textbf{(B) } 15\qquad\textbf{(C) }17 \qquad\textbf{(D) }20 \qquad\textbf{(E) }25$

Rectangle $ PQRS$ lies in a plane with $ PQ = RS = 2$ and $ QR = SP = 6$. The rectangle is rotated $ 90^\circ$ clockwise about $ R$, then rotated $ 90^\circ$ clockwise about the point that $ S$ moved to after the first rotation. What is the length of the path traveled by point $ P$? ${ \textbf{(A)}\ (2\sqrt3 + \sqrt5})\pi \qquad \textbf{(B)}\ 6\pi \qquad \textbf{(C)}\ (3 + \sqrt {10})\pi \qquad \textbf{(D)}\ (\sqrt3 + 2\sqrt5)\pi \\ \textbf{(E)}\ 2\sqrt {10}\pi$

In a plane, there is an infinite triangular grid consists of equilateral triangles whose lengths of the sides are equal to $ 1$, call the vertices of the triangles the lattice points, call two lattice points are adjacent if the distance between the two points is equal to $ 1;$ A jump game is played by two frogs $ A,B,$ "A jump" is called if the frogs jump from the point which it is lying on to its adjacent point, " A round jump of $ A,B$" is called if first $ A$ jumps and then $ B$ by the following rules: Rule (1): $ A$ jumps once arbitrarily, then $ B$ jumps once in the same direction, or twice in the opposite direction; Rule (2): when $ A,B$ sits on adjacent lattice points, they carry out Rule (1) finishing a round jump, or $ A$ jumps twice continually, keep adjacent with $ B$ every time, and $ B$ rests on previous position; If the original positions of $ A,B$ are adjacent lattice points, determine whether for $ A$ and $ B$,such that the one can exactly land on the original position of the other after a finite round jumps.

We call a path Valid if i. It only comprises of the following kind of steps: A. $(x, y) \rightarrow (x + 1, y + 1)$ B. $(x, y) \rightarrow (x + 1, y - 1)$ ii. It never goes below the x-axis. Let $M(n)$ = set of all valid paths from $(0,0) $, to $(2n,0)$, where $n$ is a natural number. Consider a Valid path $T \in M(n)$. Denote $\phi(T) = \prod_{i=1}^{2n} \mu_i$, where $\mu_i$= a) $1$, if the $i^{th}$ step is $(x, y) \rightarrow (x + 1, y + 1)$ b) $y$, if the $i^{th} $ step is $(x, y) \rightarrow (x + 1, y - 1)$ Now Let $f(n) =\sum _{T \in M(n)} \phi(T)$. Evaluate the number of zeroes at the end in the decimal expansion of $f(2021)$

Let $A_1, A_2, A_3, \ldots, A_{12}$ be the vertices of a regular dodecagon. How many distinct squares in the plane of the dodecagon have at least two vertices in the set $\{A_1,A_2,A_3,\ldots,A_{12}\}?$

$d$ and $n$ are positive integers such that $d \mid n$. The n-number sets $(x_1, x_2, \cdots x_n)$ satisfy the following condition: (1) $0 \leq x_1 \leq x_2 \leq \cdots \leq x_n \leq n$ (2) $d \mid (x_1+x_2+ \cdots x_n)$ Prove that in all the n-number sets that meet the conditions, there are exactly half satisfy $x_n=n$.

Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$, $B(0,12)$, $C(16,0)$, $A'(24,18)$, $B'(36,18)$, and $C'(24,2)$. A rotation of $m$ degrees clockwise around the point $(x,y)$, where $0<m<180$, will transform $\triangle ABC$ to $\triangle A'B'C'$. Find $m+x+y$.

Let a positive integer $n$.Consider square table $3*3$.One use $n$ colors to color all cell of table such that each cell is colored by exactly one color. Two colored table is same if we can receive them from other by a rotation through center of $3*3$ table How many way to color this square table satifies above conditions.

Suppose circles $\mathit{W}_1$ and $\mathit{W}2$, with centres $\mathit{O}_1$ and $\mathit{O}_2$ respectively, intersect at points $\mathit{M}$ and $\mathit{N}$. Let the tangent on $\mathit{W}_2$ at point $\mathit{N}$ intersect $\mathit{W}_1$ for the second time at $\mathit{B}_1$. Similarly, let the tangent on $\mathit{W}_1$ at point $\mathit{N}$ intersect $\mathit{W}_2$ for the second time at $\mathit{B}_2$. Let $\mathit{A}_1$ be a point on $\mathit{W}_1$ which is on arc $\mathit{B}_1\mathit{N}$ not containing $\mathit{M}$ and suppose line $\mathit{A}_1\mathit{N}$ intersects $\mathit{W}_2$ at point $\mathit{A}_2$. Denote the incentres of triangles $\mathit{B}_1\mathit{A}_1\mathit{N}$ and $\mathit{B}_2\mathit{A}_2\mathit{N}$ by $\mathit{I}_1$ and $\mathit{I}_2$, respectively.* [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki, go to User:Azjps/geogebra */ import graph; size(10.1cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -0.9748626324969808, xmax = 13.38440254515721, ymin = 0.5680051903627492, ymax = 10.99430986899034; /* image dimensions */ pair O_2 = (7.682929606970993,6.084708172218866), O_1 = (2.180000000000002,6.760000000000007), M = (4.560858774883258,8.585242858926296), B_2 = (10.07334553576748,9.291873850408265), A_2 = (11.49301008867042,4.866805580476367), B_1 = (2.113311869970955,9.759258690628950), A_1 = (0.2203184186713625,4.488514120712773); /* draw figures */ draw(circle(O_2, 4.000000000000000)); draw(circle(O_1, 3.000000000000000)); draw((4.048892687647541,4.413249028538064)--B_2); draw(B_2--A_2); draw(A_2--(4.048892687647541,4.413249028538064)); draw((4.048892687647541,4.413249028538064)--B_1); draw(B_1--A_1); draw(A_1--(4.048892687647541,4.413249028538064)); /* dots and labels */ dot(O_2,dotstyle); label("$O_2$", (7.788512439159622,6.243082420501817), NE * labelscalefactor); dot(O_1,dotstyle); label("$O_1$", (2.298205165350667,6.929370829727937), NE * labelscalefactor); dot(M,dotstyle); label("$M$", (4.383466101076183,8.935444641311980), NE * labelscalefactor); dot((4.048892687647541,4.413249028538064),dotstyle); label("$N$", (3.855551940133015,3.761885864068922), NE * labelscalefactor); dot(B_2,dotstyle); label("$B_2$", (10.19052187145104,9.463358802255147), NE * labelscalefactor); dot(A_2,dotstyle); label("$A_2$", (11.80066006232771,4.659339937672310), NE * labelscalefactor); dot(B_1,dotstyle); label("$B_1$", (1.981456668784765,10.09685579538695), NE * labelscalefactor); dot(A_1,dotstyle); label("$A_1$", (0.08096568938935705,3.973051528446190), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy] Show that \[\angle\mathit{I}_1\mathit{MI}_2=\angle\mathit{O}_1\mathit{MO}_2.\] *[size=80]Given a triangle ABC, the incentre of the triangle is defined to be the intersection of the angle bisectors of A, B, and C. To avoid cluttering, the incentre is omitted in the provided diagram. Note also that the diagram serves only as an aid and is not necessarily drawn to scale.[/size]

Let $k$ be a positive integer. Two players $A$ and $B$ play a game on an infinite grid of regular hexagons. Initially all the grid cells are empty. Then the players alternately take turns with $A$ moving first. In his move, $A$ may choose two adjacent hexagons in the grid which are empty and place a counter in both of them. In his move, $B$ may choose any counter on the board and remove it. If at any time there are $k$ consecutive grid cells in a line all of which contain a counter, $A$ wins. Find the minimum value of $k$ for which $A$ cannot win in a finite number of moves, or prove that no such minimum value exists.

Let $A_1A_2A_3\dots A_{20}$ be a $20$-sided polygon $P$ in the plane, where all of the side lengths of $P$ are equal, the interior angle at $A_i$ measures $108$ degrees for all odd $i$, and the interior angle $A_i$ measures $216$ degrees for all even $i$. Prove that the lines $A_2A_8$, $A_4A_{10}$, $A_5A_{13}$, $A_6A_{16}$, and $A_7A_{19}$ all intersect at the same point. [asy] import graph; size(10cm); pair temp= (-1,0); pair A01 = (0,0); pair A02 = rotate(306,A01)*temp; pair A03 = rotate(144,A02)*A01; pair A04 = rotate(252,A03)*A02; pair A05 = rotate(144,A04)*A03; pair A06 = rotate(252,A05)*A04; pair A07 = rotate(144,A06)*A05; pair A08 = rotate(252,A07)*A06; pair A09 = rotate(144,A08)*A07; pair A10 = rotate(252,A09)*A08; pair A11 = rotate(144,A10)*A09; pair A12 = rotate(252,A11)*A10; pair A13 = rotate(144,A12)*A11; pair A14 = rotate(252,A13)*A12; pair A15 = rotate(144,A14)*A13; pair A16 = rotate(252,A15)*A14; pair A17 = rotate(144,A16)*A15; pair A18 = rotate(252,A17)*A16; pair A19 = rotate(144,A18)*A17; pair A20 = rotate(252,A19)*A18; dot(A01); dot(A02); dot(A03); dot(A04); dot(A05); dot(A06); dot(A07); dot(A08); dot(A09); dot(A10); dot(A11); dot(A12); dot(A13); dot(A14); dot(A15); dot(A16); dot(A17); dot(A18); dot(A19); dot(A20); draw(A01--A02--A03--A04--A05--A06--A07--A08--A09--A10--A11--A12--A13--A14--A15--A16--A17--A18--A19--A20--cycle); label("$A_{1}$",A01,E); label("$A_{2}$",A02,W); label("$A_{3}$",A03,NE); label("$A_{4}$",A04,SW); label("$A_{5}$",A05,N); label("$A_{6}$",A06,S); label("$A_{7}$",A07,N); label("$A_{8}$",A08,SE); label("$A_{9}$",A09,NW); label("$A_{10}$",A10,E); label("$A_{11}$",A11,W); label("$A_{12}$",A12,E); label("$A_{13}$",A13,SW); label("$A_{14}$",A14,NE); label("$A_{15}$",A15,S); label("$A_{16}$",A16,N); label("$A_{17}$",A17,S); label("$A_{18}$",A18,NW); label("$A_{19}$",A19,SE); label("$A_{20}$",A20,W);[/asy]

Two masses are connected with spring constant $k$. The masses have magnitudes $m$ and $M$. The center-of-mass of the system is fixed. If $ k = \text {100 N/m} $ and $m=\dfrac{1}{2}M=\text{1 kg}$, let the ground state energy of the system be $E$. If $E$ can be expressed in the form $ a \times 10^p $ eV (electron-volts), find the ordered pair $(a,p)$, where $ 0 < a < 10 $, and it is rounded to the nearest positive integer and $p$ is an integer. For example, $ 4.2 \times 10^7 $ should be expressed as $(4,7)$. [i](Trung Phan, 10 points)[/i]