(Game) Károly and Dezso wish to count up to $m$ and play the following game in the meantime: they start from $0$ and the two players can add a positive number less than $13$ to the previous number, taking turns. However because of their superstition, if one of them added $x$, then the other one in the next step cannot add $13-x$. Whoever reaches (or surpasses) $m$ first, loses. [i]Defeat the organisers in this game twice in a row! A starting position will be given and then you can decide whether you want to go first or second.[/i]

Billy the baker makes a bunch of loaves of bread every day, and sells them in bundles of size $1, 2$, or $3$. On one particular day, there are $375$ orders, $125$ for each bundle type. As such, Billy goes ahead and makes just enough loaves of bread to meet all the orders. Whenever Billy makes loaves, some get burned, and are not sellable. For nonnegative i less than or equal to the total number of loaves, the probability that exactly i loaves are sellable to customers is inversely proportional to $2^i$ (otherwise, it’s $0$). Once he makes the loaves, he distributes out all of the sellable loaves of bread to some subset of these customers (each of whom will only accept their desired bundle of bread), without worrying about the order in which he gives them out. If the expected number of ways Billy can distribute the bread is of the form $\frac{a^b}{2^c-1}$, find $a + b + c$.

The three-element subsets of a seven-element set are colored. If the intersection of two sets is empty then they have different colors. What is the minimum number of colors needed?

[b]T[/b]wo ordered pairs $(a,b)$ and $(c,d)$, where $a,b,c,d$ are real numbers, form a basis of the coordinate plane if $ad \neq bc$. Determine the number of ordered quadruples $(a,b,c)$ of integers between $1$ and $3$ inclusive for which $(a,b)$ and $(c,d)$ form a basis for the coordinate plane.

Two squares on an $8\times 8$ chessboard are called adjacent if they have a common edge or common corner. Is it possible for a king to begin in some square and visit all squares exactly once in such a way that all moves except the first are made into squares adjacent to an even number of squares already visited?

A wedding is going to be held in a city with $25$ types of meals, to which some of the $2017$ citizens will be invited. All of the citizens like some meals and each meal is liked by at least one person. A "$suitable$ $list$" is a set of citizens, such that each meal is liked by at least one person in the set. A "$kamber$ $group$" is a set that contains at least one person from each "$suitable$ $list$". Given a "$kamber$ $group$", which has no subset (other than itself) that is also a "$kamber$ $group$", prove that there exists a meal, which is liked by everyone in the group.

Two distinct real numbers are written on each vertex of a convex $2012-$gon. Show that we can remove a number from each vertex such that the remaining numbers on any two adjacent vertices are different.

There is a grid of equilateral triangles with a distance 1 between any two neighboring grid points. An equilateral triangle with side length $n$ lies on the grid so that all of its vertices are grid points, and all of its sides match the grid. Now, let us decompose this equilateral triangle into $n^2$ smaller triangles (not necessarily equilateral triangles) so that the vertices of all these smaller triangles are all grid points, and all these small triangles have equal areas. Prove that there are at least $n$ equilateral triangles among these smaller triangles.

Adamand Topher are playing a game in which each of them starts with $2$ pickles. Each turn, they flip a fair coin: if it lands heads, Topher takes $1$ pickle from Adam; if it lands tails, Adam takes $2$ pickles from Topher. (If Topher has only $1$ pickle left, Adam will just take it.) What’s the probability that Topher will have all $4$ pickles before Adam does?

Given a positive integer $n$, an allowed move is to form $2n+1$ or $3n+2$. The set $S_{n}$ is the set of all numbers that can be obtained by a sequence of allowed moves starting with $n$. For example, we can form $5 \rightarrow 11 \rightarrow 35$ so $5, 11$ and $35$ belong to $S_{5}$. We call $m$ and $n$ compatible if $S_{m}$ and $S_{n}$ has a common element. Which members of $\{1, 2, 3, ... , 2002\}$ are compatible with $2003$?

A point $(x,y)$ is a [i]lattice point[/i] if $x,y\in\Bbb Z$. Let $E=\{(x,y):x,y\in\Bbb Z\}$. In the coordinate plane, $P$ and $Q$ are both sets of points in and on the boundary of a convex polygon with vertices on lattice points. Let $T=P\cap Q$. Prove that if $T\ne\emptyset$ and $T\cap E=\emptyset$, then $T$ is a non-degenerate convex quadrilateral region.

Consider the square grid with $A=(0,0)$ and $C=(n,n)$ at its diagonal ends. Paths from $A$ to $C$ are composed of moves one unit to the right or one unit up. Let $C_n$ (n-th catalan number) be the number of paths from $A$ to $C$ which stay on or below the diagonal $AC$. Show that the number of paths from $A$ to $C$ which cross $AC$ from below at most twice is equal to $C_{n+2}-2C_{n+1}+C_n$

