The sequence $(a_n)$ is defined as: $$a_1=1007$$ $$a_{i+1}\geq a_i+1$$ Prove the inequality: $$\frac{1}{2016}>\sum_{i=1}^{2016}\frac{1}{a_{i+1}^{2}+a_{i+2}^2}$$

[b]a)[/b] Show that there is no function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ having the property that $$ f(f(x))=\left\{ \begin{matrix} \sqrt{2007} ,& \quad x\in\mathbb{Q} \\ 2007, & \quad x\not\in \mathbb{Q} \end{matrix} \right. , $$ for any real number $ x. $ [b]b)[/b] Prove that there is an infinite number of functions $ g:\mathbb{R}\longrightarrow\mathbb{R} $ having the property that $$ g(g(x))=\left\{ \begin{matrix} 2007 ,& \quad x\in\mathbb{Q} \\ \sqrt{2007}, & \quad x\not\in \mathbb{Q} \end{matrix} \right. , $$ for any real number $ x. $

For positive integers $x, y, $ $r_x(y)$ to represent the smallest positive integer $ r $ such that $ r \equiv y(\text{mod x})$ .For any positive integers $a, b, n ,$ Prove that $$\sum_{i=1}^{n} r_b(a i)\leq \frac{n(a+b)}{2}$$

[b]p1.[/b] Nicky is studying biology and has a tank of $17$ lizards. In one day, he can either remove $5$ lizards or add $2$ lizards to his tank. What is the minimum number of days necessary for Nicky to get rid of all of the lizards from his tank? [b]p2.[/b] What is the maximum number of spheres with radius $1$ that can fit into a sphere with radius $2$? [b]p3.[/b] A positive integer $x$ is sunny if $3x$ has more digits than $x$. If all sunny numbers are written in increasing order, what is the $50$th number written? [b]p4.[/b] Quadrilateral $ABCD$ satisfies $AB = 4$, $BC = 5$, $DA = 4$, $\angle DAB = 60^o$, and $\angle ABC = 150^o$. Find the area of $ABCD$. [b]p5. [/b]Totoro wants to cut a $3$ meter long bar of mixed metals into two parts with equal monetary value. The left meter is bronze, worth $10$ zoty per meter, the middle meter is silver, worth $25$ zoty per meter, and the right meter is gold, worth $40$ zoty per meter. How far, in meters, from the left should Totoro make the cut? [b]p6.[/b] If the numbers $x_1, x_2, x_3, x_4$, and $x5$ are a permutation of the numbers $1, 2, 3, 4$, and $5$, compute the maximum possible value of $$|x_1 - x_2| + |x_2 - x_3| + |x_3 - x_4| + |x_4 - x_5|.$$ [b]p7.[/b] In a $3 \times 4$ grid of $12$ squares, find the number of paths from the top left corner to the bottom right corner that satisfy the following two properties: $\bullet$ The path passes through each square exactly once. $\bullet$ Consecutive squares share a side. Two paths are considered distinct if and only if the order in which the twelve squares are visited is different. For instance, in the diagram below, the two paths drawn are considered the same. [img]https://cdn.artofproblemsolving.com/attachments/7/a/bb3471bbde1a8f58a61d9dd69c8527cfece05a.png[/img] [b]p8.[/b] Scott, Demi, and Alex are writing a computer program that is $25$ ines long. Since they are working together on one computer, only one person may type at a time. To encourage collaboration, no person can type two lines in a row, and everyone must type something. If Scott takes $10$ seconds to type one line, Demi takes $15$ seconds, and Alex takes $20$ seconds, at least how long, in seconds, will it take them to finish the program? [b]p9.[/b] A hand of four cards of the form $(c, c, c + 1, c + 1)$ is called a tractor. Vinjai has a deck consisting of four of each of the numbers $7$, $8$, $9$ and $10$. If Vinjai shuffles and draws four cards from his deck, compute the probability that they form a tractor. [b]p10. [/b]The parabola $y = 2x^2$ is the wall of a fortress. Totoro is located at $(0, 4)$ and fires a cannonball in a straight line at the closest point on the wall. Compute the y-coordinate of the point on the wall that the cannonball hits. [b]p11. [/b]How many ways are there to color the squares of a $10$ by $10$ grid with black and white such that in each row and each column there are exactly two black squares and between the two black squares in a given row or column there are exactly [b]4[/b] white squares? Two configurations that are the same under rotations or reflections are considered different. [b]p12.[/b] In rectangle $ABCD$, points $E$ and $F$ are on sides $AB$ and $CD$, respectively, such that $AE = CF > AD$ and $\angle CED = 90^o$. Lines $AF, BF, CE$ and $DE$ enclose a rectangle whose area is $24\%$ of the area of $ABCD$. Compute $\frac{BF}{CE}$ . [b]p13.[/b] Link cuts trees in order to complete a quest. He must cut $3$ Fenwick trees, $3$ Splay trees and $3$ KD trees. If he must also cut 3 trees of the same type in a row at some point during his quest, in how many ways can he cut the trees and complete the quest? (Trees of the same type are indistinguishable.) [b]p14.[/b] Find all ordered pairs (a, b) of positive integers such that $\sqrt{64a + b^2} + 8 = 8\sqrt{a} + b$. [b]p15.[/b] Let $ABCDE$ be a convex pentagon such that $\angle ABC = \angle BCD = 108^o$, $\angle CDE = 168^o$ and $AB =BC = CD = DE$. Find the measure of $\angle AEB$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two polynomials $P(x)=x^4+ax^3+bx^2+cx+d$ and $Q(x)=x^2+px+q$ have real coefficients, and $I$ is an interval on the real line of length greater than $2$. Suppose $P(x)$ and $Q(x)$ take negative values on $I$, and they take non-negative values outside $I$. Prove that there exists a real number $x_0$ such that $P(x_0)<Q(x_0)$.

Find all pairs of functions $ f, g: \mathbb R \to \mathbb R$ such that [list] (i) if $ x < y$, then $ f(x) < f(y)$; (ii) $ f(xy) \equal{} g(y)f(x) \plus{} f(y)$ for all $ x, y \in \mathbb R$. [/list]

(a) Prove that $\sqrt{n+1}-\sqrt n<\frac1{2\sqrt n}<\sqrt n-\sqrt{n-1}$ for all $n\in\mathbb N$. (b) Prove that the integer part of the sum $1+\frac1{\sqrt2}+\frac1{\sqrt3}+\ldots+\frac1{\sqrt{m^2}}$, where $m\in\mathbb N$, is either $2m-2$ or $2m-1$.

The functions $ f(x) ,\ g(x)$ satify that $ f(x) \equal{} \frac {x^3}{2} \plus{} 1 \minus{} x\int_0^x g(t)\ dt,\ g(x) \equal{} x \minus{} \int_0^1 f(t)\ dt$. Let $ l_1,\ l_2$ be the tangent lines of the curve $ y \equal{} f(x)$, which pass through the point $ (a,\ g(a))$ on the curve $ y \equal{} g(x)$. Find the minimum area of the figure bounded by the tangent tlines $ l_1,\ l_2$ and the curve $ y \equal{} f(x)$ .

Christian Reiher and Reid Barton want to open a security box, they already managed to discover the algorithm to generate the key codes and they obtained the following information: $i)$ In the screen of the box will appear a sequence of $n+1$ numbers, $C_0 = (a_{0,1},a_{0,2},...,a_{0,n+1})$ $ii)$ If the code $K = (k_1,k_2,...,k_n)$ opens the security box then the following must happen: a) A sequence $C_i = (a_{i,1},a_{i,2},...,a_{i,n+1})$ will be asigned to each $k_i$ defined as follows: $a_{i,1} = 1$ and $a_{i,j} = a_{i-1,j}-k_ia_{i,j-1}$, for $i,j \ge 1$ b) The sequence $(C_n)$ asigned to $k_n$ satisfies that $S_n = \sum_{i=1}^{n+1}|a_i|$ has its least possible value, considering all possible sequences $K$. The sequence $C_0$ that appears in the screen is the following: $a_{0,1} = 1$ and $a_0,i$ is the sum of the products of the elements of each of the subsets with $i-1$ elements of the set $A =$ {$1,2,3,...,n$}, $i\ge 2$, such that $a_{0, n+1} = n!$ Find a sequence $K = (k_1,k_2,...,k_n)$ that satisfies the conditions of the problem and show that there exists at least $n!$ of them.

