Let $n \in \mathbb{N} , n \ge 2$ and $ a_0,a_1,a_2,\cdots,a_n \in \mathbb{C} ; a_n \not = 0 $. Then: [b][size=100][i]P.[/i][/size][/b] $|a_nz^n + a_{n-1}z^z{n-1} + \cdots + a_1z + a_0 | \le |a_n+a_0|$ for any $z \in \mathbb{C}, |z|=1$ [b][size=100][i]Q[/i][/size][/b]. $a_1=a_2=\cdots=a_{n-1}=0$ and $a_0/a_n \in [0,\infty)$ Prove that $ P \Longleftrightarrow Q$

Ben has $16$ balls labeled $1, 2, 3, \ldots, 16,$ as well as $4$ indistinguishable boxes. Two balls are [i]neighbors[/i] if their labels differ by $1.$ Compute the number of ways for him to put $4$ balls in each box such that each ball is in the same box as at least one of its neighbors. (The order in which the balls are placed does not matter.)

[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes \[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\] [b](b)[/b] Find the rearrangement that minimizes $Q.$

Find all positive integers $n$ for which exist three nonzero integers $x, y, z$ such that $x+y+z=0$ and: \[\frac{1}{x}+\frac{1}{y}+\frac{1}{z}=\frac{1}{n}\]

How many ways are there to insert $+$'s between the digits of $111111111111111$ (fifteen $1$'s) so that the result will be a multiple of $30$?

Show that if $a \ge b \ge c \ge 0$ then $$a^2b(a - b) + b^2c(b - c) + c^2a(c - a) \ge 0.$$

Let $ ABCD$ be a cyclic quadrilateral and $ O$ be the intersection of diagonal $ AC$ and $ BD$. The circumcircles of triangle $ ABO$ and the triangle $ CDO$ intersect at $ K$. Let $ L$ be a point such that the triangle $ BLC$ is similar to $ AKD$ (in that order). Prove that if $ BLCK$ is a convex quadrilateral, then it has an incircle.

Dima has written number $ 1/80!,\,1/81!,\,\dots,1/99!$ on $ 20$ infinite pieces of papers as decimal fractions (the following is written on the last piece: $ \frac {1}{99!} \equal{} 0{,}{00\dots 00}10715\dots$, 155 0-s before 1). Sasha wants to cut a fragment of $ N$ consecutive digits from one of pieces without the comma. For which maximal $ N$ he may do it so that Dima may not guess, from which piece Sasha has cut his fragment? [i]A. Golovanov[/i]

The road ministry has assigned $80$ informal companies to repair $2400$ roads. These roads connect $100$ cities to each other. Each road is between $2$ cities and there is at most $1$ road between every $2$ cities. We know that each company repairs $30$ roads that it has agencies in each $2$ ends of them. Prove that there exists a city in which $8$ companies have agencies.

Consider the parallelogram with vertices $(10,45),$ $(10,114),$ $(28,153),$ and $(28,84).$ A line through the origin cuts this figure into two congruent polygons. The slope of the line is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Four points on the plane are not concyclic, and any three of them are not collinear. Prove that there exists a point $Z$ such that the reflection of each of these four points about $Z$ lies on the circle passing through three remaining points. Proposed by:A Kuznetsov

Let $\Gamma_1$ and $\Gamma_2$ be two intersecting circles with midpoints respectively $O_1$ and $O_2$, such that $\Gamma_2$ intersects the line segment $O_1O_2$ in a point $A$. The intersection points of $\Gamma_1$ and $\Gamma_2$ are $C$ and $D$. The line $AD$ intersects $\Gamma_1$ a second time in $S$. The line $CS$ intersects $O_1O_2$ in $F$. Let $\Gamma_3$ be the circumcircle of triangle $AD$. Let $E$ be the second intersection point of $\Gamma_1$ and $\Gamma_3$. Prove that $O_1E$ is tangent to $\Gamma_3$.

Suppose there are $997$ points given in a plane. If every two points are joined by a line segment with its midpoint coloured in red, show that there are at least $1991$ red points in the plane. Can you find a special case with exactly $1991$ red points?

i) Prove that $$ \lim_{x\to \infty}\,\sum_{n=1}^{\infty} \frac{nx}{(n^{2}+x)^{2}}=\frac{1}{2}$$. ii) Prove that there is a positive constant $c$ such that for every $x\in [1,\infty)$ we have $$\left|\sum_{n=1}^{\infty} \frac{nx}{(n^{2}+x)^{2}}-\frac{1}{2} \right| \leq \frac{c}{x}$$

Seven line segments, with lengths no greater than $10$ inches, and no shorter than $1$ inch, are given. Show that one can choose three of them to represent the sides of a triangle. Give an example which shows that if only six segments are used, then such a choice may be impossible.

