Find the smallest number \(n\) such that any set of \(n\) ponts in a Cartesian plan, all of them with integer coordinates, contains two poitns such that the square of its mutual distance is a multiple of \(2016\).

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$.