For a positive integer $n$, denote $p(n)$ to be the number of nonnegative integer tuples $(x,y,z,w)$ such that $x+2y+2z+3w=n$. Also, denote $q(n)$ to be the number of nonnegative integer tuples $(a,b,c,d)$ such that (i) $a+b+c+d=n$ (ii) $a \ge b \ge d$ (iii) $a \ge c \ge d$ Prove that for all $n$, $p(n) = q(n)$.

Alice and Bob are playing "factoring game." On the paper, $270000(=2^43^35^4)$ is written and each person picks one number from the paper(call it $N$) and erase $N$ and writes integer $X,Y$ such that $N=XY$ and $\text{gcd}(X,Y)\ne1.$ Alice goes first and the person who can no longer make this factoring loses. If two people use optimal strategy, prove that Alice always win.

Points $A,B,C$ lie on a circle $\omega$ such that $BC$ is a diameter. $AB$ is extended past $B$ to point $B'$ and $AC$ is extended past $C$ to point $C'$ such that line $B'C'$ is parallel to $BC$ and tangent to $\omega$ at point $D$. If $B'D = 4$ and $C'D = 6$, compute $BC$.

A number of linked rings, each 1 cm thick, are hanging on a peg. The top ring has an outside diameter of 20 cm. The outside diameter of each of the outer rings is 1 cm less than that of the ring above it. The bottom ring has an outside diameter of 3 cm. What is the distance, in cm, from the top of the top ring to the bottom of the bottom ring? [asy] size(200); defaultpen(linewidth(3)); real[] inrad = {40,34,28,21}; real[] outrad = {55,49,37,30}; real[] center; path[][] quad = new path[4][4]; center[0] = 0; for(int i=0;i<=3;i=i+1) { if(i != 0) { center[i] = center[i-1] - inrad[i-1] - inrad[i]+3.5; } quad[0][i] = arc((0,center[i]),inrad[i],0,90)--arc((0,center[i]),outrad[i],90,0)--cycle; quad[1][i] = arc((0,center[i]),inrad[i],90,180)--arc((0,center[i]),outrad[i],180,90)--cycle; quad[2][i] = arc((0,center[i]),inrad[i],180,270)--arc((0,center[i]),outrad[i],270,180)--cycle; quad[3][i] = arc((0,center[i]),inrad[i],270,360)--arc((0,center[i]),outrad[i],360,270)--cycle; draw(circle((0,center[i]),inrad[i])^^circle((0,center[i]),outrad[i])); } void fillring(int i,int j) { if ((j % 2) == 0) { fill(quad[i][j],white); } else { filldraw(quad[i][j],black); } } for(int i=0;i<=3;i=i+1) { for(int j=0;j<=3;j=j+1) { fillring(((2-i) % 4),j); } } for(int k=0;k<=2;k=k+1) { filldraw(circle((0,-228 - 25 * k),3),black); } real r = 130, s = -90; draw((0,57)--(r,57)^^(0,-57)--(r,-57),linewidth(0.7)); draw((2*r/3,56)--(2*r/3,-56),linewidth(0.7),Arrows(size=3)); label("$20$",(2*r/3,-10),E); draw((0,39)--(s,39)^^(0,-39)--(s,-39),linewidth(0.7)); draw((9*s/10,38)--(9*s/10,-38),linewidth(0.7),Arrows(size=3)); label("$18$",(9*s/10,0),W); [/asy] $ \textbf{(A) } 171\qquad \textbf{(B) } 173\qquad \textbf{(C) } 182\qquad \textbf{(D) } 188\qquad \textbf{(E) } 210$

We say that distinct positive integers $n, m$ are $friends$ if $\vert n-m \vert$ is a divisor of both ${}n$ and $m$. Prove that, for any positive integer $k{}$, there exist $k{}$ distinct positive integers such that any two of these integers are friends.

A square cake of uniform height is evenly covered with frosting on the top and all four sides. Find a way to cut the cake into five portions such that: (a) All portions contain the same amount of cake. (b) All portions contain the same amount of cake and frosting.