Let $({{x}_{n}})$ be an integer sequence such that $0\le {{x}_{0}}<{{x}_{1}}\le 100$ and $${{x}_{n+2}}=7{{x}_{n+1}}-{{x}_{n}}+280,\text{ }\forall n\ge 0.$$ a) Prove that if ${{x}_{0}}=2,{{x}_{1}}=3$ then for each positive integer $n,$ the sum of divisors of the following number is divisible by $24$ $${{x}_{n}}{{x}_{n+1}}+{{x}_{n+1}}{{x}_{n+2}}+{{x}_{n+2}}{{x}_{n+3}}+2018.$$ b) Find all pairs of numbers $({{x}_{0}},{{x}_{1}})$ such that ${{x}_{n}}{{x}_{n+1}}+2019$ is a perfect square for infinitely many nonnegative integer numbers $n.$

Al wishes to label the faces of his cube with the integers $2009,2010,$ and $2011,$ with one integer per face, such that adjacent faces (faces that share an edge) have integers that differ by at most $1.$ Determine the number of distinct ways in which he can label the cube, given that two configurations that can be rotated on to each other are considered the same, and that we disregard the orientation in which each number is written on to the cube.

Calculate the definite integral $$\int_2^4 \sin ((x-3)^3) dx$$

Let $ABCD$ be a square of side 5, $E$ a point on $BC$ such that $BE=3, EC= 2$. Let $P$ be a variable point on the diagonal $BD.$ Determine the length of $PB$ if $PE+PC$ is smallest.

An open necklace can contain rubies, emeralds, and sapphires. At every step we can perform any of the following operations: [list=1] [*]We can replace two consecutive rubies with an emerald and a sapphire, where the emerald is on the left of the sapphire.[/*] [*]We can replace three consecutive emeralds with a sapphire and a ruby, where the sapphire is on the left of the ruby. [/*] [*]If we find two consecutive sapphires then we can remove them.[/*] [*]If we find consecutively and in this order a ruby, an emerald, and a sapphire, then we can remove them.[/*] [/list] Furthermore we can also reverse all of the above operations. For example by reversing 3. we can put two consecutive sapphires on any position we wish. Initially the necklace has one sapphire (and no other precious stones). Decide, with proof, whether there is a finite sequence of steps such that at the end of this sequence the necklace contains one emerald (and no other precious stones). [i]Remark:[/i] A necklace is open if its precious stones are on a line from left to right. We are not allowed to move a precious stone from the rightmost position to the leftmost as we would be able to do if the necklace was closed. [i]Proposed by Demetres Christofides, Cyprus[/i]

In the $\triangle ABC$ with $AC>BC$ and $\angle B<90^{\circ}$, $D$ is the foot of the perpendicular from $A$ onto $BC$ and $E$ is the foot of perpendicular from $D$ onto $AC$. Let $F$ be the point on the segment $DE$ such that $EF \cdot DC=BD \cdot DE$. Prove that $AF$ is perpendicular to $BF$.

Given triangle $ABC$, midpoint $M$ of the side $[BC]$, the centre $O$ of the inscribed circle. The line $(MO)$ crosses the height $AH$ in the point $E$. Prove that the distance $|AE|$ equals the inscribed circle radius.

Find the continuous functions $ f:\left[ 0,\frac{1}{3} \right] \longrightarrow (0,\infty ) $ that satisfy the functional relation $$ 54\int_0^{1/3} f(x)dx +32\int_0^{1/3} \frac{dx}{\sqrt{x+f(x)}} =21. $$ [i]Cristinel Mortici[/i]

Let $ R$ be a rectangle that is the union of a finite number of rectangles $ R_i,$ $ 1 \leq i \leq n,$ satisfying the following conditions: [b](i)[/b] The sides of every rectangle $ R_i$ are parallel to the sides of $ R.$ [b](ii)[/b] The interiors of any two different rectangles $ R_i$ are disjoint. [b](iii)[/b] Each rectangle $ R_i$ has at least one side of integral length. Prove that $ R$ has at least one side of integral length. [i]Variant:[/i] Same problem but with rectangular parallelepipeds having at least one integral side.

Let $ a,\ b,\ c$ be positive real numbers. Prove the following inequality. \[ \int_1^e \frac {x^{a \plus{} b \plus{} c \minus{} 1}[2(a \plus{} b \plus{} c) \plus{} (c \plus{} 2a)x^{a \minus{} b} \plus{} (a \plus{} 2b)x^{b \minus{} c} \plus{} (b \plus{} 2c)x^{c \minus{} a} \plus{}(2a \plus{} b)x^{a \minus{} c} \plus{} (2b \plus{} c)x^{b \minus{} a} \plus{} (2c \plus{} a)x^{c \minus{} b}]}{(x^a \plus{} x^b)(x^b \plus{} x^c)(x^c \plus{} x^a)}\geq a \plus{} b \plus{} c.\] I have just posted 500 th post. [color=blue]Thank you for your cooperations, mathLinkers and AOPS users.[/color] I will keep posting afterwards. Japanese Communities Modeartor kunny