A cell is cut from a chessboard $8\, x\, 8$, after which an open broken line was built, which vertices are the centers of the remaining cells. Each segment of the broken line has a length $\sqrt{17}$ or $\sqrt{65}$. When is the number of such broken lines bigger – when the cut cell is $(1,2)$ or $(3,6)$? (The rows and columns on the board are numerated consecutively from 1 to 8.)

Determine with proof, the number of permutations $a_1,a_2,a_3,...,a_{2016}$ of $1,2,3,...,2016$ such that the value of $|a_i-i|$ is fixed for all $i=1,2,3,...,2016$, and its value is an integer multiple of $3$.

There are $n$ ($n \ge 4$) straight lines on the plane. For two straight lines $a$ and $b$, if there are at least two straight lines among the remaining $n-2$ lines that intersect both straight lines $a$ and $b$, then $a$ and $b$ are called a [i]congruent [/i] pair of staight lines, otherwise it is called a [i]separated[/i] pair of straight lines. If the number of [i]congruent [/i] pairs of straight line among $n$ straight lines is $2012$ more than the number of [i]separated[/i] pairs of straight line , find the smallest possible value of $n$ (the order of the two straight lines in a pair is not counted).

Determine the volume of the body obtained by cutting the ball of radius $R$ by the trihedron with vertex in the center of that ball, it its dihedral angles are $\alpha, \beta, \gamma.$

Let $P$ be a fixed point and $T$ a given triangle that contains the point $P$. Translate the triangle $T$ by a given vector $\bold{v}$ and denote by $T'$ this new triangle. Let $r, R$, respectively, be the radii of the smallest disks centered at $P$ that contain the triangles $T , T'$, respectively. Prove that $r + |\bold{v}| \leq 3R$ and find an example to show that equality can occur.

[b]p1.[/b] A [i]multimagic [/i] square is a $3 \times 3$ array of distinct positive integers with the property that the product of the $3$ numbers in each row, each column, and each of the two diagonals of the array is always the same. (a) Prove that the numbers $1, 2, 3, . . . , 9$ cannot be used to form a multimagic square. (b) Give an example of a multimagic square. [b]p2.[/b] A sequence $a_1, a_2, a_3, ... , a_n$ of real numbers is called an arithmetic progression if $$a_1 - a_2 = a_2 - a_3 = ... = a_{n-1} - a_n.$$ Prove that there exist distinct positive integers $n_1, n_2, n_3, ... , n_{2014}$ such that $$\frac{1}{n_1},\frac{1}{n_2}, ... ,\frac{1}{n_{2014}}$$ is an arithmetic progression. [b]p3.[/b] Let $\lfloor x \rfloor$ be the largest integer that is less than or equal to $x$. For example, $\lfloor 3.9 \rfloor = 3$ and $\lfloor 4\rfloor = 4$. Determine (with proof) all real solutions of the equation $$x^2 - 25 \lfloor x\rfloor + 100 = 0.$$ [b]p4.[/b] An army has $10$ cannons and $8$ carts. Each cart can carry at most one cannon. It takes one day for a cart to cross the desert. What is the least number of days that it takes to get the cannons across the desert? (Cannons can be left part way and picked up later during the procedure.) Prove that the amount of time that your solution requires to move the cannons across the desert is the smallest possible. [b]p5.[/b] Let $C$ be a convex polygon with $4031$ sides. Let $p$ be the length of its perimeter and let $d$ be the sum of the lengths of its diagonals. Show that $$\frac{d}{p}> 2014.$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f$ mapping non-empty finite sets of integers, to integers, such that $$f(A+B)=f(A)+f(B)$$ for all non-empty sets of integers $A$ and $B$. $A+B$ is defined as $\{a+b: a \in A, b \in B\}$.

$2000$ people are standing on a line. Each one of them is either a [i]liar[/i], who will always lie, or a [i]truth-teller[/i], who will always tell the truth. Each one of them says: "there are more liars to my left than truth-tellers to my right". Determine, if possible, how many people from each class are on the line.

Find all pairs of positive integers $(a,b)$ such that $2^a+3^b$ is the square of an integer.

Let $C$ be the part of the graph $y=\frac{1}{x}\ (x>0)$. Take a point $P\left(t,\ \frac{1}{t}\right)\ (t>0)$ on $C$. (i) Find the equation of the tangent $l$ at the point $A(1,\ 1)$ on the curve $C$. (ii) Let $m$ be the line passing through the point $P$ and parallel to $l$. Denote $Q$ be the intersection point of the line $m$ and the curve $C$ other than $P$. Find the coordinate of $Q$. (iii) Express the area $S$ of the part bounded by two line segments $OP,\ OQ$ and the curve $C$ for the origin $O$ in terms of $t$. (iv) Express the volume $V$ of the solid generated by a rotation of the part enclosed by two lines passing through the point $P$ and pararell to the $y$-axis and passing through the point $Q$ and pararell to $y$-axis, the curve $C$ and the $x$-axis in terms of $t$. (v) $\lim_{t\rightarrow 1-0} \frac{S}{V}.$

