In Sikinia we only pay with coins that have a value of either $11$ or $12$ Kulotnik. In a burglary in one of Sikinia's banks, $11$ bandits cracked the safe and could get away with $5940$ Kulotnik. They tried to split up the money equally - so that everyone gets the same amount - but it just doesn't worked. After a while their leader claimed that it actually isn't possible. Prove that they didn't get any coin with the value $12$ Kulotnik.

A [i]word[/i] is a string of the symbols $a, b$ which can be formed by repeated application of the following: (1) $ab$ is a word; (2) if $X$ and $Y$ are words, then so is $XY$; (3) if $X$ is a word, then so is $aXb$. How many words have $12$ letters?

Let $P_1,P_2,\dots,P_n$ be $n$ distinct points over a line in the plane ($n\geq2$). Consider all the circumferences with diameters $P_iP_j$ ($1\leq{i,j}\leq{n}$) and they are painted with $k$ given colors. Lets call this configuration a ($n,k$)-cloud. For each positive integer $k$, find all the positive integers $n$ such that every possible ($n,k$)-cloud has two mutually exterior tangent circumferences of the same color.

$8$ people participate in a party. (1) Among any $5$ people there are $3$ who pairwise know each other. Prove that there are $4$ people who paiwise know each other. (2) If Among any $6$ people there are $3$ who pairwise know each other, then can we find $4$ people who pairwise know each other?

The numbers of the set $\{1,2,\ldots,n\}$ are colored with $6$ colors. Let $$S:=\{(x,y,z)\in\{1,2,\ldots,n\}^3:x+y+z\equiv0\pmod n\text{ and }x,y,z\text{ have the same color}\}$$and $$D:=\{(x,y,z)\in\{1,2,\ldots,n\}^3:x+y+z\equiv0\pmod n\text{ and }x,y,z\text{ have three different colors}\}.$$Prove that $$|D|\le2|S|+\frac{n^2}2.$$

Given a $2015$-tuple $(a_1,a_2,\ldots,a_{2015})$ in each step we choose two indices $1\le k,l\le 2015$ with $a_k$ even and transform the $2015$-tuple into $(a_1,\ldots,\dfrac{a_k}{2},\ldots,a_l+\dfrac{a_k}{2},\ldots,a_{2015})$. Prove that starting from $(1,2,\ldots,2015)$ in finite number of steps one can reach any permutation of $(1,2,\ldots,2015)$.

$n$ people sit in a circle. Each of them is either a liar (always lies) or a truthteller (always tells the truth). Every person knows exactly who speaks the truth and who lies. In their turn, each person says 'the person two seats to my left is a truthteller'. It is known that there's at least one liar and at least one truthteller in the circle. [list=a] [*] Is it possible that $n=2017?$ [*] Is it possible that $n=5778?$ [/list]

(a) On each of the $1 \times 1$ squares of the top row of an $8 \times 8$ chessboard there is a black pawn, and on each of the $1 \times 1$ squares of the bottom row of this chessboard there is a white pawn. On each move one can shift any pawn vertically or horizontally to any adjacent empty $1 \times 1$ square. What is the smallest number of moves that are needed to move all white pawns to the top row and all black pawns to the bottom one? (b) The same question for a $7 \times 7$ board. (A Shapovalov_

Simon plays a game on an $n\times n$ grid of cells. Initially, each cell is filled with an integer. Every minute, Simon picks a cell satisfying the following: [list] [*] The magnitude of the integer in the chosen cell is less than $n^{n^n}$ [*] The sum of all the integers in the neighboring cells (sharing one side with the chosen cell) is non-zero [/list] Simon then adds each integer in a neighboring cell to the chosen cell. Show that Simon will eventually not be able to make any valid moves.

Attached below:

What minimal number of numbers from the set $\{1,2,...,1982\}$ should be deleted to provide the property: [i]none of the remained numbers equals to the product of two other remained numbers[/i]?

Two numbers are written on each vertex of a convex $100$-gon. Prove that it is possible to remove a number from each vertex so that the remaining numbers on any two adjacent vertices are different. [i]F. Petrov [/i]

There are $N{}$ friends and a round pizza. It is allowed to make no more than $100{}$ straight cuts without shifting the slices until all cuts are done; then the resulting slices are distributed among all the friends so that each of them gets a share off pizza having the same total area. Is there a cutting which gives the above result if a) $N=201$ and b) $N=400$?

