Given a regular 103-sided polygon. 79 vertices are colored red and the remaining vertices are colored blue. Let $A$ be the number of pairs of adjacent red vertices and $B$ be the number of pairs of adjacent blue vertices. a) Find all possible values of pair $(A,B).$ b) Determine the number of pairwise non-similar colorings of the polygon satisfying $B=14.$ 2 colorings are called similar if they can be obtained from each other by rotating the circumcircle of the polygon.

In a bag there are $1007$ black and $1007$ white balls, which are randomly numbered $1$ to $2014$. In every step we draw one ball and put it on the table; also if we want to, we may choose two different colored balls from the table and put them in a different bag. If we do that we earn points equal to the absolute value of their differences. How many points can we guarantee to earn after $2014$ steps?

In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$. We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle. The following property is satisfied: "for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element" Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends. ([i]Serbia[/i])

The subsets $A_1,A_2,\ldots ,A_{2000}$ of a finite set $M$ satisfy $|A_i|>\frac{2}{3}|M|$ for each $i=1,2,\ldots ,2000$. Prove that there exists $m\in M$ which belongs to at least $1334$ of the subsets $A_i$.

An invisible tank is on a $100 \times 100 $ table. A cannon can fire at any $k$ cells of the board after that the tank will move to one of the adjacent cells (by side). Then the progress is repeated. Find the smallest value of $k$ such that the cannon can definitely shoot the tank after some time.

Let $B$ be a subset of $\mathbb{Z}_{3}^{n}$ with the property that for every two distinct members $(a_{1},\ldots,a_{n})$ and $(b_{1},\ldots,b_{n})$ of $B$ there exist $1\leq i\leq n$ such that $a_{i}\equiv{b_{i}+1}\pmod{3}$. Prove that $|B| \leq 2^{n}$.

Several farmers have 128 sheep. If one of them has at least half of all sheep, the rest conspire and dispossess him: everyone takes as many sheep as he already has : If two people have 64 sheep, then one of them is dispossessed. There were 7 dispossessions. Prove that all the sheep were gathered from one peasant.

Elmo is drawing with colored chalk on a sidewalk outside. He first marks a set $S$ of $n>1$ collinear points. Then, for every unordered pair of points $\{X,Y\}$ in $S$, Elmo draws the circle with diameter $XY$ so that each pair of circles which intersect at two distinct points are drawn in different colors. Count von Count then wishes to count the number of colors Elmo used. In terms of $n$, what is the minimum number of colors Elmo could have used? [i]Michael Ren[/i]

In the country of Drilandia, which has at least three cities, there are bidirectional roads connecting some pairs of cities such that any city can be reached from any other. Two cities are called [i]close[/i] if one can reach the other by using at most two intermediary cities. The mayor, Drilago, fortified the road system by building a direct road between each pair of close cities that were not already connected. Prove that after the expansion, there exists a journey that starts and ends at the same city, where each city except the first is visited exactly once, and the first city is visited twice (once at the beginning and once at the end).

Let $n$ be a natural number $n>3$. Show that in the multiples of $9$ less than $10^n$, exist more numbers with the sum of your digits equal to $9(n - 2)$ than numbers with the sum of your digits equal to $9(n - 1)$.

In space, there are \( 13 \) points, no four of which lie in the same plane. Three of the points are colored blue, and the triangle with these points as vertices will be called a [i]blue triangle[/i]. The remaining \( 10 \) points are colored red. We say that a triangle with three red vertices is [i]attached[/i] to the blue triangle if the boundary of the red triangle intersects the blue triangle (either in its interior or on its boundary) at exactly one point. Is it possible for the number of attached triangles to be \( 33 \)?

Edges of a complete graph with $2m$ vertices are properly colored with $2m-1$ colors. It turned out that for any two colors all the edges colored in one of these two colors can be described as union of several $4$-cycles. Prove that $m$ is a power of $2$.

In a coordinate plane, consider the set of points with integer cooedinates at least one of which is not divisible by $4$. Prove that these points cannot be partitioned into pairs such that the distance between points in each pair equals $1$. In other words, an infinite chessboard, whose cells with both coordinates divisible by $4$ are cut out, cannot be tiled by dominoes.

