There are integers $a$, $b$, and $c$, each greater than 1, such that $$\sqrt[a]{N \sqrt[b]{N \sqrt[c]{N}}} = \sqrt[36]{N^{25}}$$ for all $N > 1$. What is $b$? $\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$

Given three colors and a rectangle m × n dice unit, we want to color each segment constituting one side of a square drive with one of three colors so that each square unit have two sides of one color and two sides another color. How many colorings we have?

[color=darkred]Let $n$ and $m$ be two natural numbers, $m\ge n\ge 2$ . Find the number of injective functions \[f\colon\{1,2,\ldots,n\}\to\{1,2,\ldots,m\}\] such that there exists a unique number $i\in\{1,2,\ldots,n-1\}$ for which $f(i)>f(i+1)\, .$[/color]

Let $a_1 = 1 +\sqrt2$ and for each $n \ge 1$ dene $a_{n+1} = 2 -\frac{1}{a_n}$. Find the greatest integer less than or equal to the product $a_1a_2a_3 ... a_{200}$.

What is the area of the region bounded by the graphs of $y = |x + 2| - |x - 2|$ and $y = |x + 1| - |x - 3|$?

Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $. We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.

Consider $\vartriangle ABC$, right at $B$, let $I$ be its incenter and $F,D,E$ the points where the circle inscribed on sides AB, $BC$ and $AC$, respectively. If $M$ is the intersection point of $CI$ and $EF$, and $N$ is the intersection point of $DM$ and $AB$. Prove that $AN = ID$.

Answer the questions as below. (1) Find the local minimum of $y=x(1-x^2)e^{x^2}.$ (2) Find the total area of the part bounded the graph of the function in (1) and the $x$-axis.

In a competition, there were $2n+1$ teams. Every team plays exatly once against every other team. Every match finishes with the victory of one of the teams. We call cyclical a 3-subset of team ${ A,B,C }$ if $A$ won against $B$, $B$ won against $C$ , $C$ won against $A$. (a) Find the minimum of cyclical 3-subset (depending on $n$); (b) Find the maximum of cyclical 3-subset (depending on $n$).

The incircle of scalene triangle $\triangle{ABC}$ is tangent to $\overline{BC}, \overline{AC},$ and $\overline{AB}$ at points $D, E,$ and $F,$ respectively. The line $EF$ intersects line $BC$ at $P$ and line $AD$ at $Q.$ The circumcircle of $\triangle{AEF}$ intersects line $AP$ again at point $R \neq A.$ If $QE=3, QF=4, $ and $QR=8,$ find the area of triangle $\triangle{AEF}.$

Let $r$ and $b$ be positive integers. The game of [i]Monis[/i], a variant of Tetris, consists of a single column of red and blue blocks. If two blocks of the same color ever touch each other, they both vanish immediately. A red block falls onto the top of the column exactly once every $r$ years, while a blue block falls exactly once every $b$ years. (a) Suppose that $r$ and $b$ are odd, and moreover the cycles are offset in such a way that no two blocks ever fall at exactly the same time. Consider a period of $rb$ years in which the column is initially empty. Determine, in terms of $r$ and $b$, the number of blocks in the column at the end. (b) Now suppose $r$ and $b$ are relatively prime and $r+b$ is odd. At time $t=0$, the column is initially empty. Suppose a red block falls at times $t = r, 2r, \dots, (b-1)r$ years, while a blue block falls at times $t = b, 2b, \dots, (r-1)b$ years. Prove that at time $t=rb$, the number of blocks in the column is $\left\lvert 1+2(r-1)(b+r)-8S \right\rvert$, where \[ S = \left\lfloor \frac{2r}{r+b} \right\rfloor + \left\lfloor \frac{4r}{r+b} \right\rfloor + ... + \left\lfloor \frac{(r+b-1)r}{r+b} \right\rfloor . \] [i]Proposed by Sammy Luo[/i]

Find all functions $f:\mathbb{N}^{\ast}\rightarrow\mathbb{N}^{\ast}$ with the properties: [list=a] [*]$ f(m+n) -1 \mid f(m)+f(n),\quad \forall m,n\in\mathbb{N}^{\ast} $ [*]$ n^{2}-f(n)\text{ is a square } \;\forall n\in\mathbb{N}^{\ast} $[/list]

Find all functions $f: \mathbb R \to \mathbb R$ such that for all reals $x$ and $y$, \[f(x+y)+f(x)f(y)=f(xy)+f(x)+f(y).\]

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded. [i]Proposed by Palmer Mebane, United States[/i]

Driving along a highway, Megan noticed that her odometer showed $15951$ (miles). This number is a palindrome—it reads the same forward and backward. Then $2$ hours later, the odometer displayed the next higher palindrome. What was her average speed, in miles per hour, during this $2$-hour period? $\textbf{(A) }50 \qquad \textbf{(B) }55 \qquad \textbf{(C) }60\qquad \textbf{(D) }65\qquad\textbf{(E) }70$

Let $ABCD$ be a quadrilateral and let $l$ be a line. Let $l$ intersect the lines $AB,CD,BC,DA,AC,BD$ at points $X,X',Y,Y',Z,Z'$ respectively. Given that these six points on $l$ are in the order $X,Y,Z,X',Y',Z'$, show that the circles with diameter $XX',YY',ZZ'$ are coaxal.