Let $\mathbb N_0$ be the set of non-negative integers. There is a triple $(f,a,b)$, where $f$ is a function from $\mathbb N_0$ to $\mathbb N_0$ and $a,b\in\mathbb N_0$ that satisfies the following conditions: [list] [*]$f(1)=2$ [*]$f(a)+f(b)\leq 2\sqrt{f(a)}$ [*]For all $n>0$, we have $f(n)=f(n-1)f(b)+2n-f(b)$ [/list] Find the sum of all possible values of $f(b+100)$.

A certain type of Bessel function has the form $I(x) = \frac{1}{\pi} \int_0^{\pi}e^{x \cos \theta} d\theta$ for all real $x$. Evaluate $\int_0^{\infty} x I(2x) e^{-x^2}dx$.

Consider the locus given by the real polynomial equation $$ Ax^2 +Bxy+Cy^2 +Dx^3 +E x^2 y +F xy^2 +G y^3=0,$$ where $B^2 -4AC <0.$ Prove that there is a positive number $\delta$ such that there are no points of the locus in the punctured disk $$0 <x^2 +y^2 < \delta^2.$$

For what real values of $x$ is \[ \sqrt{x+\sqrt{2x-1}}+\sqrt{x-\sqrt{2x-1}}=A \] given a) $A=\sqrt{2}$; b) $A=1$; c) $A=2$, where only non-negative real numbers are admitted for square roots?