We will say that a natural number is [i]acceptable[/i] if it has at most $9$ distinct prime divisors. There is a stack of $100!=1\times2\times\cdots\times100$ stones. A [i]legal move[/i] consists in removing $k$ stones from the stack, where $k$ is an acceptable number. Two players, Lucas and Nicolas, take turns making legal moves; Lucas starts the game. The one who removes the last stone wins. Determine which of the players has a winning strategy and describe this strategy.

Let $m$ be a positive integer, and consider a $m\times m$ checkerboard consisting of unit squares. At the centre of some of these unit squares there is an ant. At time $0$, each ant starts moving with speed $1$ parallel to some edge of the checkerboard. When two ants moving in the opposite directions meet, they both turn $90^{\circ}$ clockwise and continue moving with speed $1$. When more than $2$ ants meet, or when two ants moving in perpendicular directions meet, the ants continue moving in the same direction as before they met. When an ant reaches one of the edges of the checkerboard, it falls off and will not re-appear. Considering all possible starting positions, determine the latest possible moment at which the last ant falls off the checkerboard, or prove that such a moment does not necessarily exist. [i]Proposed by Toomas Krips, Estonia[/i]

Alex Lishkov is trying to guess sequence of $2009$ random ternary digits ($0, 1$, or $2$). After he guesses each digit, he finds out whether he was right or not. If he guesses incorrectly, and $k$ was the correct answer, then an oracle tells him what the next $k$ digits will be. Being Bulgarian, Lishkov plays to maximize the expected number of digits guessed correctly. Let $P_n$ be the probability that Lishkov guesses the nth digit correctly. Find $P_{2009}$. Write your answer in the form $x + yRe(\rho^k)$, where $x$ and $y$ are rational, $\rho$ is complex, and $k$ is a positive integer

Does there exist a set $\mathcal{R}$ of positive rational numbers such that every positive rational number is the sum of the elements of a unique finite subset of $\mathcal{R}$? [i]Proposed by Tony Wang[/i]

A square is divided into 169 identical small squares and in every small square is written 0 or 1. It isn’t allowed in one row or column to have the following arrangements of adjacent digits in this order: 101, 111 or 1001. What is the the biggest possible number of 1’s in the table?

Let $n,k$ be positive integers so that $n \ge k$.Find the maximum number of binary sequances of length $n$ so that fixing any arbitary $k$ bits they do not produce all binary sequances of length $k$.For exmple if $k=1$ we can only have one sequance otherwise they will differ in at least one bit which means that bit produces all binary sequances of length $1$.

Let $S$ be a set of $N \ge 3$ points in the plane. Assume that no $3$ points in $S$ are collinear. The segments with both endpoints in $S$ are colored in two colors. Prove that there is a set of $N - 1$ segments of the same color which don't intersect except in their endpoints such that no subset of them forms a polygon with positive area.

Ninety-one students in a school are distributed in three classes. Each student took part in a competition. It is known that among any six students of the same sex some two got the same number of points. Show that here are four students of the same sex who are in the same class and who got the same number of points.

How many $4-$digit numbers $\overline{abcd}$ are there such that $a<b<c<d$ and $b-a<c-b<d-c$ ?

On a table lie 2022 matches and a regular dice that has the number $a$ on top. Now Max and Moritz play the following game: Alternately, they take away matches according to the following rule, where Max begins: The player to make a move rolls the dice over one of its edges and then takes a way as many matches as the top number shows. The player that cannot make legal move after some number of moves loses. For which $a$ can Moritz force Max to lose?

[b]carpeting[/b] suppose that $S$ is a figure in the plane such that it's border doesn't contain any lattice points. suppose that $x,y$ are two lattice points with the distance $1$ (we call a point lattice point if it's coordinates are integers). suppose that we can cover the plane with copies of $S$ such that $x,y$ always go on lattice points ( you can rotate or reverse copies of $S$). prove that the area of $S$ is equal to lattice points inside it. time allowed for this question was 1 hour.

In a village with at least one inhabitant, there are several associations. Each inhabitant is a member of at least $ k$ associations, and any two associations have at most one common member. Prove that at least $ k$ associations have the same number of members.