For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Consider an equilateral triangle with every side divided by $n$ points into $n+1$ equal parts. We put a marker on every of the $3n$ division points. We draw lines parallel to the sides of the triangle through the division points, and this way divide the triangle into $(n+1)^2$ smaller ones. Consider the following game: if there is a small triangle with exactly one vertex unoccupied, we put a marker on it and simultaneously take markers from the two its occupied vertices. We repeat this operation as long as it is possible. (a) If $n\equiv1\pmod3$, show that we cannot manage that only one marker remains. (b) If $n\equiv0$ or $n\equiv2\pmod3$, prove that we can finish the game leaving exactly one marker on the triangle.

Let $a, b, c$ be nonzero integers, with $1$ as their only positive common divisor, such that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 0$. Find the number of such triples $(a, b, c)$ with $50 \ge |a| \ge |b| \ge |c| 1$.

Given right hexagon. Each side is divided onto $1000$ equal segments. All the points of division are connected with the segments, parallel to sides. Let us paint in turn the triples of unpainted nodes of obtained net, if they are vertices of the unilateral triangle, doesn't matter of what size an orientation. Suppose, we have managed to paint all the vertices except one. Prove that the unpainted node is not a hexagon vertex.

A board $1$x$k$ is called [i]guayaco[/i] if: -Each unit square is painted with exactly one of $k$ available colors. -If $gcd(i,k)>1$, the $i$th unit square is painted with the same color as $(i-1)$th unit square. -If $gcd(i, k)=1$, the $i$th unit square is painted with the same color as $(k-i)$th unit square. Sebastian chooses a positive integer $a$ and calculates the number of boards $1$x$a$ that are guayacos. After that, David chooses a positive integer $b$ and calculates the number of boards $1$x$b$ that are guayacos. David wins if the number of boards $1$x$a$ that are guayacos is the same as the number of boards $1$x$b$ that are guayacos, otherwise, Sebastian wins. Find all the pairs $(a,b) $ such that, with those numbers, David wins.

Given a set $A=\{1;2;...;4044\}$. They color $2022$ numbers of them by white and the rest of them by black. With each $i\in A$, called the [b][i]important number[/i][/b] of $i$ be the number of all white numbers smaller than $i$ and black numbers larger than $i$. With every natural number $m$, find all positive integers $k$ that exist a way to color the numbers that can get $k$ important numbers equal to $m$.

Aunt Raya has $14$ wheels of cheese. She found out that out of any $6$ wheels, she could choose $4$ and put them on the scales so that the scales came into balance. Aunt Raya wants to give Daud Kazbekovich two of these $14$ wheels , and divide the rest equally (by weight) between Pavel and Kirill. Prove that she can make her wish come true.

In the Cartesian coordinate plane define the strips $ S_n \equal{} \{(x,y)|n\le x < n \plus{} 1\}$, $ n\in\mathbb{Z}$ and color each strip black or white. Prove that any rectangle which is not a square can be placed in the plane so that its vertices have the same color. [b]IMO Shortlist 2007 Problem C5 as it appears in the official booklet:[/b] In the Cartesian coordinate plane define the strips $ S_n \equal{} \{(x,y)|n\le x < n \plus{} 1\}$ for every integer $ n.$ Assume each strip $ S_n$ is colored either red or blue, and let $ a$ and $ b$ be two distinct positive integers. Prove that there exists a rectangle with side length $ a$ and $ b$ such that its vertices have the same color. ([i]Edited by Orlando Döhring[/i]) [i]Author: Radu Gologan and Dan Schwarz, Romania[/i]

A country contains $n$ cities and some towns. There is at most one road between each pair of towns and at most one road between each town and each city, but all the towns and cities are connected, directly or indirectly. We call a route between a city and a town a gold route if there is no other route between them which passes through fewer towns. Show that we can divide the towns and cities between $n$ republics, so that each belongs to just one republic, each republic has just one city, and each republic contains all the towns on at least one of the gold routes between each of its towns and its city.

Given an $m$-element set $M$ and a $k$-element subset $K \subset M$. We call a function $f: K \to M$ has "path", if there exists an element $x_0 \in K$ such that $f(x_0) = x_0$, or there exists a chain $x_0, x_1, \ldots, x_j = x_0 \in K$ such that $_xi = f(x_{i-1})$ for $i = 1, 2, \ldots, j$. Find the number of functions $f: K \to M$ which have path.

In a group of 12 persons, among any 9 there are 5 which know each other. Prove that there are 6 persons in this group which know each other

A table with 1000 cards on a line, numbered from 1 to 1000, is considered. The cards are ordered in the usual way. Now, we proceed in the following way. The first card (which is 1) is put just before the last card (between 999 and 1000) and, after, the new first card (which is 2) is put after the last card (which was 1000). Show that after 1000 movements, the cards are ordered again in the usual way. Show that the analogous result ($n$ movements for $n$ cards) does not hold when $n$ is odd.

We are given $64$ cubes, each with five white faces and one black face. One cube is placed on each square of a chessboard, with its edges parallel to the sides of the board. We are allowed to rotate a complete row of cubes about the axis of symmetry running through the cubes or to rotate a complete column of cubes about the axis of symmetry running through the cubes. Show that by a sequence of such rotations we can always arrange that each cube has its black face uppermost

