A hundred of silver coins are laid down in a line. A wizard can convert silver coin into golden one in $3$ seconds. Each golden coin, which is near the coin being converted, reduces this time by $1$ second. What minimal time is required for the wizard to convert all coins to gold?

For every $n \in N$, is it possible to make a figure consisting of $n+1$ points, where $n$ points lie on one line and one point is not on that line, so that each pair of those points is an integer distance from each other?

The set $M = \{1, 2, . . . , 2n\}$ is partitioned into $k$ nonintersecting subsets $M_1,M_2, \dots, M_k,$ where $n \ge k^3 + k.$ Prove that there exist even numbers $2j_1, 2j_2, \dots, 2j_{k+1}$ in $M$ that are in one and the same subset $M_i$ $(1 \le i \le k)$ such that the numbers $2j_1 - 1, 2j_2 - 1, \dots, 2j_{k+1} - 1$ are also in one and the same subset $M_j (1 \le j \le k).$

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]

A semicircle of radius $r$ is divided into $n + 1$ equal parts and any point $k$ of the division with the ends of the semicircle forms a triangle $A_k$. Calculate the limit, as $n$ tends to infinity, of the arithmetic mean of the areas of the triangles.

Assume that $ S\equal{}(a_1, a_2, \cdots, a_n)$ consists of $ 0$ and $ 1$ and is the longest sequence of number, which satisfies the following condition: Every two sections of successive $ 5$ terms in the sequence of numbers $ S$ are different, i.e., for arbitrary $ 1\le i<j\le n\minus{}4$, $ (a_i, a_{i\plus{}1}, a_{i\plus{}2}, a_{i\plus{}3}, a_{i\plus{}4})$ and $ (a_j, a_{j\plus{}1}, a_{j\plus{}2}, a_{j\plus{}3}, a_{j\plus{}4})$ are different. Prove that the first four terms and the last four terms in the sequence are the same.

Given $ n$ points in a line so that any distance occurs at most twice, show that the number of distance occurring exactly once is at least $ \lfloor n/2 \rfloor$. [i]V. T. Sos, L. Szekely[/i]

We consider tilings of a rectangular $m \times n$-board with $1\times2$-tiles. The tiles can be placed either horizontally, or vertically, but they aren't allowed to overlap and to be placed partially outside of the board. All squares on theboard must be covered by a tile. (a) Prove that for every tiling of a $4 \times 2010$-board with $1\times2$-tiles there is a straight line cutting the board into two pieces such that every tile completely lies within one of the pieces. (b) Prove that there exists a tiling of a $5 \times  2010$-board with $1\times 2$-tiles such that there is no straight line cutting the board into two pieces such that every tile completely lies within one of the pieces.

Find the number of even permutations of $ \{1,2,\ldots,n\}$ with no fixed points.

Peter has a wooden square stamp divided into a grid. He coated some $102$ cells of this grid with black ink. After that, he pressed this stamp $100$ times on a list of paper so that each time just those $102$ cells left a black imprint on the paper. Is it possible that after his actions the imprint on the list is a square $101 \times 101$ such that all the cells except one corner cell are black? (Alexsandr Gribalko)

$60$ points are on the interior of a unit circle (a circle with radius $1$). Show that there exists a point $V$ on the circumference of the circle such that the sum of the distances from $V$ to the $60$ points is less than or equal to $80$.

An $m \times n$ rectangle is divided into mn unit squares by lines parallel to its sides. A gnomon is the figure of three unit squares formed by deleting one unit square from a $2 \times 2$ square. For what $m, n$ can we divide the rectangle into gnomons so that no two gnomons form a rectangle and no vertex is in four gnomons?

You have an $n \times n$ grid of empty squares. You place a cross in all the squares, one at a time. When you place a cross in an empty square, you receive $i+j$ points if there were $i$ crosses in the same row and $j$ crosses in the same column before you placed the new cross. Which are the possible total scores you can get?

In a game, a player can level up to 16 levels. In each level, the player can upgrade an ability spending that level on it. There are three kinds of abilities, however, one ability can not be upgraded before level 6 for the first time. And that special ability can not be upgraded before level 11. Other abilities can be upgraded at any level, any times (possibly 0), but the special ability needs to be upgraded exactly twice. In how many ways can these abilities be upgraded?

In how many ways can $8$ people be divided into pairs?

Let $n$ be a given positive integer. Find the smallest positive integer $k$ for which the following statement is true: for any given simple connected graph $G$ and minimal cuts $V_1, V_2,\ldots, V_n$, at most $k$ vertices can be chosen with the property that picking any two of the chosen vertices there exists an integer $1\le i\le n$ such that $V_i$ separates the two vertices. A partition of the vertices of $G$ into two disjoint non-empty sets is called a [i]minimal cut[/i] if the number of edges crossing the partition is minimal. [i]Proposed by András Imolay, Budapest[/i]

