[b]p1.[/b] The following number is the product of the divisors of $n$.
$$2^63^3$$
What is $n$?


[b]p2.[/b] Let a right triangle have the sides $AB =\sqrt3$, $BC =\sqrt2$, and $CA = 1$. Let $D$ be a point such that $AD = BD = 1$. Let $E$ be the point on line $BD$ that is equidistant from $D$ and $A$. Find the angle $\angle AEB$.


[b]p3.[/b] There are twelve indistinguishable blackboards that are distributed to eight different schools. There must be at least one board for each school. How many ways are there of distributing the boards?


[b]p4.[/b] A Nishop is a chess piece that moves like a knight on its first turn, like a bishop on its second turn, and in general like a knight on odd-numbered turns and like a bishop on even-numbered turns.
A Nishop starts in the bottom-left square of a $3\times 3$-chessboard. How many ways can it travel to touch each square of the chessboard exactly once?


[b]p5.[/b] Let a Fibonacci Spiral be a spiral constructed by the addition of quarter-circles of radius $n$, where each $n$ is a term of the Fibonacci series:
$$1, 1, 2, 3, 5, 8,...$$
(Each term in this series is the sum of the two terms that precede it.) What is the arclength of the maximum Fibonacci spiral that can be enclosed in a rectangle of area $714$, whose side lengths are terms in the Fibonacci series?


[b]p6.[/b] Suppose that $a_1 = 1$ and
$$a_{n+1} = a_n -\frac{2}{n + 2}+\frac{4}{n + 1}-\frac{2}{n}$$
What is $a_{15}$?


[b]p7.[/b] Consider $5$ points in the plane, no three of which are collinear. Let $n$ be the number of circles that can be drawn through at least three of the points. What are the possible values of $n$?


[b]p8.[/b] Find the number of positive integers $n$ satisfying $\lfloor n /2014 \rfloor =\lfloor n/2016 \rfloor$.


[b]p9.[/b] Let f be a function taking real numbers to real numbers such that for all reals $x \ne 0, 1$, we have
$$f(x) + f \left( \frac{1}{1 - x}\right)= (2x - 1)^2 + f\left( 1 -\frac{1}{ x}\right)$$
Compute $f(3)$.


[b]p10.[/b] Alice and Bob split 5 beans into piles. They take turns removing a positive number of beans from a pile of their choice. The player to take the last bean loses. Alice plays first. How many ways are there to split the piles such that Alice has a winning strategy?


[b]p11.[/b] Triangle $ABC$ is an equilateral triangle of side length $1$. Let point $M$ be the midpoint of side $AC$. Another equilateral triangle $DEF$, also of side length $1$, is drawn such that the circumcenter of $DEF$ is $M$, point  $D$ rests on side $AB$. The length of $AD$ is of the form $\frac{a+\sqrt{b}}{c}$ , where $b$ is square free. What is $a + b + c$?


[b]p12.[/b] Consider the function $f(x) = \max \{-11x- 37, x - 1, 9x + 3\}$ defined for all real $x$. Let $p(x)$ be a quadratic polynomial tangent to the graph of $f$ at three distinct points with x values $t_1$, $t_2$ and $t_3$ Compute the maximum value of $t_1 + t_2 + t_3$ over all possible $p$.


[b]p13.[/b] Circle $J_1$ of radius $77$ is centered at point $X$ and circle $J_2$ of radius $39$ is centered at point $Y$. Point $A$ lies on $J1$ and on line $XY$ , such that A and Y are on opposite sides of $X$. $\Omega$ is the unique circle simultaneously tangent to the tangent segments from point $A$ to $J_2$ and internally tangent to $J_1$. If $XY = 157$, what is the radius of  $\Omega$ ?


[b]p14.[/b] Find the smallest positive integer $n$ so that for any integers $a_1, a_2,..., a_{527}$,the number 
$$\left( \prod^{527}_{j=1} a_j\right) \cdot\left( \prod^{527}_{j=1} a^n_j\right)$$
is divisible by $527$.


[b]p15.[/b] A circle  $\Omega$ of unit radius is inscribed in the quadrilateral $ABCD$. Let circle  $\omega_A$ be the unique circle of radius $r_A$ externally tangent to  $\Omega$, and also tangent to segments $AB$ and $DA$. Similarly define circles $\omega_B$, $\omega_C$, and $\omega_D$ and radii $r_B$, $r_C$, and $r_D$. Compute the smallest positive real $\lambda$ so that $r_C < \lambda$ over all such configurations with $r_A > r_B > r_C > r_D$.


PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
To find the number of positive integers \( n \) satisfying \( \lfloor n / 2014 \rfloor = \lfloor n / 2016 \rfloor \), we start by setting \( m = \lfloor n / 2014 \rfloor = \lfloor n / 2016 \rfloor \).

1. **Determine the range for \( n \) given \( m \):**
   \[
   m \leq \frac{n}{2014} < m+1 \quad \text{and} \quad m \leq \frac{n}{2016} < m+1
   \]
   This implies:
   \[
   m \cdot 2014 \leq n < (m+1) \cdot 2014 \quad \text{and} \quad m \cdot 2016 \leq n < (m+1) \cdot 2016
   \]

2. **Find the intersection of these ranges:**
   \[
   \max(m \cdot 2014, m \cdot 2016) \leq n < \min((m+1) \cdot 2014, (m+1) \cdot 2016)
   \]
   Since \( 2016 > 2014 \), the intersection simplifies to:
   \[
   m \cdot 2016 \leq n < (m+1) \cdot 2014
   \]

3. **Calculate the number of integers \( n \) in this range:**
   \[
   \text{Number of integers} = (m+1) \cdot 2014 - m \cdot 2016 = 2014 - 2m
   \]

4. **Sum the number of integers for all valid \( m \):**
   The maximum \( m \) is determined by the condition:
   \[
   m \cdot 2016 < 2014(m+1) \implies m \cdot 2016 < 2014m + 2014 \implies 2m < 2014 \implies m < 1007
   \]
   Therefore, \( m \) ranges from 0 to 1006.

5. **Sum the series:**
   \[
   \sum_{m=0}^{1006} (2014 - 2m)
   \]
   This is an arithmetic series with the first term \( a = 2014 \) and the last term \( l = 2 \), and the number of terms \( n = 1007 \).

   The sum of an arithmetic series is given by:
   \[
   S = \frac{n}{2} (a + l) = \frac{1007}{2} (2014 + 2) = \frac{1007}{2} \cdot 2016 = 1007 \cdot 1008 = 1007^2 + 1007 = 1007 \cdot 1008
   \]

   Simplifying:
   \[
   1007 \cdot 1008 = 1007 \cdot (1000 + 8) = 1007 \cdot 1000 + 1007 \cdot 8 = 1007000 + 8056 = 1015056
   \]

The final answer is \(\boxed{1015056}\)