Consider all binary sequences (sequences consisting of 0’s and 1’s). In such a sequence the following four types of operation are allowed: (a) $010 \rightarrow 1$, (b) $1 \rightarrow 010$, (c) $110 \rightarrow 0$, and (d) $0 \rightarrow 110$. Determine if it is possible to obtain the sequence $100...0$ (with $2003$ zeroes) from the sequence $0...01$ (with $2003$ zeroes).

Let $n\geq 2$ be an integer. For each natural $m$ and each integer sequence $0<k_1<k_2<\cdots <k_m$ for which $k_1+\cdots+k_m=n$, Michael wrote down the number $\frac{1}{k_1\cdot k_2\cdots k_m} $ on the board. Prove that the sum of the numbers on the board is less than $1$.

Point $I$ is incenter of triangle $ABC$ in which $AB \neq AC$. Lines $BI$ and $CI$ intersect sides $AC$ and $AB$ in points $D$ and $E$, respectively. Determine all measures of angle $BAC$, for which may be $DI = EI$.

If $ \left (a\plus{}\frac{1}{a} \right )^2\equal{}3$, then $ a^3\plus{}\frac{1}{a^3}$ equals: $ \textbf{(A)}\ \frac{10\sqrt{3}}{3} \qquad \textbf{(B)}\ 3\sqrt{3} \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ 7\sqrt{7} \qquad \textbf{(E)}\ 6\sqrt{3}$

Determine whether there exist non-constant polynomials $P(x)$ and $Q(x)$ with real coefficients satisfying $$P(x)^{10}+P(x)^9 = Q(x)^{21}+Q(x)^{20}.$$

Prove that $2n \choose n$ is divisible by $n+1$.

Let $n\ge 2$ be a positive integer. For any integer $a$, let $P_a(x)$ denote the polynomial $x^n+ax$. Let $p$ be a prime number and define the set $S_a$ as the set of residues mod $p$ that $P_a(x)$ attains. That is, $$S_a=\{b\mid 0\le b\le p-1,\text{ and there is }c\text{ such that }P_a(c)\equiv b \pmod{p}\}.$$Show that the expression $\frac{1}{p-1}\sum\limits_{a=1}^{p-1}|S_a|$ is an integer. [i]Proposed by fattypiggy123[/i]

Find all positive integers $m, n$ satisfying $n!+2^{n-1}=2^m$.

Let $\Omega$ and $O$ be the circumcircle of acute triangle $ABC$ and its center, respectively. $M\ne O$ is an arbitrary point in the interior of $ABC$ such that $AM$, $BM$, and $CM$ intersect $\Omega$ at $A_{1}$, $B_{1}$, and $C_{1}$, respectiuvely. Let $A_{2}$, $B_{2}$, and $C_{2}$ be the circumcenters of $MBC$, $MCA$, and $MAB$, respectively. It is to be proven that $A_{1}A_{2}$, $B_{1}B_{2}$, $C_{1}C{2}$ concur.

In the right-angled $\Delta ABC$, with area $S$, a circle with area $S_1$ is inscribed and a circle with area $S_2$ is circumscribed. Prove the following inequality: $\pi \frac{S-S_1}{S_2} <\frac{1}{\pi-1}$.

There are some gas stations on a circular highway. The total amount of gasoline in them is enough for two laps. Two drivers want to refuel at one station and starting from it, go in different directions, both of them completing an entire lap. Along the way, they can refuel at other stations, without necessarily taking all the gasoline. Prove that drivers will always be able to do this. [i]Proposed by I. Bogdanov[/i]

Let $ a,b,c>0$ prove that:\[ \frac{a^{3}}{(a+b)^{3}}+\frac{b^{3}}{(b+c)^{3}}+\frac{c^{3}}{(c+a)^{3}}\geq \frac{3}{8} \] Good luck! :D

Given cyclic quadrilateral $ABCD$. Four circles each touching its diagonals and the circumcircle internally are equal. Is $ABCD$ a square? (C.Pohoata, A.Zaslavsky)

Solve the system $\begin{cases} x^3 - y^3 = 26 \\ x^2y - xy^2 = 6 \end{cases}$ in $C$ [hide=other version]solved below Solve the system $\begin{cases} x^3 - y^3 = 2b \\ x^2y - xy^2 = b \end{cases}$[/hide]

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$.