Two players $A$ and $B$ play the following game taking alternate moves. In each move, a player writes one digit on the blackboard. Each new digit is written either to the right or left of the sequence of digits already written on the blackboard. Suppose that $A$ begins the game and initially the blackboard was empty. $B$ wins the game if ,after some move of $B$, the sequence of digits written in the blackboard represents a perfect square. Prove that $A$ can prevent $B$ from winning.

Given $6$ points in a plane, assume that each two of them are connected by a segment. Let $D$ be the length of the longest, and $d$ the length of the shortest of these segments. Prove that $\frac Dd\ge\sqrt3$.

Let $n$ be a positive integer. A sequence of $n$ positive integers (not necessarily distinct) is called [b]full[/b] if it satisfies the following condition: for each positive integer $k\geq2$, if the number $k$ appears in the sequence then so does the number $k-1$, and moreover the first occurrence of $k-1$ comes before the last occurrence of $k$. For each $n$, how many full sequences are there ?

The computer "Intel stump-V" can do only one operation with a number: add 1 to it, then rearrange all the zeros in the decimal representation to the end and rearrenge the left digits in any order. (For example from 1004 you could get 1500 or 5100). The number $12345$ was written on the computer and after performing 400 operations, the number 100000 appeared on the screen. How many times has a number with the last digit 0 appeared on the screen?

Seven distinct points are marked on a circle of circumference $c$. Three of the points form an equilateral triangle and the other four form a square. Prove that at least one of the seven arcs into which the seven points divide the circle has length less than or equal $\frac{c}{24}$.

There are seven points on the plane, no three of which are collinear. Every pair of points is connected with a line segment, each of which is either blue or red. Prove that there are at least four monochromatic triangles in the figure.

Let $ n $ be a positive integer. Consider words of length $n$ composed of letters from the set $ \{ M, E, O \} $. Let $ a $ be the number of such words containing an even number (possibly 0) of blocks $ ME $ and an even number (possibly 0) blocks of $ MO $ . Similarly let $ b $ the number of such words containing an odd number of blocks $ ME $ and an odd number of blocks $ MO $. Prove that $ a>b $.

For each positive integer $ n$, define $ f(n)$ as the number of digits $ 0$ in its decimal representation. For example, $ f(2)\equal{}0$, $ f(2009)\equal{}2$, etc. Please, calculate \[ S\equal{}\sum_{k\equal{}1}^{n}2^{f(k)},\] for $ n\equal{}9,999,999,999$. [i]Yudi Satria, Jakarta[/i]

Find the greatest positive integer $m$, such that one of the $4$ letters $C,G,M,O$ can be placed in each cell of a table with $m$ rows and $8$ columns, and has the following property: For any two distinct rows in the table, there exists at most one column, such that the entries of these two rows in such a column are the same letter.

Given a permutation $\sigma = (a_1,a_2,a_3,...a_n)$ of $(1,2,3,...n)$ , an ordered pair $(a_j,a_k)$ is called an inversion of $\sigma$ if $a \leq j < k \leq n$ and $a_j > a_k$. Let $m(\sigma)$ denote the no. of inversions of the permutation $\sigma$. Find the average of $m(\sigma)$ as $\sigma$ varies over all permutations.

Nair and Yuli play the following game: $1.$ There is a coin to be moved along a horizontal array with $203$ cells. $2.$ At the beginning, the coin is at the first cell, counting from left to right. $3.$ Nair plays first. $4.$ Each of the players, in their turns, can move the coin $1$, $2$, or $3$ cells to the right. $5.$ The winner is the one who reaches the last cell first. What strategy does Nair need to use in order to always win the game?

Find the number of ordered triples $(a, b)$ of positive integers with $a < b$ and $100 \leq a, b \leq 1000$ satisfy $\gcd(a, b) : \mathrm{lcm}(a, b) = 1 : 495$?

Victor shuffles a standard 54-card deck then flips over cards one at a time onto a pile stopping after the first ace. However, if he ever reveals a joker he discards the entire pile, including the joker, and starts a new pile; for example, if the sequence of cards is 2-3-Joker-A, the pile ends with one card in it. Find the expected number of cards in the end pile.

