The letters of the word ‘GAUSS’ and the digits in the number ‘1998’ are each cycled separately and then numbered as shown. 1. AUSSG 9981 2. USSGA 9819 3. SSGAU 8199 etc. If the pattern continues in this way, what number will appear in front of GAUSS 1998? $\textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 20$

Three lines are drawn parallel to the sides of the triangles in the opposite to the vertex, not belonging to the side, part of the plane. The distance from each side to the corresponding line equals the length of the side. Prove that six intersection points of those lines with the continuations of the sides are situated on one circumference.

A binary string is a word containing only $0$s and $1$s. In a binary string, a $1-$run is a non extendable substring containing only $1$s. Given a positive integer $n$, let $B(n)$ be the number of $1-$runs in the binary representation of $n$. For example, $B(107)=3$ since $107$ in binary is $1101011$ which has exactly three $1-$runs. What is the following expression equal to? $$B(1)+B(2)+B(3)+ \dots + B(255)$$

We say that a positive integer $n$ is [i]memorable[/i] if it has a binary representation with strictly more $1$'s than $0$'s (for example $25$ is memorable because $25=(11001)_{2}$ has more $1$'s than $0$'s). Are there infinitely many memorable perfect squares? [i]Proposed by Nikola Velov[/i]

Bisectors of triangle ABC of an angles A and C intersect with BC and AB at points A1 and C1 respectively. Lines AA1 and CC1 intersect circumcircle of triangle ABC at points A2 and C2 respectively. K is intersection point of C1A2 and A1C2. I is incenter of ABC. Prove that the line KI divides AC into two equal parts.

Let $m$ and $n$ be positive integers. Player $A$ has a field of $m \times n$, and player $B$ has a $1 \times n$ field (the first is the number of rows). On the first move, each player places on each square of his field white or black chip as he pleases. At each next on the move, each player can change the color of randomly chosen pieces on your field to the opposite, provided that in no row for this move will not change more than one chip (it is allowed not to change not a single chip). The moves are made in turn, player $A$ starts. Player $A$ wins if there is such a position that in the only row player $B$'s squares, from left to right, are the same as in some row of player's field $A$. Prove that player $A$ has the ability to win for any game of player $B$ if and only if $n <2m$.

Let $d(n)$ be the number of divisors of a nonnegative integer $n$ (we set $d(0)=0$). Find all positive integers $d$ such that there exists a two-variable polynomial $P(x,y)$ of degree $d$ with integer coefficients such that: [list] [*] for any positive integer $y$, there are infinitely many positive integers $x$ such that $\gcd(x,y)=1$ and $d(|P(x,y)|) \mid x$, and [*] for any positive integer $x$, there are infinitely many positive integers $y$ such that $\gcd(x,y)=1$ and $d(|P(x,y)|) \mid y$. [/list] [i]Allen Wang[/i]

Let $a$ and $S$ be the length of the side and the area of regular triangle inscribed in a circle of radius $1$. A closed broken line $A_1A_2...A_{51}A_1$ consisting of $51$ segments of the same length $a$ is placed inside the circle. Prove that the sum of areas of the $ 51$ triangles between the neighboring segments $$A_1A_2A_3, A_2A_3A_4,..., A_{49}A_{50}A_{51}, A_{50}A_{51}A_1, A_{51}A_1A_2$$ is not less than $3S$. (A. Berzinsh, Riga)

How many positive integers at most $420$ leave different remainders when divided by each of $5$, $6$, and $7$? [i]Proposed by Milan Haiman.[/i]

Let $c$ be the length of the hypotenuse of a right angle triangle whose two other sides have lengths $a$ and $b$. Prove that $a+b\le c\sqrt{2}$. When does the equality hold?

Two sides of the cyclic quadrilateral $ABCD$ are known: $AB = a$, $BC = b$. A point $K$ is taken on the side $CD$ so that $CK = m$. A circle passing through $B$, $K$ and $D$ intersects line $DA$ at a point $M$, different from $D$. Find $AM$.

Find the smallest natural number $k$ such that the system of equations $$x+y+z=x^2+y^2+z^2=\dots=x^k+y^k+z^k $$ has only one solution for positive real numbers $x$, $y$ and $z$.

Let $c: Q-\{0\} \to Q-\{0\}$ a function with the following properties (for all $x,y, a, b \in Q-\{0\}$ and $x \ne 1$): a) $c (x, 1- x) = 1$ b) $c (ab,y) = c (a,y)c(b, y)$ c) $c (y,ab) = c (y, a)c(y,b)$ Show that then $c (a,b) c(b,a) = 1 = c(a,-a)$ also holds.

A convex pentagon $ABCDE$ with $DC = DE$ and $\angle DCB = \angle DEA = 90^o$ is given. Let $F$ be a point on the segment $AB$ such that $AF : BF = AE : BC$. Prove that $\angle FCE = \angle ADE$ and $\angle FEC = \angle BDC$.

Consider the following sequence of positive real numbers $\dots<a_{-2}<a_{-1}<a_0<a_1<a_2<\dots$ infinite in both directions. For each positive integer $k$ let $b_k$ be the least integer such that the ratio between the sum of $k$ consecutive terms and the greatest of these $k$ terms is less than or equal to $b_k$(This fact occurs for any sequence of $k$ consecutive numbers). Prove that the sequence $b_1,b_2,b_3,...$ coincides with the sequence $1,2,3,...$ or is eventually constant.