A [i]site[/i] is any point $(x, y)$ in the plane such that $x$ and $y$ are both positive integers less than or equal to 20. Initially, each of the 400 sites is unoccupied. Amy and Ben take turns placing stones with Amy going first. On her turn, Amy places a new red stone on an unoccupied site such that the distance between any two sites occupied by red stones is not equal to $\sqrt{5}$. On his turn, Ben places a new blue stone on any unoccupied site. (A site occupied by a blue stone is allowed to be at any distance from any other occupied site.) They stop as soon as a player cannot place a stone. Find the greatest $K$ such that Amy can ensure that she places at least $K$ red stones, no matter how Ben places his blue stones. [i]Proposed by Gurgen Asatryan, Armenia[/i]

Martin invented the following algorithm. Let two irreducible fractions $ \frac{s_1}{t_1}$ and $ \frac{s_2}{t_2}$ be given as inputs, with the numerators and denominators being positive integers. Divide $ s_1$ and $ s_2$ by their greatest common divisor $ c$ and obtain $ a_1$ and $ a_2$, respectively. Similarily, divide $ t_1$ and $ t_2$ by their greatest common divisor $ d$ and obtain $ b_1$ and $ b_2$, respectively. After that, form a new fraction $ \frac{a_1b_2 \plus{} a_2b_1}{t_1b_2}$, reduce it, and multiply the numerator of the result by $ c$. Martin claims that this algorithm always finds the sum of the original fractions as an irreducible fraction. Is his claim correct?

Consider $n$ cards with marked numbers $1$ through $n$. No number have repeted, namely, each number has marked exactly at one card. They are distributed on $n$ boxes so that each box contains exactly one card initially. We want to move all the cards into one box all together according to the following instructions The instruction: Choose an integer $k(1\le k\le n)$, and move a card with number $k$ to the other box such that sum of the number of the card in that box is multiple of $k$. Find all positive integer $n$ so that there exists a way to gather all the cards in one box. Thanks to @scnwust for correcting wrong translation.

Let $G$ be a tournoment such that it's edges are colored either red or blue. Prove that there exists a vertex of $G$ like $v$ with the property that, for every other vertex $u$ there is a mono-color directed path from $v$ to $u$.

a) In how many ways can we read the word SARAJEVO from the table below, if it is allowed to jump from cell to an adjacent cell (by vertex or a side) cell? b) After the letter in one cell was deleted, only $525$ ways to read the word SARAJEVO remained. Find all possible positions of that cell.

For any polynomial $P(x)=a_0+a_1x+\ldots+a_kx^k$ with integer coefficients, the number of odd coefficients is denoted by $o(P)$. For $i-0,1,2,\ldots$ let $Q_i(x)=(1+x)^i$. Prove that if $i_1,i_2,\ldots,i_n$ are integers satisfying $0\le i_1<i_2<\ldots<i_n$, then: \[ o(Q_{i_{1}}+Q_{i_{2}}+\ldots+Q_{i_{n}})\ge o(Q_{i_{1}}). \]

Any two islands of the Chaos Archipelago are connected by a bridge - a red bridge or a blue bridge. Show that at least one of the following two assertions holds: $\mathcal{A}_{1}$: For any two islands $a$ and $b$, we can reach $b$ from $a$ through at most $3$ red bridges (and no blue bridges). $\mathcal{A}_{2}$: For any two islands $a$ and $b$, we can reach $b$ from $a$ through at most $2$ blue bridges (and no red bridges). [i]Alternative formulation:[/i] Let $G$ be a graph. Prove that the diameter of $G$ is $\leq 3$ or the diameter of the complement of $G$ is $\leq 2$. [i]Note.[/i] This problem is the main Theorem in Frank Harary, Robert W. Robinson, [i]The Diameter of a Graph and its Complement[/i], The American Mathematical Monthly, Vol. 92, No. 3. (Mar., 1985), pp. 211-212. darij

In a village (where only dwarfs live) there are $k$ streets, and there are $k(n-1)+1$ clubs each containing $n$ dwarfs. A dwarf can be in more than one clubs, and two dwarfs know each other if they live in the same street or they are in the same club (there is a club they are both in). Prove that is it possible to choose $n$ different dwarfs from $n$ different clubs (one dwarf from each club), such that the $n$ dwarfs know each other!

A convex $1993$-gon is divided into convex $7$-gons. Prove that there are $3$ neighbouring sides of the $1993$-gon belonging to one such $7$-gon. (A vertex of a $7$-gon may not be positioned on the interior of a side of the $1993$-gon, and two $7$-gons either have no common points, exactly one common vertex or a complete common side.) (A Kanel-Belov)

A candy store has $100$ pieces of candy to give away. When you get to the store, there are five people in front of you, numbered from $1$ to $5$. The $i$th person in line considers the set of positive integers congruent to $i$ modulo $5$ which are at most the number of pieces of candy remaining. If this set is empty, then they take no candy. Otherwise they pick an element of this set and take that many pieces of candy. For example, the first person in line will pick an integer from the set $\{1,6,\dots,96\}$ and take that many pieces of candy. How many ways can the first five people take their share of candy so that after they are done there are at least $35$ pieces of candy remaining?

Let $n$ and $k$ be arbitrary non-negative integers. Suppose we have drawn $2kn+1$ (different) diagonals of a convex $n$-gon. Show that there exists a broken line formed by $2k+1$ of these diagonals that passes through no point more than once. Prove also that this is not necessarily true when we draw only $kn$ diagonals.

Let $p\ge5$ be a prime and let $r$ be the number of ways of placing $p$ checkers on a $p\times p$ checkerboard so that not all checkers are in the same row (but they may all be in the same column). Show that $r$ is divisible by $p^5$. Here, we assume that all the checkers are identical.