Given a positive integer $n$, consider a triangular array with entries $a_{ij}$ where $i$ ranges from $1$ to $n$ and $j$ ranges from $1$ to $n-i+1$. The entries of the array are all either $0$ or $1$, and, for all $i > 1$ and any associated $j$ , $a_{ij}$ is $0$ if $a_{i-1,j} = a_{i-1,j+1}$, and $a_{ij}$ is $1$ otherwise. Let $S$ denote the set of binary sequences of length $n$, and define a map $f \colon S \to S$ via $f \colon (a_{11}, a_{12},\cdots ,a_{1n}) \to (a_{n1}, a_{n-1,2}, \cdots , a_{1n})$. Determine the number of fixed points of $f$.

The radius of the circumcircle of triangle $\Delta$ is $R$ and the radius of the inscribed circle is $r$. Prove that a circle of radius $R + r$ has an area more than $5$ times the area of triangle $\Delta$.

Five congruent circles have centers at the vertices of a regular pentagon so that each of the circles is tangent to its two neighbors. A sixth circle (shaded in the diagram below) congruent to the other five is placed tangent to two of the five. If this sixth circle is allowed to roll without slipping around the exterior of the figure formed by the other five circles, then it will turn through an angle of $k$ degrees before it returns to its starting position. Find $k$. [asy] import graph; size(6cm); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); filldraw(circle((2.96,2.58), 1),grey); draw(circle((-1,3), 1)); draw(circle((1,3), 1)); draw(circle((1.62,1.1), 1)); draw(circle((0,-0.08), 1)); draw(circle((-1.62,1.1), 1)); [/asy]

For positive integers $a>b>1$, define \[x_n = \frac {a^n-1}{b^n-1}\] Find the least $d$ such that for any $a,b$, the sequence $x_n$ does not contain $d$ consecutive prime numbers. [i]V. Senderov[/i]

Let \[\begin{array}{cccc}a_{1,1}& a_{1,2}& a_{1,3}& \dots \\ a_{2,1}& a_{2,2}& a_{2,3}& \dots \\ a_{3,1}& a_{3,2}& a_{3,3}& \dots \\ \vdots & \vdots & \vdots & \ddots \end{array}\] be a doubly infinite array of positive integers, and suppose each positive integer appears exactly eight times in the array. Prove that $a_{m,n}> mn$ for some pair of positive integers $(m,n)$.

Prove that the equation \[ x^n + 1 = y^{n+1}, \] where $n$ is a positive integer not smaller then 2, has no positive integer solutions in $x$ and $y$ for which $x$ and $n+1$ are relatively prime.

Determine all real numbers $x > 1, y > 1$, and $z > 1$,satisfying the equation $x+y+z+\frac{3}{x-1}+\frac{3}{y-1}+\frac{3}{z-1}=2(\sqrt{x+2}+\sqrt{y+2}+\sqrt{z+2})$

A collection of $n$ positive numbers, where repeats are allowed, adds to $500$. They can be split into $20$ groups each adding to $25$, and can also be split into $25$ groups each adding to $20$. (A group is allowed to contain any amount of integers, even just one integer.) What is the least possible value of $n$? [i]Aaron Wang[/i]

In what case does the system of equations $\begin{matrix} x + y + mz = a \\ x + my + z = b \\ mx + y + z = c \end{matrix}$ have a solution? Find conditions under which the unique solution of the above system is an arithmetic progression.

Arnaldo and Bernardo play a Super Naval Battle. Each has a board $n \times n$. Arnaldo puts boats on his board (at least one but not known how many). Each boat occupies the $n$ houses of a line or a column and the boats they can not overlap or have a common side. Bernardo marks $m$ houses (representing shots) on your board. After Bernardo marked the houses, Arnaldo says which of them correspond to positions occupied by ships. Bernardo wins, and then discovers the positions of all Arnaldo's boats. Determine the lowest value of $m$ for which Bernardo can guarantee his victory.

Solve equation in real numbers $\log_{2}(4^x+4)=x+\log_{2}(2^{x+1}-3)$

Triangle $ABC$ is inscribed in a circle, and $\angle B = \angle C = 4\angle A$. If $B$ and $C$ are adjacent vertices of a regular polygon of $n$ sides inscribed in this circle, then $n=$ [asy] draw(Circle((0,0), 5)); draw((0,5)--(3,-4)--(-3,-4)--cycle); label("A", (0,5), N); label("B", (-3,-4), SW); label("C", (3,-4), SE); dot((0,5)); dot((3,-4)); dot((-3,-4)); [/asy] $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 7 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 15 \qquad\textbf{(E)}\ 18 $

Consider two parabolas $y = x^2$ and $y = x^2 - 1$. Let $U$ be the set of points between the parabolas (including the points on the parabolas themselves). Does $U$ contain a line segment of length greater than $10^6$ ? Alexey Tolpygo

When real numbers $a,\ b$ move satisfying $\int_0^{\pi} (a\cos x+b\sin x)^2dx=1$, find the maximum value of $\int_0^{\pi} (e^x-a\cos x-b\sin x)^2dx.$