There are $ n \geq 3$ job openings at a factory, ranked $1$ to $ n$ in order of increasing pay. There are $ n$ job applicants, ranked from $1$ to $ n$ in order of increasing ability. Applicant $ i$ is qualified for job $ j$ if and only if $ i \geq j.$ The applicants arrive one at a time in random order. Each in turn is hired to the highest-ranking job for which he or she is qualified AND which is lower in rank than any job already filled. (Under these rules, job $1$ is always filled, and hiring terminates thereafter.) Show that applicants $ n$ and $ n \minus{} 1$ have the same probability of being hired.

In how many ways can $n^2$ distinct real numbers be arranged into an $n\times n$ array $(a_{ij })$ such that max$_{j}$ min $_i \,\, a_{ij} $= min$_i$ max$_j \,\, a_{ij}$?

In the beginning, number $1$ has been written to point $(0,0)$ and $0$ has been written to any other point of integral coordinates. After every second, all numbers are replaced with the sum of the numbers in four neighbouring points at the previous second. Find the sum of numbers in all points of integral coordinates after $n$ seconds.

a.) Prove that for $n = 4$ or $n \geq 6$ each triangle $ABC$ can be decomposed in $n$ similar (not necessarily congruent) triangles. b.) Show: An equilateral triangle can neither be composed in 3 nor 5 triangles. c.) Is there a triangle $ABC$ which can be decomposed in 3 and 5 triangles, analogously to a.). Either give an example or prove that there is not such a triangle.

Let us call the [i]distance [/i] between the numbers $\overline{a_1a_2a_3a_4a_5}$ and $\overline{b_1b_2b_3b_4b_5}$ the maximum $i$ for which $a_i \ne b_i$. All five-digit numbers are written out one after another in some order. What is the minimum possible sum of distances between adjacent numbers?

Punches in the buses of a certain bus company always cut exactly six holes into the ticket. The possible locations of the holes form a $3 \times 3$ table as shown in the figure. Mr. Freerider wants to put together a collection of tickets such that, for any combination of punch holes, he would have a ticket with the same combination in his collection. The ticket can be viewed both from the front and from the back. Find the smallest number of tickets in such a collection. [img]https://cdn.artofproblemsolving.com/attachments/b/b/de5f09317a9a109fbecccecdc033de18217806.png[/img]

Kelvin the Frog is hopping on a number line (extending to infinity in both directions). Kelvin starts at $0$. Every minute, he has a $\frac{1}{3}$ chance of moving $1$ unit left, a $\frac{1}{3}$ chance of moving $1$ unit right, and $\frac{1}{3}$ chance of getting eaten. Find the expected number of times Kelvin returns to $0$ (not including the start) before he gets eaten.

In how many different ways can three knights be placed on a chessboard so that the number of squares attacked would be maximal?

There is an $n \times n$ grid which has rows and columns numbered from $1$ to $n$; the cell at row $i$ and column $j$ is denoted as the cell at $(i, j)$. A subset $A$ of the cells is called [i]good[/i] if for any two cells at $(x_1, y), (x_2, y)$ in $A$, the cells $(u, v)$ satisfying $x_1 < u \leq x_2, v<y$ or $x_1 \leq u < x_2, v>y$ are not in $A$. Determine the minimal number of good sets such that they are pairwise disjoint and every cell of the board belongs to exactly one good set.

Each of $4$ stones weights the integer number of grams. A balance with arrow indicates the difference of weights on the left and the right sides of it. Is it possible to determine the weights of all stones in $4$ weighings, if the balance can make a mistake in $1$ gram in at most one weighing?

[b]p1.[/b] In the group of five people any subgroup of three persons contains at least two friends. Is it possible to divide these five people into two subgroups such that all members of any subgroup are friends? [b]p2.[/b] Coefficients $a,b,c$ in expression $ax^2+bx+c$ are such that $b-c>a$ and $a \ne 0$. Is it true that equation $ax^2+bx+c=0$ always has two distinct real roots? [b]p3.[/b] Point $D$ is a midpoint of the median $AF$ of triangle $ABC$. Line $CD$ intersects $AB$ at point $E$. Distances $|BD|=|BF|$. Show that $|AE|=|DE|$. [b]p4.[/b] Real numbers $a,b$ satisfy inequality $a+b^5>ab^5+1$. Show that $a+b^7>ba^7+1$. [b]p5.[/b] A positive number was rounded up to the integer and got the number that is bigger than the original one by $28\%$. Find the original number (find all solutions). [b]p6.[/b] Divide a $5\times 5$ square along the sides of the cells into $8$ parts in such a way that all parts are different. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are scales and $(n+1)$ weights with the total weight $2n$. Each weight is an integer. We put all the weights in turn on the lighter side of the scales, starting from the heaviest one, and if the scales is in equilibrium -- on the left side. Prove that when all the weights will be put on the scales, they will be in equilibrium.