Given $k_1,k_2,...,k_n\in R^+$, find all the naturals $n$ such that $$k_1+k_2+...+k_n=2n-3$$ $$\frac{1}{k_1}+\frac{1}{k_2}+...+\frac{1}{k_n}=3$$ [i](Zhuge Liang)[/i]

a,b,c are positive & abc=1, then show that a^(b+c) .b^(c+a) .c^(a+b) ≤ 1

Initially, there are 2018 distinct boxes on a table. In the first stage, Yazan and Bozan, starting with Yazan, take turns make $2016$ moves each, such that, in each move, the person whose turn selects a pair of boxes that is not written on the board, and writes the pair on the board. In the second stage, Bozan enumerates the $4032$ pairs with numbers from $1,2,\dots,4032$, in whichever order he wants, and puts $k$ balls in each boxes written contained in the $k^{th}$ pair. Is there a strategy for Bozan that guarantees that the number of balls in each box are distinct?

In triangle $ABC$, angle $C$ is equal to $60^o$. Bisectors $AA'$ and $BB'$ intersect at point $I$. Point $K$ is symmetric to $I$ with respect to line $AB$. Prove that lines $CK$ and $A'B'$ are perpendicular. (D. Shvetsov, A. Zaslavsky)

In the trapezoid $ABCD$ with bases $AB$ and $CD$, let $M$ be the midpoint of side $DA$. If $BC=a$, $MC=b$ and $\angle MCB=150^\circ$, what is the area of trapezoid $ABCD$ as a function of $a$ and $b$?

Let A be a regular $12$-sided polygon. A new $12$-gon B is constructed by connecting the midpoints of the sides of A. The ratio of the area of B to the area of A can be written in simplest form as $(a +\sqrt{b})/c$, where $a, b, c$ are integers. Find $a + b + c$.

Two different points $A$ and $B$ and a circle $\omega$ that passes through $A$ and $B$ are given. $P$ is a variable point on $\omega$ (different from $A$ and $B$). $M$ is a point such that $MP$ is the bisector of the angle $\angle{APB}$ ($M$ lies outside of $\omega$) and $MP=AP+BP$. Find the geometrical locus of $M$.

Alice has an integer $N > 1$ on the blackboard. Each minute, she deletes the current number $x$ on the blackboard and writes $2x+1$ if $x$ is not the cube of an integer, or the cube root of $x$ otherwise. Prove that at some point of time, she writes a number larger than $10^{100}$. [i]Proposed by Anant Mudgal and Rohan Goyal[/i]

$a,b,c$ are nonnegative integers that satisfy $a^2+b^2+c^2=3$. Find the minimum and maximum value the sum $$\frac{1}{1+a+b}+\frac{1}{1+b+c}+\frac{1}{1+c+a}$$ may achieve and find all $a,b,c$ for which equality occurs.\\ \\ [i](Andrei Bâra)[/i]

Given is a floor plan composed of $n$ unit squares. Albert and Berta want to cover this floor with tiles, with all tiles having the shape of a $1\times 2$ domino or a $T$-tetromino. Albert only has tiles from one color, while Berta has two-color dominoes and tetrominoes available in four colors. Albert can use this floor plan in $a$ ways to cover tiles, Berta in $ b$ ways. Assuming that $a \ne 0$, determine the ratio $b/a$.

The largest prime factor of $101101101101$ is a four-digit number $N.$ Compute $N.$

Using a nozzle to paint each square in a $1 \times n$ stripe, when the nozzle is aiming at the $i$-th square, the square is painted black, and simultaneously, its left and right neighboring square (if exists) each has an independent probability of $\tfrac{1}{2}$ to be painted black. In the optimal strategy (i.e. achieving least possible number of painting), the expectation of number of painting to paint all the squares black, is $T(n)$. Find the explicit formula of $T(n)$.

$ABCD$ and $A'B'C'D'$ are square maps of the same region, drawn to different scales and superimposed as shown in the figure. Prove that there is only one point $O$ on the small map that lies directly over point $O'$ of the large map such that $O$ and $O'$ each represent the same place of the country. Also, give a Euclidean construction (straight edge and compass) for $O$. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); real theta = -100, r = 0.3; pair D2 = (0.3,0.76); string[] lbl = {'A', 'B', 'C', 'D'}; draw(unitsquare); draw(shift(D2)*rotate(theta)*scale(r)*unitsquare); for(int i = 0; i < lbl.length; ++i) { pair Q = dir(135-90*i), P = (.5,.5)+Q/2^.5; label("$"+lbl[i]+"'$", P, Q); label("$"+lbl[i]+"$",D2+rotate(theta)*(r*P), rotate(theta)*Q); }[/asy]

