The graph of the function $ f$ is shown below. How many solutions does the equation $ f(f(x)) \equal{} 6$ have? [asy]size(220); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=4; pair P1=(-7,-4), P2=(-2,6), P3=(0,0), P4=(1,6), P5=(5,-6); real[] xticks={-7,-6,-5,-4,-3,-2,-1,1,2,3,4,5,6}; real[] yticks={-6,-5,-4,-3,-2,-1,1,2,3,4,5,6}; draw(P1--P2--P3--P4--P5); dot("(-7, -4)",P1); dot("(-2, 6)",P2,LeftSide); dot("(1, 6)",P4); dot("(5, -6)",P5); xaxis("$x$",-7.5,7,Ticks(xticks),EndArrow(6)); yaxis("$y$",-6.5,7,Ticks(yticks),EndArrow(6));[/asy]$ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 7$

Alice and Bob play a game where they start from a complete graph with $n$ vertices and take turns removing a single edge from the graph, with Alice taking the first turn. The first player to disconnect the graph loses. Compute the sum of all $n$ between $2$ and $100$ inclusive such that Alice has a winning strategy. (A complete graph is one where there is an edge between every pair of vertices.)

Faces of a convex polyhedron are six squares and 8 equilateral triangles and each edge is a common side for one triangle and one square. All dihedral angles obtained from the triangle and square with a common edge, are equal. Prove that it is possible to circumscribe a sphere around the polyhedron, and compute the ratio of the squares of volumes of that polyhedron and of the ball whose boundary is the circumscribed sphere.

Prove that for every positive integer $t$ there is a unique permutation $a_0, a_1, \ldots , a_{t-1}$ of $0, 1, \ldots , t-1$ such that, for every $0 \leq i \leq t-1$, the binomial coefficient $\binom{t+i}{2a_i}$ is odd and $2a_i \neq t+i$.

The grid below contains six rows with six points in each row. Points that are adjacent either horizontally or vertically are a distance two apart. Find the area of the irregularly shaped ten sided figure shown. [asy] import graph; size(5cm); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); pen dotstyle = black; draw((-2,5)--(-3,4), linewidth(1.6)); draw((-3,4)--(-2,1), linewidth(1.6)); draw((-2,1)--(1,0), linewidth(1.6)); draw((1,0)--(2,1), linewidth(1.6)); draw((2,1)--(1,3), linewidth(1.6)); draw((1,3)--(1,4), linewidth(1.6)); draw((1,4)--(2,5), linewidth(1.6)); draw((2,5)--(0,5), linewidth(1.6)); draw((-2,5)--(-1,4), linewidth(1.6)); draw((-1,4)--(0,5), linewidth(1.6)); dot((-3,5),linewidth(6pt) + dotstyle); dot((-2,5),linewidth(6pt) + dotstyle); dot((-1,5),linewidth(6pt) + dotstyle); dot((0,5),linewidth(6pt) + dotstyle); dot((1,5),linewidth(6pt) + dotstyle); dot((2,5),linewidth(6pt) + dotstyle); dot((2,4),linewidth(6pt) + dotstyle); dot((2,3),linewidth(6pt) + dotstyle); dot((2,2),linewidth(6pt) + dotstyle); dot((2,1),linewidth(6pt) + dotstyle); dot((2,0),linewidth(6pt) + dotstyle); dot((-3,4),linewidth(6pt) + dotstyle); dot((-3,3),linewidth(6pt) + dotstyle); dot((-3,2),linewidth(6pt) + dotstyle); dot((-3,1),linewidth(6pt) + dotstyle); dot((-3,0),linewidth(6pt) + dotstyle); dot((-2,0),linewidth(6pt) + dotstyle); dot((-2,1),linewidth(6pt) + dotstyle); dot((-2,2),linewidth(6pt) + dotstyle); dot((-2,3),linewidth(6pt) + dotstyle); dot((-2,4),linewidth(6pt) + dotstyle); dot((-1,4),linewidth(6pt) + dotstyle); dot((0,4),linewidth(6pt) + dotstyle); dot((1,4),linewidth(6pt) + dotstyle); dot((1,3),linewidth(6pt) + dotstyle); dot((0,3),linewidth(6pt) + dotstyle); dot((-1,3),linewidth(6pt) + dotstyle); dot((-1,2),linewidth(6pt) + dotstyle); dot((-1,1),linewidth(6pt) + dotstyle); dot((-1,0),linewidth(6pt) + dotstyle); dot((0,0),linewidth(6pt) + dotstyle); dot((1,0),linewidth(6pt) + dotstyle); dot((1,1),linewidth(6pt) + dotstyle); dot((1,2),linewidth(6pt) + dotstyle); dot((0,2),linewidth(6pt) + dotstyle); dot((0,1),linewidth(6pt) + dotstyle); [/asy]

