Every member of a given sequence, beginning with the second , is equal to the sum of the preceding one and the sum of its digits . The first member equals $1$ . Is there, among the members of this sequence, a number equal to $123456$ ? (S. Fomin , Leningrad)

Consider $4n$ points in the plane, with no three points collinear. Using these points as vertices, we form $\binom{4n}{3}$ triangles. Show that there exists a point $X$ of the plane that belongs to the interior of at least $2n^3$ of these triangles.

A division of a group of people into various groups is called $k$-regular if the number of groups is less or equal to $k$ and two people that know each other are in different groups. Let $A$, $B$, and $C$ groups of people such that there are is no person in $A$ and no person in $B$ that know each other. Suppose that the group $A \cup C$ has an $a$-regular division and the group $B \cup C$ has a $b$-regular division. For each $a$ and $b$, determine the least possible value of $k$ for which it is guaranteed that the group $A \cup B \cup C$ has a $k$-regular division.

Let $f:\mathbb{Z}\rightarrow\{ 1,2,\ldots ,n\}$ be a function such that $f(x)\not= f(y)$, for all $x,y\in\mathbb{Z}$ such that $|x-y|\in\{2,3,5\}$. Prove that $n\ge 4$. [i]Ioan Tomescu[/i]

In an $8 \times 8$ grid, $n$ disks, numbered $1$ to $n$ are stacked, with random order, in a pile in the bottom left comer. The disks can be moved one at a time to a neighbouring cell either to the right or top. The aim to move all the disks to the cell at the top right comer and stack them in the order $1,2,...,n$ from the bottom. Each cell, except the bottom left and top right cell, can have at most one disk at any given time. Find the largest value of $n$ so that the aim can be achieved.

Each subset of $97$ out of $1997$ given real numbers has positive sum. Show that the sum of all the $1997$ numbers is positive.

Let $n$ be a positive integer. A [i]Japanese triangle[/i] consists of $1 + 2 + \dots + n$ circles arranged in an equilateral triangular shape such that for each $i = 1$, $2$, $\dots$, $n$, the $i^{th}$ row contains exactly $i$ circles, exactly one of which is coloured red. A [i]ninja path[/i] in a Japanese triangle is a sequence of $n$ circles obtained by starting in the top row, then repeatedly going from a circle to one of the two circles immediately below it and finishing in the bottom row. Here is an example of a Japanese triangle with $n = 6$, along with a ninja path in that triangle containing two red circles. [asy] // credit to vEnhance for the diagram (which was better than my original asy): size(4cm); pair X = dir(240); pair Y = dir(0); path c = scale(0.5)*unitcircle; int[] t = {0,0,2,2,3,0}; for (int i=0; i<=5; ++i) { for (int j=0; j<=i; ++j) { filldraw(shift(i*X+j*Y)*c, (t[i]==j) ? lightred : white); draw(shift(i*X+j*Y)*c); } } draw((0,0)--(X+Y)--(2*X+Y)--(3*X+2*Y)--(4*X+2*Y)--(5*X+2*Y),linewidth(1.5)); path q = (3,-3sqrt(3))--(-3,-3sqrt(3)); draw(q,Arrows(TeXHead, 1)); label("$n = 6$", q, S); label("$n = 6$", q, S); [/asy] In terms of $n$, find the greatest $k$ such that in each Japanese triangle there is a ninja path containing at least $k$ red circles.

Is it possible to paint all natural numbers in $6$ colors, for each one color to be used and the sum of any five numbers of different color to be painted in the sixth color?

A class has 30 students. To celebrate 'Tu BiShvat' each student chose some dried fruits out of $n$ different kinds. Say two students are friends if they both chose from the same type of fruit. Find the minimal $n$ so that it is possible that each student has exactly \(6\) friends.

Given some colored balls (at least three different colors) and at least three boxes. The balls are put into the boxes so that no box is empty and we cannot find three balls of different colors which are in three different boxes. Show that there is a box such that all the balls in all the other boxes have the same color.

Set $T$ consists of $66$ points in plane, and $P$ consists of $16$ lines in plane. Pair $(A,l)$ is [i]good[/i] if $A \in T$, $l \in P$ and $A \in l$. Prove that maximum number of good pairs is no greater than $159$, and prove that there exits configuration with exactly $159$ good pairs.

