We have twenty-seven $1$ by $1$ cubes. Each face of every cube is marked with a natural number so that two opposite faces (top and bottom, front and back, left and right) are always marked with an even number and an odd number where the even number is twice that of the odd number. The twenty-seven cubes are put together to form one $3$ by $3$ cube as shown. When two cubes are placed face-to-face, adjoining faces are always marked with an odd number and an even number where the even number is one greater than the odd number. Find the sum of all of the numbers on all of the faces of all the $1$ by $1$ cubes. [asy] import graph; size(7cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); draw((-1,7)--(-1,4)); draw((-1,9.15)--(-3.42,8.21)); draw((-1,9.15)--(1.42,8.21)); draw((-1,7)--(1.42,8.21)); draw((1.42,7.21)--(-1,6)); draw((1.42,6.21)--(-1,5)); draw((1.42,5.21)--(-1,4)); draw((1.42,8.21)--(1.42,5.21)); draw((-3.42,8.21)--(-3.42,5.21)); draw((-3.42,7.21)--(-1,6)); draw((-3.42,8.21)--(-1,7)); draw((-1,4)--(-3.42,5.21)); draw((-3.42,6.21)--(-1,5)); draw((-2.61,7.8)--(-2.61,4.8)); draw((-1.8,4.4)--(-1.8,7.4)); draw((-0.2,7.4)--(-0.2,4.4)); draw((0.61,4.8)--(0.61,7.8)); label("2",(-1.07,9.01),SE*labelscalefactor); label("9",(-1.88,8.65),SE*labelscalefactor); label("1",(-2.68,8.33),SE*labelscalefactor); label("3",(-0.38,8.72),SE*labelscalefactor); draw((-1.8,7.4)--(0.63,8.52)); draw((-0.27,8.87)--(-2.61,7.8)); draw((-2.65,8.51)--(-0.2,7.4)); draw((-1.77,8.85)--(0.61,7.8)); label("7",(-1.12,8.33),SE*labelscalefactor); label("5",(-1.9,7.91),SE*labelscalefactor); label("1",(0.58,8.33),SE*labelscalefactor); label("18",(-0.36,7.89),SE*labelscalefactor); label("1",(-1.07,7.55),SE*labelscalefactor); label("1",(-0.66,6.89),SE*labelscalefactor); label("5",(-0.68,5.8),SE*labelscalefactor); label("1",(-0.68,4.83),SE*labelscalefactor); label("2",(0.09,7.27),SE*labelscalefactor); label("1",(0.15,6.24),SE*labelscalefactor); label("2",(0.11,5.26),SE*labelscalefactor); label("1",(0.89,7.61),SE*labelscalefactor); label("3",(0.89,6.63),SE*labelscalefactor); label("9",(0.92,5.62),SE*labelscalefactor); label("18",(-3.18,7.63),SE*labelscalefactor); label("2",(-3.07,6.61),SE*labelscalefactor); label("2",(-3.09,5.62),SE*labelscalefactor); label("1",(-2.29,7.25),SE*labelscalefactor); label("3",(-2.27,6.22),SE*labelscalefactor); label("5",(-2.29,5.2),SE*labelscalefactor); label("7",(-1.49,6.89),SE*labelscalefactor); label("34",(-1.52,5.81),SE*labelscalefactor); label("1",(-1.41,4.86),SE*labelscalefactor); [/asy]

Edward's formula for the stock market predicts correctly that the price of HMMT is directly proportional to a secret quantity $ x$ and inversely proportional to $ y$, the number of hours he slept the night before. If the price of HMMT is $ \$12$ when $ x\equal{}8$ and $ y\equal{}4$, how many dollars does it cost when $ x\equal{}4$ and $ y\equal{}8$?

Let be a subset of the interval $ (0,1) $ that contains $ 1/2 $ and has the property that if a number is in this subset, then, both its half and its successor's inverse are in the same subset. Prove that this subset contains all the rational numbers of the interval $ (0,1). $

Let $S$ be the set of positive integers. For any $a$ and $b$ in the set we have $GCD(a, b)>1$. For any $a$, $b$ and $c$ in the set we have $GCD(a, b, c)=1$. Is it possible that $S$ has $2012$ elements? [i]Proposed by Ognjen Stipetić.[/i]

Find the number of subsets of $\{1, 2,... , 2100\}$ such that each has sum of the elements giving a remainder of $3$ when divided by $7$.

On the board were written the numbers from $1$ to $k$ (where $k$ is an unknown positive integer). One of the numbers was erased. The average of the remaining numbers is $25.25$. Which number was erased?

If $a, b, c$ are non-negative real numbers with $ a^2 \plus{} b^2 \plus{} c^2 \equal{} 1$, prove that: \[ \frac {a}{b^2 \plus{} 1} \plus{} \frac {b}{c^2 \plus{} 1} \plus{} \frac {c}{a^2 \plus{} 1} \geq \frac {3}{4}(a\sqrt {a} \plus{} b\sqrt {b} \plus{} c\sqrt {c})^2\]

Determine all pairs $(f,g)$ of functions from the set of real numbers to itself that satisfy \[g(f(x+y)) = f(x) + (2x + y)g(y)\] for all real numbers $x$ and $y$. [i]Proposed by Japan[/i]

Let $f:[0,1]\to\mathbb R$ be an increasing function. Prove that if $\int_0^1f(x)dx=\int_0^1\left(\int_0^xf(t)dt\right)dx=0$ then $f(x)=0,\forall x\in(0,1)$. [i]Mihai Piticari[/i]

