A four digit number is called [i]stutterer[/i] if its first two digits are the same and its last two digits are also the same, e.g. $3311$ and $2222$ are stutterer numbers. Find all stutterer numbers that are square numbers.

Two circles intersect at the points $C$ and $D$. The straight lines $CD$ and $BYXA$ intersect at the point $Z$. Moreever, the straight line $WB$ is tangent to both of the circles. Suppose $ZX=ZY$ and $AB\cdot AX=100$. Find the value of $BW$.

Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f:\mathbb{N}\longrightarrow\mathbb{N}$ such that \[n+f(m)\mid f(n)+nf(m)\] for all $m,n\in \mathbb{N}$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

On a $4 \times 4 \times 3$ rectangular parallelepiped, vertices $A$, $B$, and $C$ are adjacent to vertex $D$. The perpendicular distance from $D$ to the plane containing $A$, $B$, and $C$ is closest to $\text{(A)}\ 1.6 \qquad \text{(B)}\ 1.9 \qquad \text{(C)}\ 2.1 \qquad \text{(D)}\ 2.7 \qquad \text{(E)}\ 2.9$

The Fibonacci sequence $F_n$ is defined by $F_1=F_2=1$ and the recurrence relation $F_n=F_{n-1}+F_{n-2}$ for all integers $n\geq3$. Let $m,n\geq1$ be integers. Find the minimal degree $d$ for which there exists a polynomial $f(x)=a_dx^d+a_{d-1}x^{d-1}+\dots+a_1x+a_0$, which satisfies $f(k)=F_{m+k}$ for all $k=0,1,...,n$.

Determine all positive integers $a$ and $b$ such that each square on the $a\times b$ board can be colored red, blue, or green such that each red square has exactly one blue neighbor and one green neighbor, each blue square has exactly one red and one green neighbor and each green square has exactly one red and one blue neighbor. Clarification: Two squares are neighbors if they have a common side.

If $p(x)$ is a polynomial with integer coeffcients, let $q(x) = \frac{p(x)}{x(1-x)}$ . If $q(x) = q\left(\frac{1}{1-x}\right)$ for every $x \ne 0$, and $p(2) = -7, p(3) = -11$, find $p(10)$.

Find the area of the section of a unit cube $ABCDA_1B_1C_1D_1$, when a plane passes through the midpoints of the edges $AB, AD$ and $CC_1$.

Six fruit baskets contain peaches, apples and pears. The number of peaches in each basket is equal to the total number of apples in the other baskets. The number of apples in each basket is equal to the total number of pears in the other baskets. (a) Find a way to place $31$ fruits in the baskets, satisfying the conditions of the statement. (b) Explain why the total number of fruits must always be multiple of $31$.

$f,g$ are two permutations of set $X=\{1,\dots,n\}$. We say $f,g$ have common points iff there is a $k\in X$ that $f(k)=g(k)$. a) If $m>\frac{n}{2}$, prove that there are $m$ permutations $f_{1},f_{2},\dots,f_{m}$ from $X$ that for each permutation $f\in X$, there is an index $i$ that $f,f_{i}$ have common points. b) Prove that if $m\leq\frac{n}{2}$, we can not find permutations $f_{1},f_{2},\dots,f_{m}$ satisfying the above condition.

The figures $ F_1$, $ F_2$, $ F_3$, and $ F_4$ shown are the first in a sequence of figures. For $ n\ge3$, $ F_n$ is constructed from $ F_{n \minus{} 1}$ by surrounding it with a square and placing one more diamond on each side of the new square than $ F_{n \minus{} 1}$ had on each side of its outside square. For example, figure $ F_3$ has $ 13$ diamonds. How many diamonds are there in figure $ F_{20}$? [asy]unitsize(3mm); defaultpen(linewidth(.8pt)+fontsize(10pt)); path d=(1/2,0)--(0,sqrt(3)/2)--(-1/2,0)--(0,-sqrt(3)/2)--cycle; marker m=marker(scale(5)*d,Fill); path f1=(0,0); path f2=(0,0)--(-1,1)--(1,1)--(1,-1)--(-1,-1); path[] g2=(-1,1)--(-1,-1)--(0,0)^^(1,-1)--(0,0)--(1,1); path f3=f2--(-2,-2)--(-2,0)--(-2,2)--(0,2)--(2,2)--(2,0)--(2,-2)--(0,-2); path[] g3=g2^^(-2,-2)--(0,-2)^^(2,-2)--(1,-1)^^(1,1)--(2,2)^^(-1,1)--(-2,2); path[] f4=f3^^(-3,-3)--(-3,-1)--(-3,1)--(-3,3)--(-1,3)--(1,3)--(3,3)-- (3,1)--(3,-1)--(3,-3)--(1,-3)--(-1,-3); path[] g4=g3^^(-2,-2)--(-3,-3)--(-1,-3)^^(3,-3)--(2,-2)^^(2,2)--(3,3)^^ (-2,2)--(-3,3); draw(f1,m); draw(shift(5,0)*f2,m); draw(shift(5,0)*g2); draw(shift(12,0)*f3,m); draw(shift(12,0)*g3); draw(shift(21,0)*f4,m); draw(shift(21,0)*g4); label("$F_1$",(0,-4)); label("$F_2$",(5,-4)); label("$F_3$",(12,-4)); label("$F_4$",(21,-4));[/asy]$ \textbf{(A)}\ 401 \qquad \textbf{(B)}\ 485 \qquad \textbf{(C)}\ 585 \qquad \textbf{(D)}\ 626 \qquad \textbf{(E)}\ 761$