Let $ a,b,c,d$ be nonnegative real numbers. Prove that \[ a^4\plus{}b^4\plus{}c^4\plus{}d^4\plus{}2abcd \ge a^2b^2\plus{}a^2c^2\plus{}a^2d^2\plus{}b^2c^2\plus{}b^2d^2\plus{}c^2d^2.\]

Prove that for any positive integers $x, y, z$ with $xy-z^2 = 1$ one can find non-negative integers $a, b, c, d$ such that $x = a^2 + b^2, y = c^2 + d^2, z = ac + bd$. Set $z = (2q)!$ to deduce that for any prime number $p = 4q + 1$, $p$ can be represented as the sum of squares of two integers.

Determine all positive integers in the form $a<b<c<d$ with the property that each of them divides the sum of the other three.

Let $m$, $n$ be two positive integers greater than 3. Consider the table of size $m\times n$ ($m$ rows and $n$ columns) formed with unit squares. We are putting marbles into unit squares of the table following the instructions: $-$ each time put 4 marbles into 4 unit squares (1 marble per square) such that the 4 unit squares formes one of the followings 4 pictures (click [url=http://www.mathlinks.ro/Forum/download.php?id=4425]here[/url] to view the pictures). In each of the following cases, answer with justification to the following question: Is it possible that after a finite number of steps we can set the marbles into all of the unit squares such that the numbers of marbles in each unit square is the same? a) $m=2004$, $n=2006$; b) $m=2005$, $n=2006$.

Consider the functions $ f(x) = ax^{2} + bx + c $ , $ g(x) = cx^{2} + bx + a $, where a, b, c are real numbers. Given that $ |f(-1)| \leq 1 $, $ |f(0)| \leq 1 $, $ |f(1)| \leq 1 $, prove that $ |f(x)| \leq \frac{5}{4} $ and $ |g(x)|  \leq 2 $ for $ -1 \leq  x \leq 1 $.

Given a positive integer $a,$ prove that $n!$ is divisible by $n^2 + n + a$ for infinitely many positive integers $n.{}$ [i]Proposed by Andrei Bâra[/i]

Find all positive integers $a\in \{1,2,3,4\}$ such that if $b=2a$, then there exist infinitely many positive integers $n$ such that $$\underbrace{aa\dots aa}_\textrm{$2n$}-\underbrace{bb\dots bb}_\textrm{$n$}$$ is a perfect square.

Cities $P_1,...,P_{1025}$ are connected to each other by airlines $A_1,...,A_{10}$ so that for any two distinct cities $P_k$ and $P_m$ there is an airline offering a direct flight between them. Prove that one of the airlines can offer a round trip with an odd number of flights.

Show that the roots of $x^4 +ax^3 +bx^2 +cx +d$, if suitably numbered, satisfy the relation $\frac{r_1 }{r_2 } = \frac{ r_3 }{r _4},$ provided $a^2 d=c^2 \ne 0.$

The incircle of a right triangle $ABC$ touches its hypotenuse $BC$ at point $D$. The line $AD$ intersects the circumscribed circle at point $X$. Prove that $ |BX-CX| \geqslant |AD - DX|$.

Let $h \ge 3$ be an integer and $X$ the set of all positive integers that are greater than or equal to $2h$. Let $S$ be a nonempty subset of $X$ such that the following two conditions hold: [list] [*]if $a + b \in S$ with $a \ge h, b \ge h$, then $ab \in S$; [*]if $ab \in S$ with $a \ge h, b \ge h$, then $a + b \in S$.[/list] Prove that $S = X$.

Let $ ABCD$ be a given tetrahedron, with $ BC \equal{} a$, $ CA \equal{} b$, $ AB \equal{} c$, $ DA \equal{} a_1$, $ DB \equal{} b_1$, $ DC \equal{} c_1$. Prove that there is a unique point $ P$ satisfying \[ PA^2 \plus{} a_1^2 \plus{} b^2 \plus{} c^2 \equal{} PB^2 \plus{} b_1^2 \plus{} c^2 \plus{} a^2 \equal{} PC^2 \plus{} c_1^2 \plus{} a^2 \plus{} b^2 \equal{} PD^2 \plus{} a_1^2 \plus{} b_1^2 \plus{} c_1^2 \] and for this point $ P$ we have $ PA^2 \plus{} PB^2 \plus{} PC^2 \plus{} PD^2 \ge 4R^2$, where $ R$ is the circumradius of the tetrahedron $ ABCD$. Find the necessary and sufficient condition so that this inequality is an equality.

The following geometry is embedded in the Cartesian plane. [b]a)[/b] Prove that any line that passes through at least two lattice points, passes through at least three lattice points. [b]b)[/b] Find a point on the plane which doesn't lie on any line that passes through at least two lattice points. [b]c)[/b] Show that any point with rational coordinates lie on a line that passes through two lattice points. [i]Lavinia Savu[/i]

