Give and Take divide $100$ coins between themselves as follows. In each step, Give chooses a handful of coins from the heap, and Take decides who gets this handful. This is repeated until all coins have been taken, or one of them has $9$ handfuls. In the latter case, the other gets all the remaining coins. What is the largest number of coins that Give can be sure of getting no matter what Take does? (A Shapovalov)

Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

A website offers for $1000$ colones, the possibility of playing $4$ shifts a certain game of randomly, in each turn the user will have the same probability $p$ of winning the game and obtaining $1000$ colones (per shift). But to calculate $p$ he asks you to roll $3$ dice and add the results, with what p will be the probability of obtaining this sum. Olcoman visits the website, and upon rolling the dice, he realizes that the probability of losing his money is from $\left( \frac{103}{108}\right)^4$. a) Determine the probability $p$ that Olcoman wins a game and the possible outcomes with the dice, to get to this one. b) Which sums (with the dice) give the maximum probability of having a profit of exactly $1000$ colones? Calculate this probability and the value of $p$ for this case.

Consider a graph with $n$ vertices and $\frac{7n}{4}$ edges. (a) Prove that there are two cycles of equal length. (25 points) (b) Can you give a smaller function than $\frac{7n}{4}$ that still fits in part (a)? Prove your claim. We say function $a(n)$ is smaller than $b(n)$ if there exists an $N$ such that for each $n>N$ ,$a(n)<b(n)$ (At most 5 points) [i]Proposed by Afrooz Jabal'ameli[/i]

Let $n$ be a positive integer. Morgane has coloured the integers $1,2,\ldots,n$. Each of them is coloured in exactly one colour. It turned out that for all positive integers $a$ and $b$ such that $a<b$ and $a+b \leqslant n$, at least two of the integers among $a$, $b$ and $a+b$ are of the same colour. Prove that there exists a colour that has been used for at least $2n/5$ integers. \\ \\ (Vincent Jugé)

The numbers $1, 2,\ldots, 2006$ are written around the circumference of a circle. A [i]move[/i] consists of exchanging two adjacent numbers. After a sequence of such moves, each number ends up $13$ positions to the right of its initial position. lf the numbers $1, 2,\ldots, 2006$ are partitioned into $1003$ distinct pairs, then show that in at least one of the moves, the two numbers of one of the pairs were exchanged.

In a class of $26$ students, everyone is being graded on five subjects with one of three possible marks. Prove that if $25$ of these students have received their marks, then we can grade the last one in such a way that their marks differ from these of any other student on at least two subjects.

Determine all integers $n\geq 1$ for which the numbers $1,2,\ldots,n$ may be (re)ordered as $a_1,a_2,\ldots,a_n$ in such a way that the average $\dfrac {a_1+a_2+\cdots + a_k} {k}$ is an integer for all values $1\leq k\leq n$. (Dan Schwarz)

A bar of chocolate is made of $10$ distinguishable triangles as shown below: [center][img]https://cdn.artofproblemsolving.com/attachments/3/d/f55b0af0ce320fbfcfdbfab6a5c9c9306bfd16.png[/img][/center] How many ways are there to divide the bar, along the edges of the triangles, into two or more contiguous pieces?

For a natural number $n \ge 3$ we denote by $M(n)$ the minimum number of unit squares that must be coloured in a $6 \times n$ rectangle so that any possible $2 \times 3$ rectangle (it can be rotated, but it must be contained inside and cannot be cut) contains at least one coloured unit square. Is it true that for every natural $n \ge 3$ the number $M(n)$ can be expressed as $M(n)=p_n+k_n^3$, where $p_n$ is a prime and $k_n$ is a natural number?

There are several rational numbers written on a board. If the numbers $x{}$ and $y{}$ are present on the board, we can add the number $(x+y)/(1-xy)$ to it. Prove that there is a rational number that cannot ever appear on the board.

There are four wise men in a row, each sees only those following him in the row, i.e. the $1$st sees the other three, the $2$nd sees the $3$rd and $4$th, and the $3$rd sees only the $4$th. The devil has $100$ hats, numbered from $1$ to $100$, he puts one hat on each wise man, and hides the extra $96$ hats. After that, each wise man (in turn: first the first, then the second, etc.) loudly calls a number, trying to guess the number of his hat. The numbers mentioned should not be repeated. When all the wise men have spoken, they take off their hats and check which one of them has guessed. Can the sages to act in such a way that at least three of them knowingly guessed?