Students in a school are arranged in an order that when you count from left to right, there will be $n$ students in the first row, $n-1$ students in the second row, $n - 2$ students in the third row,... until there is one student in the $n$th row. All the students face to the first row. For example, here is an arrangement for $n = 5$, where each $*$ represents one student: $*$ $* *$ $* * *$ $* * * *$ $* * * * *$ (first row) Each student will pick one of two following statement (except the student standing at the beginning of the row): i) The guy before me is telling the truth, while the guy standing next to him on the left is lying. ii) The guy before me is lying, while the guy standing next to him on the left is telling the truth. For $n = 2015$, find the maximum number of students telling the truth. (A student is lying if what he said is not true. Otherwise, he is telling the truth.)

Regular tetrahedron $P_1P_2P_3P_4$ has side length $1$. Define $P_i$ for $i > 4$ to be the centroid of tetrahedron $P_{i-1}P_{i-2}P_{i-3}P_{i-4}$, and $P_{ \infty} = \lim_{n\to \infty} P_n$. What is the length of $P_5P_{ \infty}$?

Let $n$ be a positive integer. Daniel and Merlijn are playing a game. Daniel has $k$ sheets of paper lying next to each other on a table, where $k$ is a positive integer. On each of the sheets, he writes some of the numbers from $1$ up to $n$ (he is allowed to write no number at all, or all numbers). On the back of each of the sheets, he writes down the remaining numbers. Once Daniel is finished, Merlijn can flip some of the sheets of paper (he is allowed to flip no sheet at all, or all sheets). If Merlijn succeeds in making all of the numbers from $1$ up to n visible at least once, then he wins. Determine the smallest $k$ for which Merlijn can always win, regardless of Daniel’s actions.

Let $ n \in \mathbb{Z}^\plus{}$ and let $ a, b \in \mathbb{R}.$ Determine the range of $ x_0$ for which \[ \sum^n_{i\equal{}0} x_i \equal{} a \text{ and } \sum^n_{i\equal{}0} x^2_i \equal{} b,\] where $ x_0, x_1, \ldots , x_n$ are real variables.

A set $S$ of positive integers is said to be [i]channeler[/i] if for any three distinct numbers $a,b,c \in S$, we have $a\mid bc$, $b\mid ca$, $c\mid ab$. a) Prove that for any finite set of positive integers $ \{ c_1, c_2, \ldots, c_n \} $ there exist infinitely many positive integers $k$, such that the set $ \{ kc_1, kc_2, \ldots, kc_n \} $ is a channeler set. b) Prove that for any integer $n \ge 3$ there is a channeler set who has exactly $n$ elements, and such that no integer greater than $1$ divides all of its elements.

Let $A$ be a set with $|A|=225$, meaning that $A$ has 225 elements. Suppose further that there are eleven subsets $A_1, \ldots, A_{11}$ of $A$ such that $|A_i|=45$ for $1\leq i\leq11$ and $|A_i\cap A_j|=9$ for $1\leq i<j\leq11$. Prove that $|A_1\cup A_2\cup\ldots\cup A_{11}|\geq 165$, and give an example for which equality holds.

There are direct routes from every city of a certain country to every other city. The prices are known in advance. Two tourists (they do not necessary start from one city) have decided to visit all the cities, using only direct travel lines. The first always chooses the cheapest ticket to the city, he has never been before (if there are several -- he chooses arbitrary destination among the cheapests). The second -- the most expensive (they do not return to the first city). Prove that the first will spend not more money for the tickets, than the second.

Let \(x,y,z\) be real numbers, each greater than \(1\). Prove that \(\dfrac{x+1}{y+1}+\dfrac{y+1}{z+1}+\dfrac{z+1}{x+1} \leq \dfrac{x-1}{y-1}+\dfrac{y-1}{z-1}+\dfrac{z-1}{x-1}\).

Let $ABCD$ be a square (vertices labelled in clockwise order). Let $Z$ be any point on diagonal $AC$ between $A$ and $C$ such that $AZ > ZC$. Points $X$ and $Y$ exist such that $AXY Z $ is a square (vertices labelled in clockwise order) and point $B$ lies inside $AXY Z$. Let $M$ be the point of intersection of lines $BX$ and $DZ$ (extended if necessary). Prove that $C$, $M$ and $Y$ are colinear

Prove that for each real number $r>2$, there are exactly two or three positive real numbers $x$ satisfying the equation $x^2=r\lfloor x \rfloor$.

Find the maximum number of Permutation of set {$1,2,3,...,2014$} such that for every 2 different number $a$ and $b$ in this set at last in one of the permutation $b$ comes exactly after $a$

For positive real numbers $a,b,c,d$, with $abcd = 1$, determine all values taken by the expression \[\frac {1+a+ab} {1+a+ab+abc} + \frac {1+b+bc} {1+b+bc+bcd} +\frac {1+c+cd} {1+c+cd+cda} +\frac {1+d+da} {1+d+da+dab}.\] (Dan Schwarz)

Prove that the equation \[6(6a^{2}+3b^{2}+c^{2}) = 5n^{2}\] has no solutions in integers except $a=b=c=n=0$.

If $\angle A = 20^\circ$ and $\angle AFG = \angle AGF$, then $\angle B + \angle D = $ [asy] pair A,B,C,D,EE,F,G; A = (0,0); B = (9,4); C = (21,0); D = (13,-12); EE = (4,-16); F = (13/2,-6); G = (8,0); draw(A--C--EE--B--D--cycle); label("$A$",A,W); label("$B$",B,N); label("$C$",C,E); label("$D$",D,SE); label("$E$",EE,SW); label("$F$",F,WSW); label("$G$",G,NW); [/asy] $\text{(A)}\ 48^\circ \qquad \text{(B)}\ 60^\circ \qquad \text{(C)}\ 72^\circ \qquad \text{(D)}\ 80^\circ \qquad \text{(E)}\ 90^\circ$