Let $n \ge k \ge 3$ be integers. Show that for every integer sequence $1 \le a_1 < a_2 < . . . < a_k \le n$ one can choose non-negative integers $b_1, b_2, . . . , b_k$, satisfying the following conditions: [list=i] [*] $0 \le b_i \le n$ for each $1 \le i \le k$, [*] all the positive $b_i$ are distinct, [*] the sums $a_i + b_i$, $1 \le i \le k$, form a permutation of the first $k$ terms of a non-constant arithmetic progression. [/list]

A rectangle with sides $ n$ and $p$ is divided into $np$ unit squares. Initially there are m unitary squares painted black and the remaining painted white. The following processoccurs repeatedly: if a unit square painted white has at minus two sides in common with squares painted black then Its color also turns black. Find the smallest integer $m$ that satisfies the property: there exists an initial position of $m$ black unit squares such that the entire $ n \times p$ rectangle is painted black when repeat the process a finite number of times.

Compute the number of nonnegative integer triples $(x,y,z)$ which satisfy $4x+2y+z\leq36$.

Let $p>1$. Show that there exists a constant $K_{p} >0$ such that for every $x,y\in \mathbb{R}$ with $|x|^{p}+|y|^{p}=2$, we have $$(x-y)^{2} \leq K_{p}(4-(x+y)^{2}).$$

A complete graph of $n$ vertices is a set of $n$ vertices and those vertices are connected in pairs by edges. Suppose the graph has $n$ vertices $A_1, A_2, ..., A_n$, the cycle is a set of edges of the form $A_{i_1}A_{i_2}, A_{i_2}A_{i_3},..., A_{i_m}A_{i_1}$ with $i_1, i_2, ..., i_m \in {1, 2, ..., n}$ double one different. We call $m$ the length of this cycle. Find the smallest positive integer$ n$ such that for every way of coloring all edges of a complete graph of $n$ vertices, each edge filled with one of three different colors, there is always a cycle of even length with the same color. PS. The same problem with another wording [url=https://artofproblemsolving.com/community/c6h151391p852296]here [/url].

If $x_1=5, x_2=401$, and \[ x_n=x_{n-2}-\frac 1{x_{n-1}} \] for every $3\leq n \leq m$, what is the largest value of $m$? $ \textbf{(A)}\ 406 \qquad\textbf{(B)}\ 2005 \qquad\textbf{(C)}\ 2006 \qquad\textbf{(D)}\ 2007 \qquad\textbf{(E)}\ \text{None of the above} $

Let $ABC$ be a triangle with side lengths $AB = 2011$, $BC = 2012$, $AC = 2013$. Create squares $S_1 =ABB'A''$, $S_2 = ACC''A'$ , and $S_3 = CBB''C'$ using the sides $AB$, $AC$, $BC$ respectively, so that the side $B'A''$ is on the opposite side of $AB$ from $C$, and so forth. Let square $S_4$ have side length $A''A' $, square $S_5$ have side length $C''C'$, and square $S_6$ have side length $B''B'$. Let $A(S_i)$ be the area of square $S_i$ . Compute $\frac{A(S_4)+A(S_5)+A(S_6)}{A(S_1)+A(S_2)+A(S_3)}$?

An $L$ is an arrangement of $3$ adjacent unit squares formed by deleting one unit square from a $2 \times 2$ square. a) How many $L$s can be placed on an $8 \times 8$ board (with no interior points overlapping)? b) Show that if any one square is deleted from a $1987 \times 1987$ board, then the remaining squares can be covered with $L$s (with no interior points overlapping).

The pairs $(a,b)$ such that $|a+bt+ t^2 |\leq 1$ for $0\leq t \leq 1$ fill a certain region in the plane. What is the area of this region?

A graph has $N$ vertices. An invisible hare sits in one of the vertices. A group of hunters tries to kill the hare. In each move all of them shoot simultaneously: each hunter shoots at a single vertex, they choose the target vertices cooperatively. If the hare was in one of the target vertices during a shoot, the hunt is finished. Otherwise the hare can stay in its vertex or jump to one of the neighboring vertices. The hunters know an algorithm that allows them to kill the hare in at most $N!$ moves. Prove that then there exists an algorithm that allows them to kill the hare in at most $2^N$ moves.

Fred and George are playing a game, in which Fred flips $2014$ coins and George flips $2015$ coins. Fred wins if he flips at least as many heads as George does, and George wins if he flips more heads than Fred does. Determine the probability that Fred wins.

2500 chess kings have to be placed on a $100 \times 100$ chessboard so that [b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex); [b](ii)[/b] each row and each column contains exactly 25 kings. Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.) [i]Proposed by Sergei Berlov, Russia[/i]

Given is the function $f(x)=-x+\sqrt{(x+a)(x+b)}$, where $a$, $b$ are distinct given positive real numbers. Prove that for all real numbers $s\in (0,1)$ there exist only one positive real number $\alpha$ such that \[ f(\alpha)=\sqrt [s]{\frac{a^s+b^s}{2}} . \]