In a hockey tournament, there is an odd number $n$ of teams. Each team plays exactly one match against each of the other teams. In this tournament, each team receives $2$ points for a win, $1$ point for a draw, and $0$ points for a loss. At the end of the tournament, it was observed that all the points obtained by the $n$ teams were different. For each $n$, determine the maximum possible number of draws that could have occurred in this tournament.

There were $n> 1$ aborigines living on an island, each of them telling only the truth or only lying, and each having at least one friend among the others. The new governor asked each aborigine whether there are more truthful aborigines or liars among his friends, or an equal number of both. Each aborigine answered that there are more liars than truthful aborigines among his friends. The governor then ordered one of the aborigines to be executed for being a liar and asked each of the remaining $n- 1$ aborigines the same question again. This time each aborigine answered that there are more truthful aborigines than liars among his friends. Determine whether the executed aborigine was truthful or a liar, and whether there are more truthful aborigines or liars remaining on the island.

Let $m$ and $n$ be positive integers. A circular necklace contains $mn$ beads, each either red or blue. It turned out that no matter how the necklace was cut into $m$ blocks of $n$ consecutive beads, each block had a distinct number of red beads. Determine, with proof, all possible values of the ordered pair $(m, n)$. [i]Proposed by Rishabh Das[/i]

We are given the set $$M = \{-2^{2022}, -2^{2021}, . . . , -2^{2}, -2, -1, 1, 2, 2^2, . . . , 2^{2021}, 2^{2022}\}.$$ Let $T$ be a subset of $M$, such that neighbouring numbers have the same difference when the elements are ordered by size. (a) Determine the maximum number of elements that such a set $T$ can contain. (b) Determine all sets $T$ with the maximum number of elements. [i](Walther Janous)[/i]

There are 3 heaps with $100,101,102$ stones. Ilya and Kostya play next game. Every step they take one stone from some heap, but not from same, that was on previous step. They make his steps in turn, Ilya make first step. Player loses if can not make step. Who has winning strategy?

Let $ n$ and $ k$ be positive integers and let $ S$ be a set of $ n$ points in the plane such that [b]i.)[/b] no three points of $ S$ are collinear, and [b]ii.)[/b] for every point $ P$ of $ S$ there are at least $ k$ points of $ S$ equidistant from $ P.$ Prove that: \[ k < \frac {1}{2} \plus{} \sqrt {2 \cdot n} \]

There are three cities each of which has exactly the same number of citizens, say $n$. Every citizen in each city has exactly a total of $(n+1)$ friends in the other two cities. Show that there exist three people, one from each city, such that they are friends. We assume that friendship is mutual (that is, a symmetric relation).

In the plane, construct as many lines in general position as possible, with any two of them intersecting in a point with integer coordinates.

$a_1, a_2, ... , a_n$ is a sequence of integers such that every non-empty subsequence has non-zero sum. Show that we can partition the positive integers into a finite number of sets such that if $x_i$ all belong to the same set, then $a_1x_1 + a_2x_2 + ... + a_nx_n$ is non-zero.

Is it possible to cut a rectangle $2001\times2003$ into pieces of the form [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvNS82L2RjZTZjNzc0M2YxMzM1ZDIzZTY2Zjc2NGJlMWJlMWUwMmU2ZWRlLnBuZw==&rn=U2NyZWVuIFNob3QgMjAyMS0wNS0xMyBhdCAzLjQ2LjQ2IFBNLnBuZw==[/img] each consisting of three unit squares?

On a $49\times 69$ rectangle formed by a grid of lattice squares, all $50\cdot 70$ lattice points are colored blue. Two persons play the following game: In each step, a player colors two blue points red, and draws a segment between these two points. (Different segments can intersect in their interior.) Segments are drawn this way until all formerly blue points are colored red. At this moment, the first player directs all segments drawn - i. e., he takes every segment AB, and replaces it either by the vector $\overrightarrow{AB}$, or by the vector $\overrightarrow{BA}$. If the first player succeeds to direct all the segments drawn in such a way that the sum of the resulting vectors is $\overrightarrow{0}$, then he wins; else, the second player wins. Which player has a winning strategy?

Determine the number of 2010 letter words, formed by the letters $a$, $b$, and $c$, such that at least one of the three letters is odd number of times in the word.

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

In the Mobius Planet (a plane and infinite planet!, in a similar manner to the $N \times N$ lattice), the Supreme King Mobius is planning to construct a water reservoir. There are some restrictions to this project: 1. There exists only $k < \infty$ bricks. 2. These bricks will delimit a closed finite area. What is the maximum area of this resevoir in function of $k$?