Found problems: 603
Two circles $\omega_1(O)$ and $\omega_2$ intersect each other at $A,B$ ,and $O$ lies on $\omega_2$. Let $S$ be a point on $AB$ such that $OS\perp AB$. Line $OS$ intersects $\omega_2$ at $P$ (other than $O$). The bisector of $\hat{ASP}$ intersects $\omega_1$ at $L$ ($A$ and $L$ are on the same side of the line $OP$). Let $K$ be a point on $\omega_2$ such that $PS=PK$ ($A$ and $K$ are on the same side of the line $OP$). Prove that $SL=KL$.
[i]Proposed by Ali Zamani [/i]
For a given triangle $ ABC$, let $ X$ be a variable point on the line $ BC$ such that $ C$ lies between $ B$ and $ X$ and the incircles of the triangles $ ABX$ and $ ACX$ intersect at two distinct points $ P$ and $ Q.$ Prove that the line $ PQ$ passes through a point independent of $ X$.
Prove the following statement: If $r_1$ and $r_2$ are real numbers whose quotient is irrational, then any real number $x$ can be approximated arbitrarily well by the numbers of the form $\ z_{k_1,k_2} = k_1r_1 + k_2r_2$ integers, i.e. for every number $x$ and every positive real number $p$ two integers $k_1$ and $k_2$ can be found so that $|x - (k_1r_1 + k_2r_2)| < p$ holds.
Let $ n$ be a positive integer. Consider a rectangle $ (90n\plus{}1)\times(90n\plus{}5)$ consisting of unit squares. Let $ S$ be the set of the vertices of these squares. Prove that the number of distinct lines passing through at least two points of $ S$ is divisible by $ 4$.
[b]3.[/b] A quadrilateral $ABCD$ has the incircle $\omega$ and is such that the semi-lines $AB$ and $DC$ intersect at point $P$ and the semi-lines $AD$ and $BC$ intersect at point $Q$. The lines $AC$ and $PQ$ intersect at point $R$. Let $T$ be the point of $\omega$ closest from line $PQ$. Prove that the line $RT$ passes through the incenter of triangle $PQC$.
A regular pentagon is constructed externally on each side of a regular pentagon of side $1$. The figure is then folded and the two edges of the external pentagons meeting at each vertex of the original pentagon are glued together. Find the volume of water that can be poured into the obtained container.
A staircase-brick with 3 steps of width 2 is made of 12 unit cubes. Determine all integers $ n$ for which it is possible to build a cube of side $ n$ using such bricks.
Let $ABCD$ be a fixed convex quadrilateral with $BC=DA$ and $BC$ not parallel with $DA$. Let two variable points $E$ and $F$ lie of the sides $BC$ and $DA$, respectively and satisfy $BE=DF$. The lines $AC$ and $BD$ meet at $P$, the lines $BD$ and $EF$ meet at $Q$, the lines $EF$ and $AC$ meet at $R$.
Prove that the circumcircles of the triangles $PQR$, as $E$ and $F$ vary, have a common point other than $P$.
In the triangle $\triangle ABC$, let $G$ be the centroid, and let $I$ be the center of the inscribed circle. Let $\alpha$ and $\beta$ be the angles at the vertices $A$ and $B$, respectively. Suppose that the segment $IG$ is parallel to $AB$ and that $\beta = 2\tan^{-1}(1/3)$. Find $\alpha$.
A square piece of paper has sides of length $ 100$. From each corner a wedge is cut in the following manner: at each corner, the two cuts for the wedge each start at distance $ \sqrt {17}$ from the corner, and they meet on the diagonal at an angle of $ 60^\circ$ (see the figure below). The paper is then folded up along the lines joining the vertices of adjacent cuts. When the two edges of a cut meet, they are taped together. The result is a paper tray whose sides are not at right angles to the base. The height of the tray, that is, the perpendicular distance between the plane of the base and the plane formed by the upper edges, can be written in the form $ \sqrt [n]{m}$, where $ m$ and $ n$ are positive integers, $ m < 1000$, and $ m$ is not divisible by the $ n$th power of any prime. Find $ m \plus{} n$.
[asy]import math;
unitsize(5mm);
defaultpen(fontsize(9pt)+Helvetica()+linewidth(0.7));
pair O=(0,0);
pair A=(0,sqrt(17));
pair B=(sqrt(17),0);
pair C=shift(sqrt(17),0)*(sqrt(34)*dir(75));
pair D=(xpart(C),8);
pair E=(8,ypart(C));
draw(O--(0,8));
draw(O--(8,0));
draw(O--C);
draw(A--C--B);
draw(D--C--E);
label("$\sqrt{17}$",(0,2),W);
label("$\sqrt{17}$",(2,0),S);
label("cut",midpoint(A--C),NNW);
label("cut",midpoint(B--C),ESE);
label("fold",midpoint(C--D),W);
label("fold",midpoint(C--E),S);
label("$30^\circ$",shift(-0.6,-0.6)*C,WSW);
label("$30^\circ$",shift(-1.2,-1.2)*C,SSE);[/asy]
A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or
[*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter.
[i]Proposed by Aron Thomas[/i]
On a $300 \times 300$ board, several rooks are placed that beat the entire board. Within this case, each rook beats no more than one other rook. At what least $k$, it is possible to state that there is at least one rook in each $k\times k$ square ?
Let $ABC$ be a triangle such that $AB = 3$, $BC = 4$, and $AC = 5$. Let $X$ be a point in the triangle. Compute the minimal possible value of $AX^2 + BX^2 + CX^2$
Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n$.
Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have
\[ n\mid a_i \minus{} b_i \minus{} c_i
\]
[i]Proposed by Ricky Liu & Zuming Feng, USA[/i]
A point $(x,y)$ is to be chosen in the coordinate plane so that it is equally distant from the x-axis, the y-axis, and the line $x+y = 2$. Then $x$ is
A. $\sqrt{2} - 1$
B. $\frac{1}{2}$
C. $2 - \sqrt{2}$
D. 1
E. Not uniquely determined
Let $ X,Y,Z$ be the midpoints of the small arcs $ BC,CA,AB$ respectively (arcs of the circumcircle of $ ABC$). $ M$ is an arbitrary point on $ BC$, and the parallels through $ M$ to the internal bisectors of $ \angle B,\angle C$ cut the external bisectors of $ \angle C,\angle B$ in $ N,P$ respectively. Show that $ XM,YN,ZP$ concur.
In convex quadrilateral $ABCD$ we have $AB=15$, $BC=16$, $CD=12$, $DA=25$, and $BD=20$. Let $M$ and $\gamma$ denote the circumcenter and circumcircle of $\triangle ABD$. Line $CB$ meets $\gamma$ again at $F$, line $AF$ meets $MC$ at $G$, and line $GD$ meets $\gamma$ again at $E$. Determine the area of pentagon $ABCDE$.
Quadrilateral $ABCD$ has right angles at $B$ and $C$, $\triangle ABC \sim \triangle BCD$, and $AB > BC$. There is a point $E$ in the interior of $ABCD$ such that $\triangle ABC \sim \triangle CEB$ and the area of $\triangle AED$ is $17$ times the area of $\triangle CEB$. What is $\tfrac{AB}{BC}$?
$\textbf{(A) \ } 1+\sqrt{2} \qquad \textbf{(B) \ } 2+\sqrt{2}\qquad \textbf{(C) \ } \sqrt{17}\qquad \textbf{(D) \ } 2+\sqrt{5} \qquad \textbf{(E) \ } 1+2\sqrt{3}$
In convex pentagon $ABCDE$ points $A_1$, $B_1$, $C_1$, $D_1$, $E_1$ are intersections of pairs of diagonals $(BD, CE)$, $(CE, DA)$, $(DA, EB)$, $(EB, AC)$ and $(AC, BD)$ respectively. Prove that if four of quadrilaterals $AB_{1}A_{1}B$, $BC_{1}B_{1}C$, $CD_{1}C_{1}D$, $DE_{1}D_{1}E$ and $EA_{1}E_{1}A$ are cyclic then the fifth one is also cyclic.
A plane is cut into unit squares, which are then colored in $n$ colors. A polygon $P$ is created from $n$ unit squares that are connected by their sides. It is known that any cell polygon created by $P$ with translation, covers $n$ unit squares in different colors. Prove that the plane can be covered with copies of $P$ so that each cell is covered exactly once.
Let $M$ be the set of positive integers which do not have a prime divisor greater than 3. For any infinite family of subsets of $M$, say $A_1,A_2,\ldots $, prove that there exist $i\ne j$ such that for each $x\in A_i$ there exists some $y\in A_j $ such that $y\mid x$.
We are given $666$ points on the plane such that they cannot be covered by $10$ lines. Show that we can choose $66$ out of these points such that they can not be covered by $10$ lines.
Call an [i]ordered[/i] triple $(a,b,c)$ [i]$d$-tall[/i] if there exists a triangle with side lengths $a,b,c$ and the height to the side with length $a$ is $d$. Suppose that for some positive integer $k$, there are exactly $210$ $k$-tall ordered triples of positive integers. How many $k$-tall ordered triples $(a,b,c)$ are there such that a triangle $ABC$ with $BC=a,CA=b,AB=c$ satisfies both $\angle{B}<90^\circ$ and $\angle{C}<90^\circ$?
[i]2020 CCA Math Bonanza Team Round #8[/i]
Prove that on a coordinate plane it is impossible to draw a closed broken line such that [list][*] coordinates of each vertex are rational, [*] the length of its every edge is equal to $1$, [*] the line has an odd number of vertices.[/list]
The circle having $(0,0)$ and $(8,6)$ as the endpoints of a diameter intersects the $x$-axis at a second point. What is the $x$-coordinate of this point?
$\textbf{(A)}\ 4\sqrt2 \qquad \textbf{(B)}\ 6\qquad \textbf{(C)}\ 5\sqrt2 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 6\sqrt2$