A rectangular city is exactly $m$ blocks long and $n$ blocks wide (see diagram). A woman lives in the southwest corner of the city and works in the northeast corner. She walks to work each day but, on any given trip, she makes sure that her path does not include any intersection twice. Show that the number $f(m,n)$ of different paths she can take to work satisfies $f(m,n) \le 2^{mn}$. [asy] unitsize(0.4 cm); for(int i = 0; i <= 11; ++i) { draw((i,0)--(i,7)); } for(int j = 0; j <= 7; ++j) { draw((0,j)--(11,j)); } label("$\underbrace{\hspace{4.4 cm}}$", (11/2,-0.5)); label("$\left. \begin{array}{c} \vspace{2.4 cm} \end{array} \right\}$", (11,7/2)); label("$m$ blocks", (11/2,-1.5)); label("$n$ blocks", (14,7/2)); [/asy]

The Proenc has a new $8\times 8$ chess board and requires composing it into rectangles that do not overlap, so that: (i) each rectangle has as many white squares as black ones; (ii) there are no two rectangles with the same number of squares. Determines the maximum value of $n$ for which such a decomposition is possible. For this value of $n$, determine all possible sets ${A_1,... ,A_n}$, where $A_i$ is the number of rectangle $i$ in squares, for which a decomposition of the board under the conditions intended actions is possible.

A government’s land with dimensions $n \times n$ are going to be sold in phases. The land is divided into $n^2$ squares with dimension $1 \times 1$. In the first phase, $n$ farmers bought a square, and for each rows and columns there is only one square that is bought by a farmer. After one season, each farmer could buy one more square, with the conditions that the newly-bought square has a common side with the farmer’s land and it hasn’t been bought by other farmers. Determine all values of n such that the government’s land could not be entirely sold within $n$ seasons.

Mrs. Toad has a class of $2017$ students, with unhappiness levels $1, 2, \dots, 2017$ respectively. Today in class, there is a group project and Mrs. Toad wants to split the class in exactly $15$ groups. The unhappiness level of a group is the average unhappiness of its members, and the unhappiness of the class is the sum of the unhappiness of all $15$ groups. What's the minimum unhappiness of the class Mrs. Toad can achieve by splitting the class into $15$ groups?

Each voter in an election puts $n$ names of candidates on the ballot. There are $n + 1$ at the polling station urn. After the elections it turned out that each ballot box contained at least at least one ballot, for every choice of the $(n + 1)$-th ballot, one from each ballot box, there is a candidate whose surname appears in each of the selected ballots. Prove that in at least one ballot box all ballots contain the name of the same candidate.

Inside a square of sidelength $ 1$ there are finitely many disks that are allowed to overlap. The sum of all circumferences is $ 10$. Show that there is a line intersecting or touching at least $ 4$ disks.

Let n be a positive interger. Let n real numbers be wrote on a paper. We call a "transformation" :choosing 2 numbers $a,b$ and replace both of them with $a*b$. Find all n for which after a finite number of transformations and any n real numbers, we can have the same number written n times on the paper.

Ankit, Bill, Charlie, Druv, and Ed are playing a game in which they go around shouting numbers in that order. Ankit starts by shouting the number $1$. Bill adds a number that is a factor of the number of letters in his name to Ankit’s number and shouts the result. Charlie does the same with Bill’s number, and so on (once Ed shouts a number, Ankit does the same procedure to Ed’s number, and the game goes on). What is the sum of all possible numbers that can be the $23$rd shout?

An international society has its members from six different countries. The list of members contain $1978$ names, numbered $1, 2, \dots, 1978$. Prove that there is at least one member whose number is the sum of the numbers of two members from his own country, or twice as large as the number of one member from his own country.

For each sequence of $n$ zeros and $n$ units, we assign a number that is a number sections of the same digits in it. (For example, sequence $00111001$ has $4$ such sections $00, 111,00, 1$.) For a given $n$ we sum up all the numbers assigned to each such sequence. Prove that the sum total is equal to $(n+1){2n \choose n} $

The sequence $a_1,a_2,\dots$ of integers satisfies the conditions: (i) $1\le a_j\le2015$ for all $j\ge1$, (ii) $k+a_k\neq \ell+a_\ell$ for all $1\le k<\ell$. Prove that there exist two positive integers $b$ and $N$ for which\[\left\vert\sum_{j=m+1}^n(a_j-b)\right\vert\le1007^2\]for all integers $m$ and $n$ such that $n>m\ge N$. [i]Proposed by Ivan Guo and Ross Atkins, Australia[/i]

Let $n$ be a positive integer. Find the maximal number of non-congruent triangles whose sides lengths are integers $\leq n.$