Let $(a_n)_{n\ge1}$ be a positive real sequence such that $$\lim_{n\to\infty}\frac{a_n}n=a\in\mathbb R^*_+\enspace\text{and}\enspace\lim_{n\to\infty}\left(\frac{a_{n+1}}{a_n}\right)^n=b\in\mathbb R^*_+$$ Compute $$\lim_{n\to\infty}(a_{n+1}-a_n)$$ [i]Proposed by D.M. Bătinețu-Giurgiu and Neculai Stanciu[/i]

We increased some positive integer by $10\%$ and obtained a positive integer. Is it possible that in doing so we decreased the sum of digits exactly by $10\%$ ?

Let $n = 2^{19}3^{12}$. Let $M$ denote the number of positive divisors of $n^2$ which are less than $n$ but would not divide $n$.What is the number formed by taking the last two digits of $M$ (in the same order)?

Each cell of an $m\times n$ board is filled with some nonnegative integer. Two numbers in the filling are said to be [i]adjacent[/i] if their cells share a common side. (Note that two numbers in cells that share only a corner are not adjacent). The filling is called a [i]garden[/i] if it satisfies the following two conditions: (i) The difference between any two adjacent numbers is either $0$ or $1$. (ii) If a number is less than or equal to all of its adjacent numbers, then it is equal to $0$. Determine the number of distinct gardens in terms of $m$ and $n$.