From an $n \times n $ square, $n \ge 2,$ the unit squares situated on both odd numbered rows and odd numbers columns are removed. Determine the minimum number of rectangular tiles needed to cover the remaining surface.

There are $1999$ balls in a row, some are red and some are blue (it could be all red or all blue). Under every ball we write a number equal to the sum of the amount of red balls in the right of this ball plus the sum of the amount of the blue balls that are in the left of this ball. In the sequence of numbers that we get with this balls we have exactly three numbers that appears an odd number of times, which numbers could these three be?

[b]p1.[/b] What is the smallest possible value for the product of two real numbers that differ by ten? [b]p2.[/b] Determine the number of positive integers $n$ with $1 \le n \le 400$ that satisfy the following: $\bullet$ $n$ is a square number. $\bullet$ $n$ is one more than a multiple of $5$. $\bullet$ $n$ is even. [b]p3.[/b] How many positive integers less than $2019$ are either a perfect cube or a perfect square but not both? [b]p4.[/b] Felicia draws the heart-shaped figure $GOAT$ that is made of two semicircles of equal area and an equilateral triangle, as shown below. If $GO = 2$, what is the area of the figure? [img]https://cdn.artofproblemsolving.com/attachments/3/c/388daa657351100f408ab3f1185f9ab32fcca5.png[/img] [b]p5.[/b] For distinct digits $A, B$, and $ C$: $$\begin{tabular}{cccc} & A & A \\ & B & B \\ + & C & C \\ \hline A & B & C \\ \end{tabular}$$ Compute $A \cdot B \cdot C$. [b]p6 [/b] What is the difference between the largest and smallest value for $lcm(a,b,c)$, where $a,b$, and $c$ are distinct positive integers between $1$ and $10$, inclusive? [b]p7.[/b] Let $A$ and $B$ be points on the circumference of a circle with center $O$ such that $\angle AOB = 100^o$. If $X$ is the midpoint of minor arc $AB$ and $Y$ is on the circumference of the circle such that $XY\perp AO$, find the measure of $\angle OBY$ . [b]p8. [/b]When Ben works at twice his normal rate and Sammy works at his normal rate, they can finish a project together in $6$ hours. When Ben works at his normal rate and Sammy works as three times his normal rate, they can finish the same project together in $4$ hours. How many hours does it take Ben and Sammy to finish that project if they each work together at their normal rates? [b][b]p9.[/b][/b] How many positive integer divisors $n$ of $20000$ are there such that when $20000$ is divided by $n$, the quotient is divisible by a square number greater than $ 1$? [b]p10.[/b] What’s the maximum number of Friday the $13$th’s that can occur in a year? [b]p11.[/b] Let circle $\omega$ pass through points $B$ and $C$ of triangle $ABC$. Suppose $\omega$ intersects segment $AB$ at a point $D \ne B$ and intersects segment $AC$ at a point $E \ne C$. If $AD = DC = 12$, $DB = 3$, and $EC = 8$, determine the length of $EB$. [b]p12.[/b] Let $a,b$ be integers that satisfy the equation $2a^2 - b^2 + ab = 18$. Find the ordered pair $(a,b)$. [b]p13.[/b] Let $a,b,c$ be nonzero complex numbers such that $a -\frac{1}{b}= 8, b -\frac{1}{c}= 10, c -\frac{1}{a}= 12.$ Find $abc -\frac{1}{abc}$ . [b]p14.[/b] Let $\vartriangle ABC$ be an equilateral triangle of side length $1$. Let $\omega_0$ be the incircle of $\vartriangle ABC$, and for $n > 0$, define the infinite progression of circles $\omega_n$ as follows: $\bullet$ $\omega_n$ is tangent to $AB$ and $AC$ and externally tangent to $\omega_{n-1}$. $\bullet$ The area of $\omega_n$ is strictly less than the area of $\omega_{n-1}$. Determine the total area enclosed by all $\omega_i$ for $i \ge 0$. [b]p15.[/b] Determine the remainder when $13^{2020} +11^{2020}$ is divided by $144$. [b]p16.[/b] Let $x$ be a solution to $x +\frac{1}{x}= 1$. Compute $x^{2019} +\frac{1}{x^{2019}}$ . [b]p17. [/b]The positive integers are colored black and white such that if $n$ is one color, then $2n$ is the other color. If all of the odd numbers are colored black, then how many numbers between $100$ and $200$ inclusive are colored white? [b]p18.[/b] What is the expected number of rolls it will take to get all six values of a six-sided die face-up at least once? [b]p19.[/b] Let $\vartriangle ABC$ have side lengths $AB = 19$, $BC = 2019$, and $AC = 2020$. Let $D,E$ be the feet of the angle bisectors drawn from $A$ and $B$, and let $X,Y$ to be the feet of the altitudes from $C$ to $AD$ and $C$ to $BE$, respectively. Determine the length of $XY$ . [b]p20.[/b] Suppose I have $5$ unit cubes of cheese that I want to divide evenly amongst $3$ hungry mice. I can cut the cheese into smaller blocks, but cannot combine blocks into a bigger block. Over all possible choices of cuts in the cheese, what’s the largest possible volume of the smallest block of cheese? PS. You had better use hide for answers.