Let $n\geqslant 1$ be an integer, and let $x_0,x_1,\ldots,x_{n+1}$ be $n+2$ non-negative real numbers that satisfy $x_ix_{i+1}-x_{i-1}^2\geqslant 1$ for all $i=1,2,\ldots,n.$ Show that \[x_0+x_1+\cdots+x_n+x_{n+1}>\bigg(\frac{2n}{3}\bigg)^{3/2}.\][i]Pakawut Jiradilok and Wijit Yangjit, Thailand[/i]

Consider $n$ lamps clockwise numbered from $1$ to $n$ on a circle. Let $\xi$ to be a configuration where $0 \le \ell \le n$ random lamps are turned on. A [i]cool procedure[/i] consists in perform, simultaneously, the following operations: for each one of the $\ell$ lamps which are turned on, we verify the number of the lamp; if $i$ is turned on, a [i]signal[/i] of range $i$ is sent by this lamp, and it will be received only by the next $i$ lamps which follow $i$, turned on or turned off, also considered clockwise. At the end of the operations we verify, for each lamp, turned on or turned off, how many signals it has received. If it was reached by an even number of signals, it remains on the same state(that is, if it was turned on, it will be turned on; if it was turned off, it will be turned off). Otherwise, it's state will be changed. The example in attachment, for $n=4$, ilustrates a configuration where lamps $2$ and $4$ are initially turned on. Lamp $2$ sends signal only for the lamps $3$ e $4$, while lamp $4$ sends signal for lamps $1$, $2$, $3$ e $4$. Therefore, we verify that lamps $1$ e $2$ received only one signal, while lamps $3$ e $4$ received two signals. Therefore, in the next configuration, lamps $1$ e $4$ will be turned on, while lamps $2$ e $3$ will be turned off. Let $\Psi$ to be the set of all $2^n$ possible configurations, where $0 \le \ell \le n$ random lamps are turned on. We define a function $f: \Psi \rightarrow \Psi$ where, if $\xi$ is a configuration of lamps, then $f(\xi)$ is the configurations obtained after we perform the [i]cool procedure[/i] described above. Determine all values of $n$ for which $f$ is bijective.