We have sheet of paper, divided on $100\times 100$ unit squares. In some squares we put rightangled isosceles triangles with leg =$1$ ( Every triangle lies in one unit square and is half of this square). Every unit grid segment( boundary too) is under one leg of triangle. Find maximal number of unit squares, that don`t contains triangles.

Let $n$ be a positive integer. Beto writes a list of $n$ non-negative integers on the board. Then he performs a succession of moves (two steps) of the following type: First for each $i=1,2,...,n$, he counts how many numbers on the board are less than or equal to $i$. Let $a_i$ be the number obtained for each $i=1,2,...,n$. Next, he erases all the numbers from the board and writes the numbers $a_1,a_2,...,a_n$. For example, if $n=5$ and the initial numbers on the board are $0,7,2,6,2$, after the first move, the numbers on the board will bec$1,3,3,3,3$;after the second move they will be $1,1,5,5,5$, and so on. $a)$ Show that, for every $n$ and every initial configuration, there will come a time after which the numbers will no longer be modified when using this move. $b)$Find (as a function of $n$) the minimum value of $k$ such that, for any initial configuration, the moves made from move number $k$ will not change the numbers on the board.

In $\Delta ABC$, let $D$ be a point on side $BC$. Suppose the incircle $\omega_1$ of $\Delta ABD$ touches sides $AB$ and $AD$ at $E,F$ respectively, and the incircle $\omega_2$ of $\Delta ACD$ touches sides $AD$ and $AC$ at $F,G$ respectively. Suppose the segment $EG$ intersects $\omega_1$ and $\omega_2$ again at $P$ and $Q$ respectively. Show that line $AD$, tangent of $\omega_1$ at $P$ and tangent of $\omega_2$ at $Q$ are concurrent.

For a point $P = (a,a^2)$ in the coordinate plane, let $l(P)$ denote the line passing through $P$ with slope $2a$. Consider the set of triangles with vertices of the form $P_1 = (a_1, a_1^2), P_2 = (a_2, a_2^2), P_3 = (a_3, a_3^2)$, such that the intersection of the lines $l(P_1), l(P_2), l(P_3)$ form an equilateral triangle $\triangle$. Find the locus of the center of $\triangle$ as $P_1P_2P_3$ ranges over all such triangles.

Let $S$ be the sum of all positive real numbers $x$ for which $$x^{2^{\sqrt2}}=\sqrt2^{2^x}.$$ Which of the following statements is true? $\textbf{(A) }S<\sqrt2 \qquad \textbf{(B) }S=\sqrt2 \qquad \textbf{(C) }\sqrt2<S<2\qquad \textbf{(D) }2\le S<6 \qquad \textbf{(E) }S\ge 6$

Let $x_1,x_2,\ldots,x_n $ be real numbers, where $n\ge 2$ is a given integer, and let $\lfloor{x_1}\rfloor,\lfloor{x_2}\rfloor,\ldots,\lfloor{x_n}\rfloor $ be a permutation of $1,2,\ldots,n$. Find the maximum and minimum of $\sum\limits_{i=1}^{n-1}\lfloor{x_{i+1}-x_i}\rfloor$ (here $\lfloor x\rfloor $ is the largest integer not greater than $x$).

Find all $(x,y,z) \in {\mathbb{N}}^3$ such that $x^{4}-y^{4}=z^{2}$.

Let $a_1,a_2,\ldots$ be a sequence defined by $a_1=a_2=1$ and $a_{n+2}=a_{n+1}+a_n$ for $n\geq 1$. Find \[\sum_{n=1}^\infty \dfrac{a_n}{4^{n+1}}.\]

Define the sequence $x_1, x_2, ...$ inductively by $x_1 = \sqrt{5}$ and $x_{n+1} = x_n^2 - 2$ for each $n \geq 1$. Compute $\lim_{n \to \infty} \frac{x_1 \cdot x_2 \cdot x_3 \cdot ... \cdot x_n}{x_{n+1}}$.

$239$ wise men stand in a circle near an opaque baobab. The king put on the head of each of these wise men a hat og one of $16$ colors. Each wise men does nor know the color of his hat and can only see the two nearest wise men on each side around the circle. Without communicating, these wise men must at the same time make a guess about the color of their hat $($i.e, tell one color$)$. These wise men were allowed to consult in advance, while they are afraid of being too lucky. What is the maximum $k$ for which, in any arrangement of hats, they can certainly ensure that no more than $k$ wise men guess the color of their hats$?$

For an arbitrary square matrix $M$, define $$\exp(M)=I+\frac M{1!}+\frac{M^2}{2!}+\frac{M^3}{3!}+\ldots.$$Construct $2\times2$ matrices $A$ and $B$ such that $\exp(A+B)\ne\exp(A)\exp(B)$.

Let $p>5$ be a prime number and $A=\{b_1,b_2,\dots,b_{\frac{p-1}{2}}\}$ be the set of all quadratic residues modulo $p$, excluding zero. Prove that there doesn't exist any natural $a,c$ satisfying $(ac,p)=1$ such that set $B=\{ab_1+c,ab_2+c,\dots,ab_{\frac{p-1}{2}}+c\}$ and set $A$ are disjoint modulo $p$. [i]This problem was proposed by Amir Hossein Pooya.[/i]

The incircle $\omega$ of triangle $ABC$ touches $BC, CA, AB$ at points $A_1, B_1$ and $C_1$ respectively, $P$ is an arbitrary point on $\omega$. The line $AP$ meets the circumcircle of triangle $AB_1C_1$ for the second time at point $A_2$. Points $B_2$ and $C_2$ are defined similarly. Prove that the circumcircle of triangle $A_2B_2C_2$ touches $\omega$.

In convex pentagon $ ABCDE$, denote by $ AD\cap BE = F,BE\cap CA = G,CA\cap DB = H,DB\cap EC = I,EC\cap AD = J; AI\cap BE = A',BJ%Error. "capCA" is a bad command. = B',CF%Error. "capDB" is a bad command. = C',DG\cap EC = D',EH\cap AD = E'.$ Prove that $ \frac {AB'}{B'C}\cdot\frac {CD'}{D'E}\cdot\frac {EA'}{A'B}\cdot\frac {BC'}{C'D}\cdot\frac {DE'}{E'A} = 1$.

Let $ABC$ be a triangle in which the length of side $AB$ is $4$ units, and that of $BC$ is $2$ units. Let $D$ be the point on $AB$ at distance $3$ units from $A$. Prove that the line perpendicular to $AB$ through $D$, the angle bisector of $\angle ABC$, and the perpendicular bisector of $BC$ all meet at a single point.