Triangle $ABC$ with $\measuredangle A = 90^\circ$ has incenter $I$. A circle passing through $A$ with center $I$ is drawn, intersecting $\overline{BC}$ at $E$ and $F$ such that $BE < BF$. If $\tfrac{BE}{EF} = \tfrac{2}{3}$, then $\tfrac{CF}{FE} = \tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by Lewis Chen [/i]

Let circles $C_1$ and $C_2$ be internally tangent at point $P$, with $C_1$ being the smaller circle. Consider a line passing through $P$ which intersects $C_1$ at $Q$ and $C_2$ at $R$. Let the line tangent to $C_2$ at $R$ and the line perpendicular to $\overline{PR}$ passing through $Q$ intersect at a point $S$ outside both circles. Given that $SR = 5$, $RQ = 3$, and $QP = 2$, compute the radius of $C_2$.

Let $\mathbb{N} = \{1,2, \ldots\}.$ Does there exists a function $f: \mathbb{N} \mapsto \mathbb{N}$ such that $\forall n \in \mathbb{N},$ $f^{1989}(n) = 2 \cdot n$ ?

2/1/31. Let $x, y,$ and $z$ be real numbers greater than $1$. Prove that if $x^y = y^z = z^x$, then $x = y = z$.

\[\int_0^1 x\sqrt[4]{1-x}\,\mathrm dx\] [i]Proposed by Connor Gordon[/i]

Let $n > 1$ and $p(x)=x^n+a_{n-1}x^{n-1} +...+a_0$ be a polynomial with $n$ real roots (counted with multiplicity). Let the polynomial $q$ be defined by $$q(x) = \prod_{j=1}^{2015} p(x + j)$$. We know that $p(2015) = 2015$. Prove that $q$ has at least $1970$ different roots $r_1, ..., r_{1970}$ such that $|r_j| < 2015$ for all $ j = 1, ..., 1970$.

The figure below shows a large white circle with a number of smaller white and shaded circles in its interior. What fraction of the interior of the large white circle is shaded? [asy] size(5cm); defaultpen(linewidth(1pt)); draw(circle((3,3),3)); filldraw(circle((5.5,3),0.5),mediumgray*0.5 + lightgray*0.5); filldraw(circle((2,3),2),mediumgray*0.5 + lightgray*0.5); filldraw(circle((1,3),1),white); filldraw(circle((3,3),1),white); add(grid(6,6,mediumgray*0.5+gray*0.5+linetype("4 4"))); filldraw(circle((4.5,4.5),0.5),mediumgray*0.5 + lightgray*0.5); filldraw(circle((4.5,1.5),0.5),mediumgray*0.5 + lightgray*0.5); [/asy]$\textbf{(A) } \dfrac14\qquad\textbf{(B) } \dfrac{11}{36}\qquad\textbf{(C) } \dfrac13\qquad\textbf{(D) } \dfrac{19}{36}\qquad\textbf{(E) } \dfrac59$

Show that there are an infinity of positive integers $n$ such that $2^{n}+3^{n}$ is divisible by $n^{2}$.

Let $p$ be an odd prime. Prove that the number $$\left\lfloor \left(\sqrt{5}+2\right)^{p}-2^{p+1}\right\rfloor$$ is divisible by $20p$.

$\lim_{n\to\infty } \sum_{1\le i\le j\le n} \frac{\ln (1+i/n)\cdot\ln (1+j/n)}{\sqrt{n^4+i^2+j^2}} $ [i]Gabriel Mîrșanu[/i] and [i]Andrei Nedelcu[/i]

Let $\Delta ABC$ be a scalene triangle. Points $D,E$ lie on side $\overline{AC}$ in the order, $A,E,D,C$. Let the parallel through $E$ to $BC$ intersect $\odot (ABD)$ at $F$, such that, $E$ and $F$ lie on the same side of $AB$. Let the parallel through $E$ to $AB$ intersect $\odot (BDC)$ at $G$, such that, $E$ and $G$ lie on the same side of $BC$. Prove, Points $D,F,E,G$ are concyclic

Several knights are arranged on an infinite chessboard. No square is attacked by more than one knight (in particular, a square occupied by a knight can be attacked by one knight but not by two). Sasha outlined a $ 14\times 16$ rectangle. What maximum number of knights can this rectangle contain?