The five pieces shown below can be arranged to form four of the five figures shown in the choices. Which figure [b]cannot[/b] be formed? [asy] defaultpen(linewidth(0.6)); size(80); real r=0.5, s=1.5; path p=origin--(1,0)--(1,1)--(0,1)--cycle; draw(p); draw(shift(s,r)*p); draw(shift(s,-r)*p); draw(shift(2s,2r)*p); draw(shift(2s,0)*p); draw(shift(2s,-2r)*p); draw(shift(3s,3r)*p); draw(shift(3s,-3r)*p); draw(shift(3s,r)*p); draw(shift(3s,-r)*p); draw(shift(4s,-4r)*p); draw(shift(4s,-2r)*p); draw(shift(4s,0)*p); draw(shift(4s,2r)*p); draw(shift(4s,4r)*p);[/asy] [asy] size(350); defaultpen(linewidth(0.6)); path p=origin--(1,0)--(1,1)--(0,1)--cycle; pair[] a={(0,0), (0,1), (0,2), (0,3), (0,4), (1,0), (1,1), (1,2), (2,0), (2,1), (3,0), (3,1), (3,2), (3,3), (3,4)}; pair[] b={(5,3), (5,4), (6,2), (6,3), (6,4), (7,1), (7,2), (7,3), (7,4), (8,0), (8,1), (8,2), (9,0), (9,1), (9,2)}; pair[] c={(11,0), (11,1), (11,2), (11,3), (11,4), (12,1), (12,2), (12,3), (12,4), (13,2), (13,3), (13,4), (14,3), (14,4), (15,4)}; pair[] d={(17,0), (17,1), (17,2), (17,3), (17,4), (18,0), (18,1), (18,2), (18,3), (18,4), (19,0), (19,1), (19,2), (19,3), (19,4)}; pair[] e={(21,4), (22,1), (22,2), (22,3), (22,4), (23,0), (23,1), (23,2), (23,3), (23,4), (24,1), (24,2), (24,3), (24,4), (25,4)}; int i; for(int i=0; i<15; i=i+1) { draw(shift(a[i])*p); draw(shift(b[i])*p); draw(shift(c[i])*p); draw(shift(d[i])*p); draw(shift(e[i])*p); } [/asy] \[ \textbf{(A)}\qquad\qquad\qquad\textbf{(B)}\quad\qquad\qquad\textbf{(C)}\:\qquad\qquad\qquad\textbf{(D)}\quad\qquad\qquad\textbf{(E)} \]

Let $BB_1$ and $CC_1$ be the altitudes of the acute-angled triangle $ABC$. From the point $B_1$ the perpendiculars $B_1E$ and $B_1F$ are drawn on the sides $AB$ and $BC$ of the triangle, respectively, and from the point $C_1$ the perpendiculars $C_1 K$ and $C_1L$ on the sides $AC$ and $BC$, respectively. It turned out that the lines $EF$ and $KL$ are perpendicular. Find the measure of the angle $A$ of the triangle $ABC$. (Alexander Dunyak)

Let $ a$ be positive constant number. Evaluate $ \int_{ \minus{} a}^a \frac {x^2\cos x \plus{} e^{x}}{e^{x} \plus{} 1}\ dx.$

Let $n \ge 2$ be a positive integer, and let $\sigma(n)$ denote the sum of the positive divisors of $n$. Prove that the $n^{\text{th}}$ smallest positive integer relatively prime to $n$ is at least $\sigma(n)$, and determine for which $n$ equality holds. [i]Proposed by Ashwin Sah[/i]

Let $f(x,y)$ be a continuous, real-valued function on $\mathbb{R}^2.$ Suppose that, for every rectangular region $R$ of area $1,$ the double integral of $f(x,y)$ over $R$ equals $0.$ Must $f(x,y)$ be identically $0?$

On a blackboard, there are $17$ integers not divisible by $17$. Alice and Bob play a game. Alice starts and they alternately play the following moves: $\bullet$ Alice chooses a number $a$ on the blackboard and replaces it with $a^2$ $\bullet$ Bob chooses a number $b$ on the blackboard and replaces it with $b^3$. Alice wins if the sum of the numbers on the blackboard is a multiple of $17$ after a finite number of steps. Prove that Alice has a winning strategy. (Daniel Holmes)

Given a point $P = (p_1, p_2, \ldots, p_n)$ in $n$-dimensional space . Find point $X = (x_1, x_2, \ldots, x_n)$, such that $x_1 \leq x_2 \leq\cdots \leq x_n$ and $\sqrt{(x_1-p_1)^2 + (x_2-p_2)^2+\cdots+(x_n-p_n)^2}$ is minimal.

Let $ S(t)$ be the area of the traingle $ OAB$ with $ O(0,\ 0,\ 0),\ A(2,\ 2,\ 1),\ B(t,\ 1,\ 1 \plus{} t)$. Evaluate $ \int_1^ e S(t)^2\ln t\ dt$.

A point $P$ is chosen inside a convex quadrilateral $ABCD$. Could it happen that$$PA = AB, \quad PB = BC, \quad PC = CD \quad \text{and} \quad PD = DA?$$