The maze is an $8 \times 8 $square, each cell contains $1 \times 1$ which has one of four arrows drawn (up, down, right, left). The upper side of the upper right cell is the exit from the maze.In the lower left cell there is a chip that, with each move, moves one square in the direction indicated by the arrow. After each move, the shooter in the cell in which there was just a chip rotates $90^o$ clockwise. If a chip must move, taking it outside the $8 \times 8$ square, it remains in place, and the arrow also rotates $90^o$ clockwise. Prove that sooner or later, the chip will come out of the maze.

For $n\geq 2$ , an equilateral triangle is divided into $n^2$ congruent smaller equilateral triangles. Detemine all ways in which real numbers can be assigned to the $\frac{(n+1)(n+2)}{2}$ vertices so that three such numbers sum to zero whenever the three vertices form a triangle with edges parallel to the sides of the big triangle.

A teacher creates a fraction using numbers from $1$ to $12$ (including $12$). He writes some of the numbers on the numerator, and writes $\times$ (multiplication) between each number. Then he writes the rest of the numbers in the denominator and also writes $\times$ between each number. There is at least one number both in numerator and denominator. The teacher ensures that the fraction is equal to the smallest possible integer possible. What is this positive integer, which is also the value of the fraction?

Let $A$ be a non-empty set of integers with the following property: For each $a \in A$, there exist not necessarily distinct integers $b,c \in A$ so that $a=b+c$. (a) Proof that there are examples of sets $A$ fulfilling above property that do not contain $0$ as element. (b) Proof that there exist $a_1,\ldots,a_r \in A$ with $r \ge 1$ and $a_1+\cdots+a_r=0$. (c) Proof that there exist pairwise distinct $a_1,\ldots,a_r$ with $r \ge 1$ and $a_1+\cdots+a_r=0$.

The distance between Maykop and Belorechensk is $24$ km. Two of three friends need to reach Belorechensk from Maykop and another friend wants to reach Maykop from Belorechensk. They have only one bike, which is initially in Maykop. Each guy may go on foot (with velocity at most $6$ kmph) or on a bike (with velocity at most $18$ kmph). It is forbidden to leave a bike on a road. Prove that all of them may achieve their goals after $2$ hours $40$ minutes. (Only one guy may seat on the bike simultaneously). [i]Folclore[/i]

On an infinite grid, a square with four vertices lie at $(m, n)$, $(m-1, n)$, $(m,n-1)$, $(m-1, n-1)$ is denoted as cell $(m,n)$ $(m, n \in Z)$. Some marbles are dropped on some cell. Each cell may have more than one marble or have no marble at all. Consider a "move" can be conducted in one of two following ways: i) Remove one marble from cell $(m,n)$ (if there is marble at that cell), then add one marble to each of cell $(m - 1, n- 2)$ and cell $(m -2, n - 1)$. ii) Remove two marbles from cell $(m,n)$ (if there is marble at that cell), then add one marble to each of cell $(m +1, n - 2)$ and cell $(m - 2, n +1)$. Assume that initially, there are $n$ marbles at the cell $(1,n), (2,n - 1),..., (n, 1)$ (each cell contains one marble). Can we conduct an finite amount of moves such that both cells $(n + 1, n)$ and $(n, n + 1)$ have marbles?

For a class of $20$ students several field trips were arranged. In each trip at least one student participated. Prove that there was a field trip such that each student who participated in it took part in at least $1/20$-th of all field trips.

