Given a cube. On each edge of the cube, we write a number, either $1$ or $-1$. For each face of the cube, we multiply the four numbers on the edges of this face, and write the product on this face. Finally, we add all the eighteen numbers that we wrote down on the edges and face of the cube. What is the smallest possible sum that we can get?

In triangle $ABC$, $AB=13$, $BC=14$, and $CA=15$. Distinct points $D$, $E$, and $F$ lie on segments $\overline{BC}$, $\overline{CA}$, and $\overline{DE}$, respectively, such that $\overline{AD}\perp\overline{BC}$, $\overline{DE}\perp\overline{AC}$, and $\overline{AF}\perp\overline{BF}$. The length of segment $\overline{DF}$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? ${ \textbf{(A)}\ 18\qquad\textbf{(B)}\ 21\qquad\textbf{(C)}\ 24\qquad\textbf{(D}}\ 27\qquad\textbf{(E)}\ 30 $

Determine all sequences of non-negative integers $a_1, \ldots, a_{2016}$ all less than or equal to $2016$ satisfying $i+j\mid ia_i+ja_j$ for all $i, j\in \{ 1,2,\ldots, 2016\}$.

Find all real $x > 0$ and integer $n > 0$ so that $$ \lfloor x \rfloor+\left\{ \frac{1}{x}\right\}= 1.005 \cdot n.$$

Let $ABCDE$ be a convex pentagon such that angles $CAB$, $BCA$, $ECD$, $DEC$ and $AEC$ are equal. Prove that $CE$ bisects $BD$.

Alex launches his boat into a river and heads upstream at a constant speed. At the same time at a point $8$ miles upstream from Alex, Alice launches her boat and heads downstream at a constant speed. Both boats move at $6$ miles per hour in still water, but the river is owing downstream at $2\frac{3}{10}$ miles per hour. Alex and Alice will meet at a point that is $\frac{m}{n}$ miles from Alex's starting point, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Find all positive integer $ n$ satisfying the following condition: There exist positive integers $ m$, $ a_1$, $ a_2$, $ \cdots$, $ a_{m\minus{}1}$, such that $ \displaystyle n \equal{} \sum_{i\equal{}1}^{m\minus{}1} a_i(m\minus{}a_i)$, where $ a_1$, $ a_2$, $ \cdots$, $ a_{m\minus{}1}$ may not distinct and $ 1 \leq a_i \leq m\minus{}1$.

The faces of a box with integer edge lengths are painted green. The box is partitioned into unit cubes. Find the dimensions of the box if the number of unit cubes with no green face is one third of the total number of cubes.

Let $k$ and $d$ be positive integers. Prove that there exists a positive integer $N$ such that for every odd integer $n>N$, the digits in the base-$2n$ representation of $n^k$ are all greater than $d$.

For a point $ M$ inside an equilateral triangle $ ABC$, let $ D,E,F$ be the feet of the perpendiculars from $ M$ onto $ BC,CA,AB$, respectively. Find the locus of all such points $ M$ for which $ \angle FDE$ is a right angle.

(A.Zaslavsky) A convex polygon can be divided into 2008 congruent quadrilaterals. Is it true that this polygon has a center or an axis of symmetry?

Find all positive integers $x$ for which there exists a positive integer $y$ such that $\dbinom{x}{y}=1999000$

The numbers $p, 4p^2 + 1,$ and $6p^2 + 1$ are primes. Determine $p.$

Let $O$ be the circumcenter and $H$ the orthocenter of an acute triangle $ABC$. Show that there exist points $D$, $E$, and $F$ on sides $BC$, $CA$, and $AB$ respectively such that \[ OD + DH = OE + EH = OF + FH\] and the lines $AD$, $BE$, and $CF$ are concurrent.

Find $n$ so that $(4^{n+7})^3=(2^{n+23})^4.$

Which of the following values is largest? $\textbf{(A) }2+0+1+7\qquad\textbf{(B) }2 \times 0 +1+7\qquad\textbf{(C) }2+0 \times 1 + 7\qquad\textbf{(D) }2+0+1 \times 7\qquad\textbf{(E) }2 \times 0 \times 1 \times 7$

A graph has $ n$ vertices and $ \frac {1}{2}\left(n^2 \minus{} 3n \plus{} 4\right)$ edges. There is an edge such that, after removing it, the graph becomes unconnected. Find the greatest possible length $ k$ of a circuit in such a graph.

Given $5$ points in a plane, no three of them being collinear. Each two of these $5$ points are joined with a segment, and every of these segments is painted either red or blue; assume that there is no triangle whose sides are segments of equal color. [b]a.)[/b] Show that: [i](1)[/i] Among the four segments originating at any of the $5$ points, two are red and two are blue. [i](2)[/i] The red segments form a closed way passing through all $5$ given points. (Similarly for the blue segments.) [b]b.)[/b] Give a plan how to paint the segments either red or blue in order to have the condition (no triangle with equally colored sides) satisfied.