Let $n$ be a positive integer, $n\geq 4$. $n$ cards are arranged on a circle and the numbers $1$ or $-1$ are written on each of the cards. in a $question$ we may find out the product of the numbers on any $3$ cards. What is the minimum numbers if questions needed to find out the product of all $n$ numbers?

Let $ABC$ be an acute triangle with orthocenter $H$. Let $G$ be the point such that the quadrilateral $ABGH$ is a parallelogram. Let $I$ be the point on the line $GH$ such that $AC$ bisects $HI$. Suppose that the line $AC$ intersects the circumcircle of the triangle $GCI$ at $C$ and $J$. Prove that $IJ = AH$.

A person starting with $64$ cents and making $6$ bets, wins three times and loses three times, the wins and losses occurring in random order. The chance for a win is equal to the chance for a loss. If each wager is for half the money remaining at the time of the bet, then the final result is: $\textbf{(A)}\ \text{a loss of } 27 \qquad \textbf{(B)}\ \text{a gain of }27 \qquad \textbf{(C)}\ \text{a loss of }37 \qquad$ $ \textbf{(D)}\ \text{neither a gain nor a loss} \qquad \textbf{(E)}\ \text{a gain or a loss depending upon the order in which the wins and losses occur}$ Note: Due to the lack of $\LaTeX$ packages, the numbers in the answer choices are in cents ¢

Let $n$ be a positive integer. - Find, in terms of $n$, the number of pairs $(x,y)$ of positive integers that are solutions of the equation : $$x^2-y^2=10^2.30^{2n}$$ - Prove further that this number is never a square

A $24$-hour digital clock shows times $h : m : s$, where $h$, $m$, and $s$ are integers with $0 \le h \le 23$, $0 \le m \le 59$, and $0 \le s \le 59$. How many times $h : m : s$ satisfy $h + m = s$?

Let $ABC$ be an acute scalene triangle. Let $D, E$ be points on segments $AB, AC$ respectively, such that $BD=CE$. Prove that the nine-point centers of $ADE$, $ACD$, $ABC$, $AEB$ form a rhombus. [i]Proposed by Malay Mahajan and Siddharth Choppara[/i]

The diagram below shows a regular hexagon with an inscribed square where two sides of the square are parallel to two sides of the hexagon. There are positive integers $m$, $n$, and $p$ such that the ratio of the area of the hexagon to the area of the square can be written as $\tfrac{m+\sqrt{n}}{p}$ where $m$ and $p$ are relatively prime. Find $m + n + p$. [asy] import graph; size(4cm); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); draw((0,1)--(1,1)--(1.5,1.87)--(1,2.73)--(0,2.73)--(-0.5,1.87)--cycle); filldraw((1.13,2.5)--(-0.13,2.5)--(-0.13,1.23)--(1.13,1.23)--cycle,grey); draw((0,1)--(1,1)); draw((1,1)--(1.5,1.87)); draw((1.5,1.87)--(1,2.73)); draw((1,2.73)--(0,2.73)); draw((0,2.73)--(-0.5,1.87)); draw((-0.5,1.87)--(0,1)); draw((1.13,2.5)--(-0.13,2.5)); draw((-0.13,2.5)--(-0.13,1.23)); draw((-0.13,1.23)--(1.13,1.23)); draw((1.13,1.23)--(1.13,2.5)); [/asy]

Each square in an $n \times n$ table is painted black or white. The routes where two rows meet two columns, called a quartet if the remaining squares are the same color. (a) What is the largest possible number of black squares in a $4 \times 4$ table without quartets? (b) Is it possible to paint a $5 \times 5$ table so that it has no quartets?

Define a $\textit{subsequence}$ of a string $\mathcal{S}$ of letters to be a positive-lenght string using any number of the letters in $\mathcal{S}$ in order. For example, a subsequence of $HARRISON$ is $ARRON$. Compute the number of subsequences in $HARRISON$.

A wire is cut into two pieces, one of length $a$ and the other of length $b$. The piece of length $a$ is bent to form an equilateral triangle, and the piece of length $b$ is bent to form a regular hexagon. The triangle and the hexagon have equal area. What is $\frac{a}{b}$? ${ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ \frac{\sqrt{6}}{2} \qquad\textbf{(C)}\ \sqrt{3}\qquad\textbf{(D}}\ 2 \qquad\textbf{(E)}\ \frac{3\sqrt{2}}{2} $

Let $I$ be the incenter of the scalene $\Delta ABC$, such, $AB<AC$, and let $I'$ be the reflection of point $I$ in line $BC$. The angle bisector $AI$ meets $BC$ at $D$ and circumcircle of $\Delta ABC$ at $E$. The line $EI'$ meets the circumcircle at $F$. Prove, that, $\text{(i) } \frac{AI}{IE}=\frac{ID}{DE}$ $\text{(ii) } IA=IF$

$20.$ The circle $\omega$ touches the circle $\Omega$ internally at point $P.$ The centre $O$ of $\Omega$ is outside $\omega.$ Let $XY$ be a diameter of $\Omega$ which is also tangent to $\omega.$ Assume $PY>PX.$ Let $PY$ intersect $\omega$ at $z.$ If $YZ=2PZ,$ what is the magnitude of $\angle{PYX}$ in degrees $?$