Three grasshoppers are on a straight line. Every second one grasshopper jumps. It jumps across one (but not across two) of the other grasshoppers . Prove that after $1985$ seconds the grasshoppers cannot be in the initial position . (Leningrad Mathematical Olympiad 1985)

Write the natural numbers from left to right in ascending order. Every minute, we perform an operation. After $m$ minutes, we divide the entire available series into consecutive blocks of $m$ numbers. We leave the first block unchanged and in each of the other blocks we move all the numbers except the first one one place to the left, and move the first one to the end of the block. Prove that throughout the process, each natural number will only move a finite number of times.

Some of the vertices of a convex $n$-gon are connected by segments, such that any two of them have no common interior point. Prove that, for any $n$ points in general position, there exists a one-to-one correspondence between the points and the vertices of the $n$ gon, such that any two segments between the points, corresponding to the respective segments from the $n$ gon, have no common interior point.

$7$ pupils has been given $20$ candies, $5$ candies of $4$ different kinds, so that each pupil has no more then one candy of each kind. Prove that there are two pupils that have three or more pairs of candies of the same kind.

In the Cartesian coordinate system, we define a [i]Bongo-line[/i] as a sequence of integer points $\alpha = (\ldots, A_{-1}, A_0, A_1, \ldots)$ such that: - $A_iA_{i+1} = \sqrt{2}$ for every $i \in \mathbb{Z}$; - the polyline $\ldots A_{-1}A_0A_1 \ldots$ has no self-intersections. Let $\alpha = (\ldots, A_{-1}, A_0, A_1, \ldots)$ and $\beta = (\ldots, B_{-1}, B_0, B_1, \ldots)$ be two Bongo-lines such that there exists a bijection $f : \mathbb{Z} \to \mathbb{Z}$ such that $A_iA_{i+1}$ and $B_{f(i)}B_{f(i)+1}$ halve each other. Prove that all vertices of $\alpha$ and $\beta$ lie on two lines. [i]Proposed by Pavle Martinović[/i]

p1. Let $AB$ be the diameter of the circle and $P$ is a point outside the circle. The lines $PQ$ and $PR$ are tangent to the circles at points $Q$ and $R$. The lines $PH$ is perpendicular on line $AB$ at $H$ . Line $PH$ intersects $AR$ at $S$. If $\angle QPH =40^o$ and $\angle QSA =30^o$, find $\angle RPS$. p2. There is a meeting consisting of $40$ seats attended by $16$ invited guests. If each invited guest must be limited to at least $ 1$ chair, then determine the number of arrangements. p3. In the crossword puzzle, in the following crossword puzzle, each box can only be filled with numbers from $ 1$ to $9$. [img]https://cdn.artofproblemsolving.com/attachments/2/e/224b79c25305e8ed9a8a4da51059f961b9fbf8.png[/img] Across: 1. Composite factor of $1001$ 3. Non-polyndromic numbers 5. $p\times q^3$, with $p\ne q$ and $p,q$ primes Down: 1. $a-1$ and $b+1$ , $a\ne b$ and $p,q$ primes 2. multiple of $9$ 4. $p^3 \times q$, with $p\ne q$ and $p,q$ primes p4. Given a function $f:R \to R$ and a function $g:R \to R$, so that it fulfills the following figure: [img]https://cdn.artofproblemsolving.com/attachments/b/9/fb8e4e08861a3572412ae958828dce1c1e137a.png[/img] Find the number of values ​​of $x$, such that $(f(x))^2-2g(x)-x \in\{-10,-9,-8,…,9,10\}$. p5. In a garden that is rectangular in shape, there is a watchtower in each corner and in the garden there is a monitoring tower. Small areas will be made in the shape of a triangle so that the corner points are towers (free of monitoring and/or supervisory towers). Let $k(m,n)$ be the number of small areas created if there are $m$ control towers and $n$ monitoring towers. a. Find the values ​​of $k(4,1)$, $k(4,2)$, $k(4,3)$, and $k(4,4)$ b. Find the general formula $k(m,n)$ with $m$ and $n$ natural numbers .