Prove that for all natural numbers $n$, \[ \sum_{k=1}^{n^2} \left\{ \sqrt{k} \right\} \le \frac{n^2-1}{2}. \] Here, $\{x\}$ denotes the fractional part of $x$.

A $5 \times 5$ grid is given, called $f_1$: \[ \begin{array}{ccccc} 1 & 1 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 & 1 \\ -1 & 1 & -1 & 1 & -1 \\ 1 & 1 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 & 1 \\ \end{array} \] A new grid $f_{n+1}$ is constructed where each cell is equal to the product of its neighboring cells in grid $f_n$. (a) Find the grids $f_6$ and $f_7$. (b) Find the grids $f_{2008}$ and $f_{2009}$. (c) Find $f_{2n}$ and $f_{2n+1}$ for any $n \in \mathbb{N}$. *Note: Neighboring cells are those that share an edge, not just a vertex.*

Determine all polynomials $P(x)$ with integer coefficients such that $P(n)$ is divisible by $\sigma(n)$ for all positive integers $n$. (As usual, $\sigma(n)$ denotes the sum of all positive divisors of $n$.)

If $0 < p$, $0 < q$ and $p +q < 1$ prove $$(px + qy)^2 \le px^2 + qy^2$$

In convex pentagon $ABCDE$ points $A_1$, $B_1$, $C_1$, $D_1$, $E_1$ are intersections of pairs of diagonals $(BD, CE)$, $(CE, DA)$, $(DA, EB)$, $(EB, AC)$ and $(AC, BD)$ respectively. Prove that if four of quadrilaterals $AB_{1}A_{1}B$, $BC_{1}B_{1}C$, $CD_{1}C_{1}D$, $DE_{1}D_{1}E$ and $EA_{1}E_{1}A$ are cyclic then the fifth one is also cyclic.

Let $S_{n}$ be the sum of the digits of $2^n$. Prove or disprove that $S_{n+1}=S_{n}$ for some positive integer $n$.

Solve the equation $2^x -5 =11^{y}$ in positive integers.

Let $A$ be a point outside of the circle $\Omega$. Tangents from $A$ touch $\Omega$ in points $B$ and $C$. Point $C$, collinear with $A$ and $P$, is between $A$ and $P$, such that the circumcircle of triangle $ABP$ intersects $\Omega$ again in point $E$. Point $Q$ is on the segment $BP$, such that $\angle PEQ=2 \cdot \angle APB$. Prove that the lines $BP$ and $CQ$ are perpendicular.

In every cell of a table with $n$ rows and ten columns, a digit is written. It is known that for every row $A$ and any two columns, you can always find a row that has different digits from $A$ only when it intersects with two columns. Prove that $n\geq512$.

Let $n$ be an odd positive integer. Given are $n$ balls - black and white, placed on a circle. For a integer $1\leq k \leq n-1$, call $f(k)$ the number of balls, such that after shifting them with $k$ positions clockwise, their color doesn't change. a) Prove that for all $n$, there is a $k$ with $f(k) \geq \frac{n-1}{2}$. b) Prove that there are infinitely many $n$ (and corresponding colorings for them) such that $f(k)\leq \frac{n-1}{2}$ for all $k$.

The diagonals $AD$, $BE$, $CF$ of cyclic hexagon $ABCDEF$ intersect in $S$ and $AB$ is parallel to $CF$ and lines $DE$ and $CF$ intersect each other in $M$. Let $N$ be a point such that $M$ is the midpoint of $SN$. Prove that circumcircle of $\triangle ADN$ is passing through midpoint of segment $CF$.

Let $ABCD$ be an isosceles trapezoid such that its diagonal is $\sqrt 3$ and its base angle is $60^\circ$, where $AD \parallel BC$. Let $P$ be a point on the plane of the trapezoid such that $|PA|=1$ and $|PD|=3$. Which of the following can be the length of $[PC]$? $ \textbf{(A)}\ \sqrt 6 \qquad\textbf{(B)}\ 2\sqrt 2 \qquad\textbf{(C)}\ 2 \sqrt 3 \qquad\textbf{(D)}\ 3\sqrt 3 \qquad\textbf{(E)}\ \sqrt 7 $

Let $a,b$ be nonnegative integers. Prove that $5a>7b$ if and only if there exist nonnegative integers $x,y,z,t$ such that \begin{align*} x+2y+3z+7t&=a,\\ y+2z+5t&=b. \end{align*}

Let $ABC$ be a nondegenerate acute triangle with circumcircle $\omega$ and let its incircle $\gamma$ touch $AB, AC, BC$ at $X, Y, Z$ respectively. Let $XY$ hit arcs $AB, AC$ of $\omega$ at $M, N$ respectively, and let $P \neq X, Q \neq Y$ be the points on $\gamma$ such that $MP=MX, NQ=NY$. If $I$ is the center of $\gamma$, prove that $P, I, Q$ are collinear if and only if $\angle BAC=90^\circ$. [i]Proposed by David Stoner[/i]

Consider a sequence of non-negative integers g$_1,g_2,g_3,...$ each consisting of three digits (numbers smaller than $100$ are also written with three digits; the number $27$, for example, is written as $027$). Each number consists of the preceding by taking the product of the three digits that make up the preceding. The resulting sequence is of course dependent on the choice of $g_1$ (e.g. $g_1 = 359$ leads to $g_2= 135$, $g_3= 015$, $g_4 = 000$).Prove that independent of the choice of $g_1$: (a) $g_{n+1}\le g_n$ (b) $g_{10}= 000$.

Given that $20N^2$ is a divisor of $11!,$ what is the greatest possible integer value of $N?$