Starting with the triple $(1007\sqrt{2},2014\sqrt{2},1007\sqrt{14})$, define a sequence of triples $(x_{n},y_{n},z_{n})$ by $x_{n+1}=\sqrt{x_{n}(y_{n}+z_{n}-x_{n})}$ $y_{n+1}=\sqrt{y_{n}(z_{n}+x_{n}-y_{n})}$ $ z_{n+1}=\sqrt{z_{n}(x_{n}+y_{n}-z_{n})}$ for $n\geq 0$.Show that each of the sequences $\langle x_n\rangle _{n\geq 0},\langle y_n\rangle_{n\geq 0},\langle z_n\rangle_{n\geq 0}$ converges to a limit and find these limits.

Let $f : N \to N$ be a function such that the set $\{k | f(k) < k\}$ is finite. Prove that the set $\{k | g(f(k)) \le k\}$ is infinite for all functions $g : N \to N$.

Let $S = \left\{ 1, \dots, 100 \right\}$, and for every positive integer $n$ define \[ T_n = \left\{ (a_1, \dots, a_n) \in S^n \mid a_1 + \dots + a_n \equiv 0 \pmod{100} \right\}. \] Determine which $n$ have the following property: if we color any $75$ elements of $S$ red, then at least half of the $n$-tuples in $T_n$ have an even number of coordinates with red elements. [i]Ray Li[/i]

Let $n\geqslant 2$ be an integer. Prove that for any positive real numbers $a_1, a_2,\ldots, a_n$, \[\frac{1}{2\sqrt{2}}\sum_{i=1}^{n}2^{i}a_i^2 \geqslant\sum_{1 \leqslant i < j \leqslant n}a_i a_j.\][i]Proposed by Andrei Vila[/i]

A geometrical progression consists of $37$ positive integers. The first and the last terms are relatively prime numbers. Prove that the $19^{th}$ term of the progression is the $18^{th}$ power of some positive integer. [i]($3$ points)[/i]

Consider two functions $f , \,g \,:\mathbb{R} \to \mathbb{R}$ such that from some $a>0$ holds $g(x)=f(x+a)$ for any $x \in \mathbb{R}$. If $f$ is even and $g$ is odd, prove that both functions are periodic.

[b]p1.[/b] Solve: $INK + INK + INK + INK + INK + INK = PEN$ ($INK$ and $PEN$ are $3$-digit numbers, and different letters stand for different digits). [b]p2. [/b]Two people play a game. They put $3$ piles of matches on the table: the first one contains $1$ match, the second one $3$ matches, and the third one $4$ matches. Then they take turns making moves. In a move, a player may take any nonzero number of matches FROM ONE PILE. The player who takes the last match from the table loses the game. a) The player who makes the first move can win the game. What is the winning first move? b) How can he win? (Describe his strategy.) [b]p3.[/b] The planet Naboo is under attack by the imperial forces. Three rebellion camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle with a defensive field. What is the maximal area that they may need to cover? [b]p4.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$ 1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back. [b]p5.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $(G, \cdot )$ be a group and $e$ an identity element. Prove that if all elements $x$ of $G$ satisfy $x\cdot x = e$ then $(G, \cdot)$ is abelian (that is, commutative).

For non-negative integers $n$ and $k$, let $P_{n, k}(x)$ denote the rational function \[\frac{(x^{n}-1)(x^{n}-x) \cdots (x^{n}-x^{k-1})}{(x^{k}-1)(x^{k}-x) \cdots (x^{k}-x^{k-1})}.\] Show that $P_{n, k}(x)$ is actually a polynomial for all $n, k \in \mathbb{N}$.

Let $k$ be a positive integer congruent to $1$ modulo $4$ which is not a perfect square and let $a=\frac{1+\sqrt{k}}{2}$. Show that $\{\left \lfloor{a^2n}\right \rfloor-\left \lfloor{a\left \lfloor{an}\right \rfloor}\right \rfloor : n \in \mathbb{N}_{>0}\}=\{1 , 2 , \ldots ,\left \lfloor{a}\right \rfloor\}$.