How many ordered triplets $(a, b, c)$ of positive integers such that $30a + 50b + 70c \leq 343$.

A version of billiards is played on a right triangular table, with a pocket in each of the three corners, and one of the acute angles being $30^o$. A ball is played from just in front of the pocket at the $30^o$. vertex toward the midpoint of the opposite side. Prove that if the ball is played hard enough, it will land in the pocket of the $60^o$ vertex after $8$ reflections.

Three players $A,B$ and $C$ play a game with three cards and on each of these $3$ cards it is written a positive integer, all $3$ numbers are different. A game consists of shuffling the cards, giving each player a card and each player is attributed a number of points equal to the number written on the card and then they give the cards back. After a number $(\geq 2)$ of games we find out that A has $20$ points, $B$ has $10$ points and $C$ has $9$ points. We also know that in the last game B had the card with the biggest number. Who had in the first game the card with the second value (this means the middle card concerning its value).

It is allowed to perform the following transformations in the plane with any integers $a$: (1) Transform every point $(x, y)$ to the corresponding point $(x + ay, y)$, (2) Transform every point $(x, y)$ to the corresponding point $(x, y + ax)$. Does there exist a non-square rhombus whose all vertices have integer coordinates and which can be transformed to: a) Vertices of a square, b) Vertices of a rectangle with unequal side lengths?

We visit all squares exactly once on a $n\times n$ chessboard (colored in the usual way) with a king. Find the smallest number of times we had to switch colors during our walk. [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

Konstantin has a pile of $100$ pebbles. In each move, he chooses a pile and splits it into two smaller ones until he gets $100 $ piles each with a single pebble. (a) Prove that at some point, there are $30$ piles containing a total of exactly $60$ pebbles. (b) Prove that at some point, there are $20$ piles containing a total of exactly $60$ pebbles. (c) Prove that Konstantin may proceed in such a way that at no point, there are $19$ piles containing a total of exactly $60$ pebbles.

Call a set $S \subseteq \{0,1,\dots,14\}$ $\textit{sparse}$ if $x+1 \pmod{15}$ is not in $S$ whenever $x \in S$. Find the number of sparse sets $T$ such that the sum of the elements of $T$ is a multiple of 15.

Anna and Basilis play a game writing numbers on a board as follows: The two players play in turns and if in the board is written the positive integer $n$, the player whose turn is chooses a prime divisor $p$ of $n$ and writes the numbers $n+p$. In the board, is written at the start number $2$ and Anna plays first. The game is won by whom who shall be first able to write a number bigger or equal to $31$. Find who player has a winning strategy, that is who may writing the appropriate numbers may win the game no matter how the other player plays.

For a permutation $\pi$ of the set $A = \{1, 2, \ldots, 2025\}$, define its [i]colorfulness [/i]as the greatest natural number $k$ such that: - For all $1 \le i, j \le 2025$, $i \ne j$, if $|i - j| < k$, then $|\pi(i) - \pi(j)| \ge k$. What is the maximum possible colorfulness of a permutation of the set $A$? Determine how many such permutations have maximal colorfulness. [i]Proposed by Pavle Martinović[/i]

Somebody wrote $1953$ digits on a circle. The $1953$-digit number obtained by reading these figures clockwise, beginning at a certain point, is divisible by $27$. Prove that if one begins reading the figures at any other place, one gets another $1953$-digit number also divisible by $27$.

Decide whether any rectangle that can be covered by 25 circles of radius 2 can also be covered by 100 circles of radius 1.

There are $9999$ rods with lengths $1, 2, ..., 9998, 9999$. The players Anja and Bernd alternately remove one of the sticks, with Anja starting. The game ends when there are only three bars left. If from those three bars, a not degenerate triangle can be constructed then Anja wins, otherwise Bernd. Who has a winning strategy?

$\forall n \in \mathbb{N}$, $P(n)$ denotes the number of the partition of $n$ as the sum of positive integers (disregarding the order of the parts), e.g. since $4 = 1+1+1+1 = 1+1+2 = 1+3 = 2+2 = 4$, so $P(4)=5$. "Dispersion" of a partition denotes the number of different parts in that partitation. And denote $q(n)$ is the sum of all the dispersions, e.g. $q(4)=1+2+2+1+1=7$. $n \geq 1$. Prove that (1) $q(n) = 1 + \sum^{n-1}_{i=1} P(i).$ (2) $1 + \sum^{n-1}_{i=1} P(i) \leq \sqrt{2} \cdot n \cdot P(n)$.