Let $n \ge 2$ be a positive integer. Suppose that $a_1,a_2,...,a_n$ and $b_1,b_2,...,b_n$ are 2n numbers such that $\sum_{i=1}^n a_i =\sum_{i=1}^n n_i= 1$ and $a_i\ge 0, 0 \le b_i\le \frac{n-1}{n}, i = 1, 2,..., n$. Show that $$b_1a_2a_3...a_n+a_1b_2a_3...a_n+...+a_1a_2...a_{k-1}b_ka_{k+1}...a_n+ ...+ a_1a_2...a_{n-1}b_n \le \frac{1}{n(n-1)^{n-2}}$$

We say that the rank of a group $ G$ is at most $ r$ if every subgroup of $ G$ can be generated by at most $ r$ elements. Prove that here exists an integer $ s$ such that for every finite group $ G$ of rank $ 2$ the commutator series of $ G$ has length less than $ s$. [i]J. Erdos[/i]

A series of figures is shown in the picture below, each one of them created by following a secret rule. If the leftmost figure is considered the first figure, how many squares will the 21st figure have? [img]http://www.artofproblemsolving.com/Forum/download/file.php?id=49934[/img] Note: only the little squares are to be counted (i.e., the $2 \times 2$ squares, $3 \times 3$ squares, $\dots$ should not be counted) Extra (not part of the original problem): How many squares will the 21st figure have, if we consider all $1 \times 1$ squares, all $2 \times 2$ squares, all $3 \times 3$ squares, and so on?.

Given a convex polygon $ A_1A_2 \ldots A_n$ with area $ S$ and a point $ M$ in the same plane, determine the area of polygon $ M_1M_2 \ldots M_n,$ where $ M_i$ is the image of $ M$ under rotation $ R^{\alpha}_{A_i}$ around $ A_i$ by $ \alpha_i, i \equal{} 1, 2, \ldots, n.$

Solve in the reals the equation $ 2^{\lfloor\sqrt[3]{x}\rfloor } =x. $ [i]Nedelcu Ion[/i]

$A,B,C,D,E$, and $F$ are points of a convex hexagon, and there is a circle such that $A,B,C,D,E$, and $F$ are all on the circle. If $\angle ABC = 72^o$, $\angle BCD = 96^o$, $\angle CDE = 118^o$, and $\angle DEF = 104^o$, what is $\angle EFA$?