Given the function $f(x) = x^2$, the sector of $f$ from $a$ to $b$ is defined as the limited region between the graph of $y = f(x)$ and the straight line segment that joins the points $(a, f(a))$ and $(b, f(b))$. Define the increasing sequence $x_0$, $x_1, \cdots$ with $x_0 = 0$ and $x_1 = 1$, such that the area of the sector of $f$ from $x_n$ to $x_{n+1}$ is constant for $n \geq 0$. Determine the value of $x_n$ in function of $n$.

Triangle $ABC$ has circumcircle $\omega$. Let $D$ be the foot of the altitude from $A$ to $BC$ and let $AD$ intersect $\omega$ at $E \neq A$. Let $M$ be the midpoint of $AD$. If $\angle{BMC} = 90^\circ$, $AB = 9$ and $AE = 10$, the area of $\triangle{ABC}$ can be expressed in the form $\frac{a\sqrt{b}}{c}$ where $a,b,c$ are positive integers and $b$ is square-free. Find $a+b+c$. [i]Proposed by Andy Xu[/i]

A perfect square ends with the same two digits. How many possible values of this digit are there?

Let $p$ be an odd prime. Prove that for every integer $k$, there exist integers $a, b$ such that $p|a^2 + b^2 - k$.

Bill walks $\tfrac12$ mile south, then $\tfrac34$ mile east, and finally $\tfrac12$ mile south. How many miles is he, in a direct line, from his starting point? $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 1\tfrac14\qquad\textbf{(C)}\ 1\tfrac12\qquad\textbf{(D)}\ 1\tfrac34\qquad\textbf{(E)}\ 2 $

Let $ a,b,c$ be positive real numbers such that $ a^3 \plus{} b^3 \equal{} c^3$.Prove that: $ a^2 \plus{} b^2 \minus{} c^2 > 6(c \minus{} a)(c \minus{} b)$.

In a triangle $ABC$ let $K$ be a point on the median $BM$ such that $CK=CM$. It appears that $\angle CBM = 2 \angle ABM$. Prove that $BC=MK$.

We build a tower of $2\times 1$ dominoes in the following way. First, we place $55$ dominoes on the table such that they cover a $10\times 11$ rectangle; this is the first story of the tower. We then build every new level with $55$ domioes above the exact same $10\times 11$ rectangle. The tower is called [i]stable[/i] if for every non-lattice point of the $10\times 11$ rectangle, we can find a domino that has an inner point above it. How many stories is the lowest [i]stable[/i] tower?

Find all positive integers $n$ such that for any integer $k$ there exists an integer $a$ for which $a^3+a-k$ is divisible by $n$. [i]Warut Suksompong, Thailand[/i]

The area of right triangle $ ABC $ is 4, and the length of hypotenuse $ AB $ is 12. Compute the perimeter of $ \triangle ABC $.

(a) Prove that if 3n stars are placed in $3n$ cells of a $2n \times 2n$ array, then it is possible to remove $n$ rows and $n$ columns in such away that all stars will be removed . (b) Prove that it is possible to place $3n + 1$ stars in the cells of a $2n \times 2n$ array in such a way that after removing any $n$ rows and $n$ columns at least one star remains. (K . P. Kohas, Leningrad)

An $8$ by $8$ square is divided into $64$ $1$ by $1$ squares, and must be covered by $64$ black and $64$ white, isosceles, right-angled triangles (each square must be covered by two triangles). A covering is said to be “fine” if any two neighbouring triangles (i.e. having a common side) are of different colours. How many different fine coverings are there? (NB Vassiliev)

On a table there are all 8 possible horizontal bars $1\times3$ such that each $1\times1$ square is either white or gray (see the figure). It is allowed to move them in any direction by any (not necessarily integer) distance. We may not rotate them or turn them over. Is it possible to move the bars so that they do not overlap, all the white points form a polygon bounded by a closed non-self-intersecting broken line and the same is true for all the gray points? [i]Mikhail Ilyinsky[/i]

Given an acute triangle $ABC$, $(c)$ its circumcircle with center $O$ and $H$ the orthocenter of the triangle $ABC$. The line $AO$ intersects $(c)$ at the point $D$. Let $D_1, D_2$ and $H_2, H_3$ be the symmetrical points of the points $D$ and $H$ with respect to the lines $AB, AC$ respectively. Let $(c_1)$ be the circumcircle of the triangle $AD_1D_2$. Suppose that the line $AH$ intersects again $(c_1)$ at the point $U$, the line $H_2H_3$ intersects the segment $D_1D_2$ at the point $K_1$ and the line $DH_3$ intersects the segment $UD_2$ at the point $L_1$. Prove that one of the intersection points of the circumcircles of the triangles $D_1K_1H_2$ and $UDL_1$ lies on the line $K_1L_1$.

What is the largest number of parts into which $n$ planes can divide space? We assume that the set of planes is non-degenerate in the sense that any three planes intersect in one point and no four planes have a common point (and for n=2 it is necessary to require that the planes are not parallel).