$ A_1$, $ B_1$ and $ C_1$ are the projections of the vertices $ A$, $ B$ and $ C$ of triangle $ ABC$ on the respective sides. If $ AB \equal{} c$, $ AC \equal{} b$, $ BC \equal{} a$ and $ AC_1 \equal{} 2t AB$, $ BA_1 \equal{} 2rBC$, $ CB_1 \equal{} 2 \mu AC$. Prove that: \[ \frac {a^2}{b^2} \cdot \left( \frac {t}{1 \minus{} 2t} \right)^2 \plus{} \frac {b^2}{c^2} \cdot \left( \frac {r}{1 \minus{} 2r} \right)^2 \plus{} \frac {c^2}{a^2} \cdot \left( \frac {\mu}{1 \minus{} 2\mu} \right)^2 \plus{} 16tr \mu \geq 1 \]

Let's call the number string $D = d_{n-1}d_{n-2}...d_0$ a [i]stable ending[/i] of a number , if for any natural number $m$ that ends in $D$, any of its natural powers $m^k$ also ends in $D$. Prove that for every natural number $n$ there are exactly four stable endings of a number of length $n$. [hide=original wording]Ciparu virkni $D = d_{n-1}d_{n-2}...d_0$ sauksim par stabilu skaitļa nobeigumu, ja jebkuram naturālam skaitlim m, kas beidzas ar D, arī jebkura tā naturāla pakāpe $m^k$ beidzas ar D. Pierādīt, ka katram naturālam n ir tieši četri stabili skaitļa nobeigumi, kuru garums ir n.[/hide]

Let $ n\ge 3$ be a natural number. Find all nonconstant polynomials with real coeficcietns $ f_{1}\left(x\right),f_{2}\left(x\right),\ldots,f_{n}\left(x\right)$, for which \[ f_{k}\left(x\right)f_{k+ 1}\left(x\right) = f_{k +1}\left(f_{k + 2}\left(x\right)\right), \quad 1\le k\le n,\] for every real $ x$ (with $ f_{n +1}\left(x\right)\equiv f_{1}\left(x\right)$ and $ f_{n + 2}\left(x\right)\equiv f_{2}\left(x\right)$).

Decide whether for every polynomial $P$ of degree at least $1$, there exist infinitely many primes that divide $P(n)$ for at least one positive integer $n$. [i](Walther Janous)[/i]

Let $P(x)=x^{2016}+2x^{2015}+...+2017,Q(x)=1399x^{1398}+...+2x+1$. Prove that there are strictly increasing sequances $a_i,b_i, i=1,...$ of positive integers such that $gcd(a_i,a_{i+1})=1$ for each $i$. Moreover, for each even $i$, $P(b_i) \nmid a_i, Q(b_i) | a_i$ and for each odd $i$, $P(b_i)|a_i,Q(b_i) \nmid a_i$ Proposed by [i]Shayan Talaei[/i]

Two men set out at the same time to walk towards each other from $ M$ and $ N$, $ 72$ miles apart. The first man walks at the rate of $ 4$ mph. The second man walks $ 2$ miles the first hour, $ 2\frac {1}{2}$ miles the second hour, $ 3$ miles the third hour, and so on in arithmetic progression. Then the men will meet: $ \textbf{(A)}\ \text{in 7 hours} \qquad \textbf{(B)}\ \text{in }{8\frac {1}{4}}\text{ hours}\qquad \textbf{(C)}\ \text{nearer }{M}\text{ than }{N}\qquad \\ \textbf{(D)}\ \text{nearer }{N}\text{ than }{M}\qquad \textbf{(E)}\ \text{midway between }{M}\text{ and }{N}$

For a positive integer $n$, let $p(n)$ denote the number of distinct prime numbers that divide evenly into $n$. Determine the number of solutions, in positive integers $n$, to the inequality $\log_4 n \le p(n)$.

A group of $ 12 $ pirates agree to divide a treasure chest of gold coins among themselves as follows. The $ k^\text{th} $ pirate to take a share takes $ \frac{k}{12} $ of the coins that remain in the chest. The number of coins initially in the chest is the smallest number for which this arrangement will allow each pirate to receive a positive whole number of coins. How many coins does the $ 12^{\text{th}} $ pirate receive? $ \textbf{(A)} \ 720 \qquad \textbf{(B)} \ 1296 \qquad \textbf{(C)} \ 1728 \qquad \textbf{(D)} \ 1925 \qquad \textbf{(E)} \ 3850 $

Solve the equation $x^3+2y^3+5z^3=0$ in integers.

3 countries $A, B, C$ participate in a competition where each country has 9 representatives. The rules are as follows: every round of competition is between 1 competitor each from 2 countries. The winner plays in the next round, while the loser is knocked out. The remaining country will then send a representative to take on the winner of the previous round. The competition begins with $A$ and $B$ sending a competitor each. If all competitors from one country have been knocked out, the competition continues between the remaining 2 countries until another country is knocked out. The remaining team is the champion. [b]I.[/b] At least how many games does the champion team win? [b]II.[/b] If the champion team won 11 matches, at least how many matches were played?

Find all positive integer $n$ satisfying the conditions $a)n^2=(a+1)^3-a^3$ $b)2n+119$ is a perfect square.