A $\textit{lattice point}$ of the coordinate plane is a point $(x,y)$ in which both $x$ and $y$ are integers. Let $k\geq2$ be a positive integer. Find the smallest positive integer $c_k$ (which may depend on $k$) such that every lattice point can be colored with one of $c_k$ colors, subject to the following two conditions: [list=1] [*] If $(x,y)$ and $(a,b)$ are two distinct neighboring points; that is, $|x-a|\leq1$ and $|y-b|\leq1$, then $(x,y)$ and $(a,b)$ must be different colors. [/*] [*] If $(x,y)$ and $(a,b)$ are two lattice points such that $x\equiv a\pmod{k}$ and $y\equiv b\pmod{k}$, then $(x,y)$ and $(a,b)$ must be the same color. [/*] [/list]

Given are $m\ge 3$ points in the plane. Prove that you can always choose three of these points $A,B,C$ such that $$\angle ABC \le \frac{180^o}{m}.$$

a. Let $ABC$ be a triangle with altitude $AD$ and $P$ a variable point on $AD$. Lines $PB$ and $AC$ intersect each other at $E$, lines $PC$ and $AB$ intersect each other at $F.$ Suppose $AEDF$ is a quadrilateral inscribed . Prove that \[\frac{PA}{PD}=(\tan B+\tan C)\cot \frac{A}{2}.\] b. Let $ABC$ be a triangle with orthocentre $H$ and $P$ a variable point on $AH$. The line through $C$ perpendicular to $AC$ meets $BP$ at $M$, The line through $B$ perpendicular to $AB$ meets $CP$ at $N.$ $K$ is the projection of $A$on $MN$. Prove that $\angle BKC+\angle MAN$ is invariant .

At a table tennis competition, every pair of players played each other exactly once. Every boy beat thrice as many boys as girls, and every girl was beaten by twice as many girls as boys. How many competitors were there, if we know that there were $10$ more boys than girls? There are no draws in table tennis, every match was won by one of the two players.

$(GBR 3)$ A smooth solid consists of a right circular cylinder of height $h$ and base-radius $r$, surmounted by a hemisphere of radius $r$ and center $O.$ The solid stands on a horizontal table. One end of a string is attached to a point on the base. The string is stretched (initially being kept in the vertical plane) over the highest point of the solid and held down at the point $P$ on the hemisphere such that $OP$ makes an angle $\alpha$ with the horizontal. Show that if $\alpha$ is small enough, the string will slacken if slightly displaced and no longer remain in a vertical plane. If then pulled tight through $P$, show that it will cross the common circular section of the hemisphere and cylinder at a point $Q$ such that $\angle SOQ = \phi$, $S$ being where it initially crossed this section, and $\sin \phi = \frac{r \tan \alpha}{h}$.

Let $s$ be the circumcircle of triangle $ABC, L$ and $W$ be common points of angle's $A$ bisector with side $BC$ and $s$ respectively, $O$ be the circumcenter of triangle $ACL$. Restore triangle $ABC$, if circle $s$ and points $W$ and $O$ are given. (D.Prokopenko)

[b]7.[/b] Let $(z_n)_{n=1}^{\infty}$ be a sequence of complex numbers tending to zero. Prove that there exists a sequence $(\epsilon_n)_{n=1}^{\infty}$ (where $\epsilon_n = +1$ or $-1$) such that the series $\sum_{n=1}^{\infty} \epsilon_n z_n$ is convergente. [b](F. 9)[/b]

Let $p>q$ be primes, such that $240 \nmid p^4-q^4$. Find the maximal value of $\frac{q} {p}$.

The number of roots satisfying the equation $ \sqrt{5 \minus{} x} \equal{} x\sqrt{5 \minus{} x}$ is: $ \textbf{(A)}\ \text{unlimited}\qquad \textbf{(B)}\ 3\qquad \textbf{(C)}\ 2\qquad \textbf{(D)}\ 1\qquad \textbf{(E)}\ 0$

For a given positive integer $n,$ find $$\sum_{k=0}^{n} \left(\frac{\binom{n}{k} \cdot (-1)^k}{(n+1-k)^2} - \frac{(-1)^n}{(k+1)(n+1)}\right).$$

The vigilantes are a group of five superheroes, such that each one has one and only one of the following powers: hypnosis, super speed, shadow manipulation, immortality and super strength (each has a different power). On an adventure to the island of Philippines, they meet the sorcerer Vicencio, an old wise man who offers them the following ritual to help them: The ritual consists of a superhero $A$ acquiring the gift (s) of $B$ without $B$ acquiring the gift (s) of $A$. Determine the fewest number of rituals to be performed by the sorcerer Vicencio so that each superhero controls each of the five gifts. Clarification: At the end of the ritual, a superhero $A$ will have his gifts and those of a superhero $B$, but $B$ does not acquire those of $A$, but it does keep its own.

Natural numbers $a$, $b$ are written in decimal using the same digits (i.e. every digit from 0 to 9 appears the same number of times in $a$ and in $b$). Prove that if $a+b=10^{1000}$ then both numbers $a$ and $b$ are divisible by $10$.

Let $N>s$ be positive integers. Electricity park has a number of buildings; exactly $N$ of them are power plants, and another one of them is the headquarter. Some pairs of buildings have one-way power cables between them, satisfying: (i) The cables connected to a power plant will only send the power out of the plant. (ii) For each non-headquarter building, there is a unique sequence of cables that can transport the power from that building to the headquarter. A building is [b]$s$-electrifed[/b] if, after removing any one cable from the park, the building can still receive power from at least $s$ different power plants. Find the maximum possible number of $s$-electrifed buildings. [i]Note: There seems to be confusion about whether a power plant is $1$-electrified. For the sake of simplicity let's say that any power plant is not $s$-electrified for any $s\geq 1$.[/i] [i]Proposed by usjl[/i]

A function $f$ is defined recursively by $f(1)=f(2)=1$ and $$f(n)=f(n-1)-f(n-2)+n$$ for all integers $n \geq 3$. What is $f(2018)$? $\textbf{(A)} \text{ 2016} \qquad \textbf{(B)} \text{ 2017} \qquad \textbf{(C)} \text{ 2018} \qquad \textbf{(D)} \text{ 2019} \qquad \textbf{(E)} \text{ 2020}$

Given the progression $10^{\dfrac{1}{11}}, 10^{\dfrac{2}{11}}, 10^{\dfrac{3}{11}}, 10^{\dfrac{4}{11}},\dots , 10^{\dfrac{n}{11}}$. The least positive integer $n$ such that the product of the first $n$ terms of the progression exceeds $100,000$ is $\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad \textbf{(E) }11$

A singles tournament had six players. Each player played every other player only once, with no ties. If Helen won 4 games, Ines won 3 games, Janet won 2 games, Kendra won 2 games and Lara won 2 games, how many games did Monica win? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Let $n \geq 2$ be an integer such that $6^n + 11^n$ is divisible by $n$. Prove that $n^{100} + 6^n + 11^n$ is divisible by $17n$ and not divisible by $289n$.

In a school with double schooling, in the morning the language teacher divided the students into $200$ groups for an activity. In the afternoon, the math teacher divided the same students into $300$ groups for another activity. A student is considered [i]special[/i] if the group they belonged to in the afternoon is smaller than the group they belonged to in the morning. Find the minimum number of special students that can exist in the school. [b]Note:[/b] Each group has at least one student.

Find all natural numbers $ n,x,y $ such that $ \big| 2^x-n^{y+1}\big| =1 . $