Let $G$ be the permutation group of a finite set $\Omega$.Consider $S\subset G$ such that $1\in S$ and for any $x,y\in \Omega$ there exists a unique element $\sigma \in S$ such that $\sigma (x)=y$.Prove that,if the elements of $S \setminus \{1\}$ are conjugate in $G$,then $G$ is $2-$transitive on $\Omega$

Jesse and Tjeerd are playing a game. Jesse has access to $n\ge 2$ stones. There are two boxes: in the black box there is room for half of the stones (rounded down) and in the white box there is room for half of the stones (rounded up). Jesse and Tjeerd take turns, with Jesse starting. Jesse grabs in his turn, always one new stone, writes a positive real number on the stone and places put him in one of the boxes that isn't full yet. Tjeerd sees all these numbers on the stones in the boxes and on his turn may move any stone from one box to the other box if it is not yet full, but he may also choose to do nothing. The game stops when both boxes are full. If then the total value of the stones in the black box is greater than the total value of the stones in the white box, Jesse wins; otherwise win Tjeerd. For every $n \ge 2$, determine who can definitely win (and give a corresponding winning strategy).

Let $n$ be the number of pairs of values of $b$ and $c$ such that $3x+by+c=0$ and $cx-2y+12=0$ have the same graph. Then $n$ is: $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ \text{finite but more than 2}\qquad\textbf{(E)}\ \text{greater than any finite number} $

\[\int_{-\infty}^\infty e^{-x^2-4/x^2}\,\mathrm dx\] [i]Proposed by Vlad Oleksenko[/i]

In $\triangle$ABC, points D, M lie on side BC and AB respectively, point P lies on segment AD. Line DM intersects segments BP, AC (extended part), PC (extended part) at E, F and N respectively. Show that if DE=DF, then DM=DN.

Let $n$ be a positive integer. Show that \begin{align*}&\quad\,\,\frac{1}{\binom{n}{1}}+\frac{1}{2\binom{n}{2}}+\frac{1}{3\binom{n}{3}}+\cdots+\frac{1}{n\binom{n}{n}}\\&=\frac{1}{2^{n-1}}+\frac{1}{2\cdot2^{n-2}}+\frac{1}{3\cdot2^{n-3}}+\cdots+\frac{1}{n\cdot2^0}.\end{align*}

$n$ being a given integer, find all functions $f\colon \mathbb{Z} \to \mathbb{Z}$, such that for all integers $x,y$ we have $f\left( {x + y + f(y)} \right) = f(x) + ny$.

There is $n\times n$ chessboard. Each square has a number between $0$ and $k$. There is a button for each row and column, which increases the number of $n$ numbers of the row or column the button represents(if the number of the square is $k$, then it becomes $0$). If certain button is pressed, call it 'operation.' And we have a chessboard which is filled with 0(for all squares). After some 'operation's, the numbers of squares are different now. Prove that we can make all of the number $0$ within $kn$ 'operation's.

Let $n$ be a positive integer and $P,Q$ be polynomials with real coefficients with $P(x)=x^nQ(\frac{1}{x})$ and $P(x) \geq Q(x)$ for all real numbers $x$. Prove that $P(x)=Q(x)$ for all real number $x$.

At Port Aventura there are $16$ secret agents, each of whom is watching one or more other agents. It is known that if agent $A$ is watching agent $B$, then $B$ is not watching $A$. Moreover, any $10$ agents can be ordered so that the first is watching the second, the second is watching the third, etc, the last is watching the first. Show that any $11$ agents can also be so ordered.

An acute triangle $ABC$ with $AB<AC<BC$ is inscribed in a circle $c(O,R)$. The circle $c_1(A,AC)$ intersects the circle $c$ at point $D$ and intersects $CB$ at $E$. If the line $AE$ intersects $c$ at $F$ and $G$ lies in $BC$ such that $EB=BG$, prove that $F,E,D,G$ are concyclic.

On a Cartesian plane 101 planes are drawn and all points of intersection are labeled. Is it possible, that for every line, 50 of the points have positive coordinates and 50 of the points have negative coordinates [I]Proposed by S. Ivanov[/i]