We call polynomial $S(x)\in\mathbb{R}[x]$ sadeh whenever it's divisible by $x$ but not divisible by $x^2$. For the polynomial $P(x)\in\mathbb{R}[x]$ we know that there exists a sadeh polynomial $Q(x)$ such that $P(Q(x))-Q(2x)$ is divisible by $x^2$. Prove that there exists sadeh polynomial $R(x)$ such that $P(R(x))-R(2x)$ is divisible by $x^{1401}$.

Maria has a $6 \times 5$ board with some shaded squares, as in the figure. She writes, in some order, the digits $1, 2, 3, 4$ and $5$ in the first row and then completes the board as follows: look at the number written in the shaded box and write the number that occupies the position indicated by the box shaded as the last number in the next row, and repeat the other numbers in the first four squares, following the same order as in the previous row. For example, if you wrote $2, 3, 4, 1, 5$ in the first row, then since $4$ is in the shaded box, the number that occupies the fourth place $(1)$ is written in the last box of the second row and completes it with the remaining numbers in the order in which. They were. She remains: $2, 3, 4, 5, 1$. Then, to complete the third row, as in the shaded box is $3$, the number located in the third place $(4)$ writes it in the last box and gets $2, 3, 5, 1, 4$. Following in the same way, he gets the board of the figure. Show a way to locate the numbers in the first row to get the numbers $2, 4, 5, 1, 3$ in the last row.

We consider a square $ABCD$ and a point $E$ on the segment $CD$. The bisector of $\angle EAB$ cuts the segment $BC$ in $F$. Prove that $BF + DE = AE$.

When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)

Let $ABCD$ be a parallelogram. An interior circle of the $ABCD$ is tangent to the lines $AB$ and $AD$ and intersects the diagonal $BD$ at $E$ and $F$. Prove that exists a circle that passes through $E$ and $F$ and is tangent to the lines $CB$ and $CD$.

For any positive integer $n$, let $S_n$ denote the set of positive integers which cannot be written in the form $an+2017b$ for nonnegative integers $a$ and $b$. Let $A_n$ denote the average of the elements of $S_n$ if the cardinality of $S_n$ is positive and finite, and $0$ otherwise. Compute \[\left\lfloor\displaystyle\sum_{n=1}^{\infty}\frac{A_n}{2^n}\right\rfloor.\] [i]Proposed by Tristan Shin[/i]

[b]p1.[/b] Find all real solutions of the system $$x^5 + y^5 = 1$$ $$x^6 + y^6 = 1$$ [b]p2.[/b] The centers of three circles of the radius $R$ are located in the vertexes of equilateral triangle. The length of the sides of the triangle is $a$ and $\frac{a}{2}< R < a$. Find the distances between the intersection points of the circles, which are outside of the triangle. [b]p3.[/b] Prove that no positive integer power of $2$ ends with four equal digits. [b]p4.[/b] A circle is divided in $10$ sectors. $90$ coins are located in these sectors, $9$ coins in each sector. At every move you can move a coin from a sector to one of two neighbor sectors. (Two sectors are called neighbor if they are adjoined along a segment.) Is it possible to move all coins into one sector in exactly$ 2004$ moves? [b]p5.[/b] Inside a convex polygon several points are arbitrary chosen. Is it possible to divide the polygon into smaller convex polygons such that every one contains exactly one given point? Justify your answer. [b]p6.[/b] A troll tried to spoil a white and red $8\times 8$ chessboard. The area of every square of the chessboard is one square foot. He randomly painted $1.5\%$ of the area of every square with black ink. A grasshopper jumped on the spoiled chessboard. The length of the jump of the grasshopper is exactly one foot and at every jump only one point of the chessboard is touched. Is it possible for the grasshopper to visit every square of the chessboard without touching any black point? Justify your answer. PS. You should use hide for answers.