Let $ABC$ be an acute triangle and let $X$ and $Y$ be points on the segments $AB$ and $AC$ such that $BX = CY$. If $I_{B}$ and $I_{C}$ are centers of inscribed circles in triangles $ABY$ and $ACX$, and $T$ is the second intersection point of the circumcircles of $ABY$ and $ACX$, show that: $$\frac{TI_{B}}{TI_{C}} = \frac{BY}{CX}.$$ [i]Proposed by Nikola Velov[/i]

(10.4) A set of numbers $a_0, a_1,..., a_n$ satisfies the conditions: $a_0 = 0$, $0 \le a_{k+1}- a_k \le 1$ for $k = 0, 1, .. , n -1$. Prove the inequality $$\sum_{k=1}^n a^3_k \le \left(\sum_{k=1}^n a_k \right)^2$$ (11.3) A set of numbers $a_0, a_1,..., a_n$ satisfies the conditions: $a_0 = 0$, $a_{k+1} \ge a_k + 1$ for $k = 0, 1, .. , n -1$. Prove the inequality $$\sum_{k=1}^n a^3_k \ge \left(\sum_{k=1}^n a_k \right)^2$$

Let $C$ be a circle and $P$ a given point in the plane. Each line through $P$ which intersects $C$ determines a chord of $C$. Show that the midpoints of these chords lie on a circle.

Let $ a,\ b$ be real numbers satisfying $ \int_0^1 (ax\plus{}b)^2dx\equal{}1$. Determine the values of $ a,\ b$ for which $ \int_0^1 3x(ax\plus{}b)\ dx$ is maximized.

How many functions $f: \left\{1,2,3\right\} \to \left\{1,2,3 \right\}$ satisfy $f(f(x))=f(f(f(x)))$ for every $ x $?

Let $a,b$ be two natural numbers. When we divide $a^2+b^2$ by $a+b$, we the the remainder $r$ and the quotient $q.$ Determine all pairs $(a, b)$ for which $q^2 + r = 1977.$

From numbers $ 1,2,3,...,37$ we randomly choose 10 numbers. Prove that among these exist four distinct numbers, such that sum of two of them equals to the sum of other two.