For each pair of positive integers $m$ and $n$, we define $f_m(n)$ as follows: $$ f_m(n) = \gcd(n, d_1) + \gcd(n, d_2) + \cdots + \gcd(n, d_k), $$ where $1 = d_1 < d_2 < \cdots < d_k = m$ are all the positive divisors of $m$. For example, $f_4(6) = \gcd(6,1) + \gcd(6,2) + \gcd(6,4) = 5$. $a)\:$ Find all positive integers $n$ such that $f_{2017}(n) = f_n(2017)$. $b)\:$ Find all positive integers $n$ such that $f_6(n) = f_n(6)$.

What is the smallest positive integer that is neither prime nor square and that has no prime factor less than 50? $\textbf{(A)}\hspace{.05in}3127 \qquad \textbf{(B)}\hspace{.05in}3133 \qquad \textbf{(C)}\hspace{.05in}3137 \qquad \textbf{(D)}\hspace{.05in}3139 \qquad \textbf{(E)}\hspace{.05in}3149 $

A regular pentagon with area $\sqrt{5}+1$ is printed on paper and cut out. The five vertices of the pentagon are folded into the center of the pentagon, creating a smaller pentagon. What is the area of the new pentagon? $\textbf{(A)}~4-\sqrt{5}\qquad\textbf{(B)}~\sqrt{5}-1\qquad\textbf{(C)}~8-3\sqrt{5}\qquad\textbf{(D)}~\frac{\sqrt{5}+1}{2}\qquad\textbf{(E)}~\frac{2+\sqrt{5}}{3}$

Let $(x_n)$ be a sequence of positive integers defined as follows: $x_1$ is a fixed six-digit number and for any $n \geq 1$, $x_{n+1}$ is a prime divisor of $x_n + 1$. Find $x_{19} + x_{20}$.

Consider the polynomials \begin{align*}P(x) &= (x + \sqrt{2})(x^2 - 2x + 2)\\Q(x) &= (x - \sqrt{2})(x^2 + 2x + 2)\\R(x) &= (x^2 + 2)(x^8 + 16).\end{align*} Find the coefficient of $x^4$ in $P(x)\cdot Q(x)\cdot R(x)$.

Are there infinitely many positive integers that [b]can’t[/b] be presented as a sum of no more than fifteen fourth degrees of positive integers. (For example 15 isn’t such number as it can be presented as the sum of $15.1^4$)

Let $M$ be a point inside square $ABCD$ and $A_1,B_1,C_1,D_1$ be the second intersection points of $AM$, $BM$, $CM$, $DM$ with the circumcircle of the square. Prove that $A_1B_1\cdot C_1D_1=A_1D_1\cdot B_1C_1$.

Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]

Alice and Billy are playing a game on a number line. They both start at $0$. Each turn, Alice has a $\frac{1}{2}$ chance of moving $1$ unit in the positive direction, and a $\frac{1}{2}$ chance of moving $1$ unit in the negative direction, while Billy has a $\frac{2}{3}$ chance of moving $1$ unit in the positive direction, and a $\frac{1}{3}$ chance of moving $1$ unit in the negative direction. Alice and Billy alternate turns, with Alice going first. If a player reaches $2$, they win and the game ends, but if they reach $-2$, they lose and the other player wins, and the game ends. What is the probability that Billy wins? [i]2018 CCA Math Bonanza Lightning Round #4.4[/i]

$\textbf{N5.}$ Find all $f: \mathbb{N} \rightarrow \mathbb{N}$ such that for all $a,b,c \in \mathbb{N}$ $f(a)+f(b)+f(c)-ab-bc-ca \mid af(a)+bf(b)+cf(c)-3abc$

Find all integers $ (x,y,z)$, satisfying equality: $ x^2(y \minus{} z) \plus{} y^2(z \minus{} x) \plus{} z^2(x \minus{} y) \equal{} 2$

Let $n$ be a positive integer. We want to make up a collection of cards with the following properties: 1. each card has a number of the form $m!$ written on it, where $m$ is a positive integer. 2. for any positive integer $ t \le n!$, we can select some card(s) from this collection such that the sum of the number(s) on the selected card(s) is $t$. Determine the smallest possible number of cards needed in this collection.

Prove that if the relationship between the sides and opposite angles $ A $ and $ B $ of the triangle $ ABC $ is $$ (a^2 + b^2) \sin (A - B) = (a^2 - b^2) \sin (A + B)$$ then such a triangle is right-angled or isosceles.