[b]p1.[/b] Cities A, B, C, D and E are located next to each other along the highway at a distance of $5$ km from each other. The bus runs along the highway from city A to city E and back. The bus consumes $20$ liters of gasoline for every $100$ kilometers. In which city will a bus run out of gas if it initially had $150$ liters of gasoline in its tank? [b]p2.[/b] Find the minimum four-digit number whose product of all digits is $729$. Explain your answer. [b]p3.[/b] At the parade, soldiers are lined up in two lines of equal length, and in the first line the distance between adjacent soldiers is $ 20\%$ greater than in the second (there is the same distance between adjacent soldiers in the same line). How many soldiers are in the first rank if there are $85$ soldiers in the second rank? [b]p4.[/b] It is known about three numbers that the sum of any two of them is not less than twice the third number, and the sum of all three is equal to $300$. Find all triplets of such (not necessarily integer) numbers. [b]p5.[/b] The tourist fills two tanks of water using two hoses. $2.9$ liters of water flow out per minute from the first hose, $8.7$ liters from the second. At that moment, when the smaller tank was half full, the tourist swapped the hoses, after which both tanks filled at the same time. What is the capacity of the larger tank if the capacity of the smaller one is $12.5$ liters? [b]p6.[/b] Is it possible to mark 6 points on a plane and connect them with non-intersecting segments (with ends at these points) so that exactly four segments come out of each point? [b]p7.[/b] Petya wrote all the natural numbers from $1$ to $1000$ and circled those that are represented as the difference of the squares of two integers. Among the circled numbers, which numbers are more even or odd? [b]p8.[/b] On a sheet of checkered paper, draw a circle of maximum radius that intersects the grid lines only at the nodes. Explain your answer. [b]p9.[/b] Along the railway there are kilometer posts at a distance of $1$ km from each other. One of them was painted yellow and six were painted red. The sum of the distances from the yellow pillar to all the red ones is $14$ km. What is the maximum distance between the red pillars? [b]p10.[/b] The island nation is located on $100$ islands connected by bridges, with some islands also connected to the mainland by a bridge. It is known that from each island you can travel to each (possibly through other islands). In order to improve traffic safety, one-way traffic was introduced on all bridges. It turned out that from each island you can leave only one bridge and that from at least one of the islands you can go to the mainland. Prove that from each island you can get to the mainland, and along a single route. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

Prove that $5^n-3^n$ is not divisible by $2^n+65$ for any positive integer $n$.

The integers $1, 2, 3, \ldots, 2016$ are written on a board. You can choose any two numbers on the board and replace them with their average. For example, you can replace $1$ and $2$ with $1.5$, or you can replace $1$ and $3$ with a second copy of $2$. After $2015$ replacements of this kind, the board will have only one number left on it. (a) Prove that there is a sequence of replacements that will make the final number equal to $2$. (b) Prove that there is a sequence of replacements that will make the final number equal to $1000$.

Show that the determinant: \[ \begin{vmatrix} 0 & a & b & c \\ -a & 0 & d & e \\ -b & -d & 0 & f \\ -c & -e & -f & 0 \end{vmatrix} \] is non-negative, if its elements $a, b, c,$ etc., are real.

There are $60$ friends who want to visit each others home during summer vacation. Everyday, they decide to either stay home or visit the home of everyone who stayed home that day. Find the minimum number of days required for everyone to have visited their friends’ homes.

Let $n \geq 3$ be an integer. Rowan and Colin play a game on an $n \times n$ grid of squares, where each square is colored either red or blue. Rowan is allowed to permute the rows of the grid and Colin is allowed to permute the columns. A grid coloring is [i]orderly[/i] if: [list] [*]no matter how Rowan permutes the rows of the coloring, Colin can then permute the columns to restore the original grid coloring; and [*]no matter how Colin permutes the columns of the coloring, Rowan can then permute the rows to restore the original grid coloring. [/list] In terms of $n$, how many orderly colorings are there? [i]Proposed by Alec Sun[/i]

Find the largest positive integer $n$ not divisible by $10$ which is a multiple of each of the numbers obtained by deleting two consecutive digits (neither of them in the first or last position) of $n$. (Note: $n$ is written in the usual base ten notation.)

Three flower beds overlap as shown. Bed A has 500 plants, bed B has 450 plants, and bed C has 350 plants. Beds A and B share 50 plants, while beds A and C share 100. The total number of plants is [asy] draw((0,0)--(3,0)--(3,1)--(0,1)--cycle); draw(circle((.3,-.1),.7)); draw(circle((2.8,-.2),.8)); label("A",(1.3,.5),N); label("B",(3.1,-.2),S); label("C",(.6,-.2),S);[/asy] $ \text{(A)}\ 850\qquad\text{(B)}\ 1000\qquad\text{(C)}\ 1150\qquad\text{(D)}\ 1300\qquad\text{(E)}\ 1450 $

Let $P(x) =(x+1)^p (x-3)^q=x^n+a_1x^{n-1}+a_2x^{n-2}+...+a_{n-1}x+a_n$ where $p$ and $q$ are positive integers a) Given $a_1=a_2$, prove that $3n$ is a perfect square. b) Prove that there exist infinitely many pairs $(p, q)$ of positive integers p and q such that the equality $a_1=a_2$ is valid for the polynomial $P(x)$. (D. Bazylev)

In a football tournament there are $8$ teams, each of which plays exacly one match against every other team. If a team $A$ defeats team $B$, then $A$ is awarded $3$ points and $B$ gets $0$ points. If they end up in a tie, they receive $1$ point each. It turned out that in this tournament, whenever a match ended up in a tie, the two teams involved did not finish with the same final score. Find the maximum number of ties that could have happened in such a tournament.