[b]p1.[/b] Suppose that $20\%$ of a number is $17$. Find $20\%$ of $17\%$ of the number. [b]p2.[/b] Let $A, B, C, D$ represent the numbers $1$ through $4$ in some order, with $A \ne 1$. Find the maximum possible value of $\frac{\log_A B}{C +D}$. Here, $\log_A B$ is the unique real number $X$ such that $A^X = B$. [b]p3. [/b]There are six points in a plane, no four of which are collinear. A line is formed connecting every pair of points. Find the smallest possible number of distinct lines formed. [b]p4.[/b] Let $a,b,c$ be real numbers which satisfy $$\frac{2017}{a}= a(b +c), \frac{2017}{b}= b(a +c), \frac{2017}{c}= c(a +b).$$ Find the sum of all possible values of $abc$. [b]p5.[/b] Let $a$ and $b$ be complex numbers such that $ab + a +b = (a +b +1)(a +b +3)$. Find all possible values of $\frac{a+1}{b+1}$. [b]p6.[/b] Let $\vartriangle ABC$ be a triangle. Let $X,Y,Z$ be points on lines $BC$, $CA$, and $AB$, respectively, such that $X$ lies on segment $BC$, $B$ lies on segment $AY$ , and $C$ lies on segment $AZ$. Suppose that the circumcircle of $\vartriangle XYZ$ is tangent to lines $AB$, $BC$, and $CA$ with center $I_A$. If $AB = 20$ and $I_AC = AC = 17$ then compute the length of segment $BC$. [b]p7. [/b]An ant makes $4034$ moves on a coordinate plane, beginning at the point $(0, 0)$ and ending at $(2017, 2017)$. Each move consists of moving one unit in a direction parallel to one of the axes. Suppose that the ant stays within the region $|x - y| \le 2$. Let N be the number of paths the ant can take. Find the remainder when $N$ is divided by $1000$. [b]p8.[/b] A $10$ digit positive integer $\overline{a_9a_8a_7...a_1a_0}$ with $a_9$ nonzero is called [i]deceptive [/i] if there exist distinct indices $i > j$ such that $\overline{a_i a_j} = 37$. Find the number of deceptive positive integers. [b]p9.[/b] A circle passing through the points $(2, 0)$ and $(1, 7)$ is tangent to the $y$-axis at $(0, r )$. Find all possible values of $ r$. [b]p10.[/b] An ellipse with major and minor axes $20$ and $17$, respectively, is inscribed in a square whose diagonals coincide with the axes of the ellipse. Find the area of the square. PS. You had better use hide for answers.

In the Republic of Unistan there are $n$ national roads, each of them links two cities exactly. You can travel from one city to another of your choice using a sequence of roads. The President of Unistan ordered to label the national roads with the integers from $1$ to $n$ by an old law: if a city is adjacent to more than one road, the greatest common divisor of the numbers of that roads must be one. Show that you can label the national roads without breaking the law.

Does there exist a row of Pascal’s Triangle containing four distinct values $a,b,c$ and $d$ such that $b = 2a$ and $d = 2c$? Recall that Pascal’s triangle is the pattern of numbers that begins as follows [img]https://cdn.artofproblemsolving.com/attachments/2/1/050e56f0f1f1b2a9c78481f03acd65de50c45b.png[/img] where the elements of each row are the sums of pairs of adjacent elements of the prior row. For example, $10 =4+6$. Also note that the last row displayed above contains the four elements $a = 5,b = 10,d = 10,c = 5$, satisfying $b = 2a$ and $d = 2c$, but these four values are NOT distinct.

Let $\sigma_n$ be a permutation of $\{1,\ldots,n\}$; that is, $\sigma_n(i)$ is a bijective function from $\{1,\ldots,n\}$ to itself. Define $f(\sigma)$ to be the number of times we need to apply $\sigma$ to the identity in order to get the identity back. For example, $f$ of the identity is just $1$, and all other permutations have $f(\sigma)>1$. What is the smallest $n$ such that there exists a $\sigma_n$ with $f(\sigma_n)=k$?

Let $n \ge 2$ be a positive integer. For every number from $1$ to $n$, there is a card with this number and which is either black or white. A magician can repeatedly perform the following move: For any two tiles with different number and different colour, he can replace the card with the smaller number by one identical to the other card. For instance, when $n=5$ and the initial configuration is $(1B, 2B, 3W, 4B,5B)$, the magician can choose $1B, 3W$ on the first move to obtain $(3W, 2B, 3W, 4B, 5B)$ and then $3W, 4B$ on the second move to obtain $(4B, 2B, 3W, 4B, 5B)$. Determine in terms of $n$ all possible lengths of sequences of moves from any possible initial configuration to any configuration in which no more move is possible.

Given 2015 balls. Astri and Budi will play a game. At first, Astri will choose two different numbers $a$ and $b$ from the set $S = \{ 1, 2, 3, \dots, 30 \}$. Budi will then choose another 2 different numbers $c$ and $d$ from the remaining 28 numbers in set $S$. By taking turns, starting from Astri, they take balls with the following rules: (1) Astri could only take $a$ or $b$ balls. (2) Budi could only take $c$ or $d$ balls. until someone couldn't take any balls satisfying the condition given (and that person will lose). Prove that Budi could choose $c,d$ such that he has a strategy to ensure his victory on this game.