Let the decimal representations of numbers $A$ and $B$ be given as: $A = 0.a_1a_2\cdots a_k > 0$, $B = 0.b_1b_2\cdots b_k > 0$ (where $a_k, b_k$ can be 0), and let $S$ be the count of numbers $0.c_1c_2\cdots c_k$ such that $0.c_1c_2\cdots c_k < A$ and $0.c_kc_{k-1}\cdots c_1 < B$ ($c_k, c_1$ can also be 0). (Here, $0.c_1c_2\cdots c_r (c_r \neq 0)$ is considered the same as $0.c_1c_2\cdots c_r0\cdots0$). Prove: $\left| S - 10^k AB \right| \leq 9k.$

$64$ numbers (not necessarily distinct) are placed on the squares of a chessboard such that the sum of the numbers in every $2\times2$ square is $7$. What is the sum of the four numbers in the corners of the board?

Let be a sequence of $ 51 $ natural numbers whose sum is $ 100. $ Show that for any natural number $ 1\le k<100 $ there are some consecutive numbers from this sequence whose sum is $ k $ or $ 100-k. $

Let $a_1 < a_2 < .... < a_n < 2n$ ne $n$ positive integers such that $a_j$ does not divide $a_k$ or $j \not= k$. Prove that $a_1 \geq 2^{k}$ where $k$ is defined by the condition $3^{k} < 2n < 3^{k+1}$ and show that it is the best estimate for $a_1$

There are $n\ge 2$ lamps, each with two states: $\textbf{on}$ or $\textbf{off}$. For each non-empty subset $A$ of the set of these lamps, there is a $\textit{soft-button}$ which operates on the lamps in $A$; that is, upon $\textit{operating}$ this button each of the lamps in $A$ changes its state(on to off and off to on). The buttons are identical and it is not known which button corresponds to which subset of lamps. Suppose all the lamps are off initially. Show that one can always switch all the lamps on by performing at most $2^{n-1}+1$ operations.

Prove that if a person a has infinitely many descendants (children, their children, etc.), then a has an infinite sequence $a_0, a_1, \ldots$ of descendants (i.e., $a = a_0$ and for all $n \geq 1, a_{n+1}$ is always a child of $a_n$). It is assumed that no-one can have infinitely many children. [i]Variant 1[/i]. Prove that if $a$ has infinitely many ancestors, then $a$ has an infinite descending sequence of ancestors (i.e., $a_0, a_1, \ldots$ where $a = a_0$ and $a_n$ is always a child of $a_{n+1}$). [i]Variant 2.[/i] Prove that if someone has infinitely many ancestors, then all people cannot descend from $A(dam)$ and $E(ve)$.

In the game "cat and mouse" the cat chases the mouse in either labyrinth $A, B$ or $C$ . [img]https://cdn.artofproblemsolving.com/attachments/4/5/429d106736946011f4607cf95956dcb0937c84.png[/img] The cat makes the first move starting at the point marked "$K$" , moving along a marked line to an adjacent point . The mouse then moves , under the same rules, starting from the point marked "$M$" . Then the cat moves again, and so on . If, at a point of time , the cat and mouse are at the same point the cat eats the mouse. Is there available to the cat a strategy which would enable it to catch the mouse , in cases $A, B$ and $C$? (A. Sosinskiy, Moscow)

There are $128$ numbered seats arranged around a circle in a palaestra. The first person to enter the place would sit on seat number $1$. Since a contagious disease is infecting the people of the city, each person who enters the palaestra would sit on a seat whose distance is the longest to the nearest occupied seat. If there are several such seats, the newly entered person would sit on the seat with the smallest number. What is the number of the seat on which the $39$th person sits?

Find all natural numbers $k$ for which there exists a set $M$ of ten real numbers such that there are exactly $k$ pairwise non-congruent triangles whose side lengths are three (not necessarily distinct) elements of $M$.

Using several white edge cubes of side $ 1$, Guille builds a large cube. Then he chooses $4$ faces of the big cube and paints them red. Finally, he takes apart the large cube and observe that the cubes with at least a face painted red is $431$. Find the number of cubes that he used to assemble the large cube. Analyze all the possibilities.

On a $5 \times 5$ board, pieces made up of $4$ squares are placed, as seen in the figure, each covering exactly $4$ squares of the board. The pieces can be rotated or turned over. They can also overlap, but they cannot protrude from the board. Suppose that each square on the board is covered by at most two pieces. Determine the maximum number of squares on the board that can be covered (by one or two pieces). [asy] size(3cm); draw((0,0)--(0,1)--(1,1)--(1,0)--(0,0)--(1,0)--(2,0)--(2,1)--(1,1)--(1,2)--(2,2)--(2,1)--(3,1)--(3,2)--(2,2)); [/asy]

Define the [i]mexth[/i] of \(k\) sets as the \(k\)th smallest positive integer that none of them contain, if it exists. Does there exist a family \(\mathcal F\) of sets of positive integers such that [list] [*]for any nonempty finite subset \(\mathcal G\) of \(\mathcal F\), the mexth of \(\mathcal G\) exists, and [*]for any positive integer \(n\), there is exactly one nonempty finite subset \(\mathcal G\) of \(\mathcal F\) such that \(n\) is the mexth of \(\mathcal G\). [/list] [i]Proposed by Espen Slettnes[/i]

Let be given a convex polyhedron whose all faces are triangular. The vertices of the polyhedron are colored using three colors. Prove that the number of faces with vertices in all the three colors is even.

In a school with 5 different grades there are 250 girls and 250 boys. Each grade has the same number of students. for a competition of knowledge wants to form teams of a female and a male who are of the same grade. If in each grade there are at least $19$ females and $19$ males. Find the greatest amount of teams that can be formed.

One quadrant of the Cartesian coordinate system is tiled with $1\times 2$ dominoes. The dominoes don’t overlap with each other, they cover the entire quadrant and they all fit in the quadrant. Farringdon the flea is initially sitting at the origin and is allowed to jump from one corner of a domino to the opposite corner any number of times. Is it possible that the dominoes are arranged in such a way that Farringdon is unable to move to a distance greater than 2023 from the origin?

In a standard game of Rock–Paper–Scissors, two players repeatedly choose between rock, paper, and scissors, until they choose different options. Rock beats scissors, scissors beats paper, and paper beats rock. Nathan knows that on each turn, Richard randomly chooses paper with probability $33\%$, scissors with probability $44\%$, and rock with probability $23\%$. If Nathan plays optimally against Richard, the probability that Nathan wins is expressible as $a/b$ where $a$ and $b$ are coprime positive integers. Find $a + b$.

An ordinary domino tile can be identified as a pair $(k,m)$ where numbers $k$ and $m$ can get values $0, 1, 2, 3, 4, 5$ and $6.$ Pairs $(k,m)$ and $(m, k)$ determine the same tile. In particular, the pair $(k, k)$ determines one tile. We say that two domino tiles [i]match[/i], if they have a common component. [i]Generalized n-domino tiles[/i] $m$ and $k$ can get values $0, 1,... , n.$ What is the probability that two randomly chosen $n$-domino tiles match?

Determine all natural numbers $n$ so that numbers $1, 2,... , n$ can be placed on the circumference of a circle and for each natural number $s$ with $1\le s \le \frac12n(n+1)$ , there is a circular arc which has the sum of all numbers in that arc to be $s$.

The vertices of a convex polygon with $n\geqslant 4$ sides are coloured with black and white. A diagonal is called [i]multicoloured[/i] if its vertices have different colours. A colouring of the vertices is [i]good[/i] if the polygon can be partitioned into triangles by using only multicoloured diagonals which do not intersect in the interior of the polygon. Find the number of good colourings. [i]Proposed by S. Berlov[/i]

In one country, a one-round tennis tournament was held (everyone played with everyone exactly once). Participants received $1$ point for winning a match, and $0$ points for losing. There are no draws in tennis. At the end of the tournament, Oleksiy saw the number of points scored by each participant, as well as the schedule of all the matches in the tournament, which showed the pairs of players, but not the winners. He chooses matches one by one in any order he wants and tries to guess the winner, after which he is told if he is correct. Prove that Oleksiy can act in such a way that he is guaranteed to guess the winners of more than half of the matches. [i]Proposed by Oleksiy Masalitin[/i]

There are $12$ chairs arranged in a circle, numbered from $ 1$ to $ 12$. How many ways are there to select some of the chairs in such a way that our selection includes $3$ consecutive chairs somewhere?

Each vertex of a finite graph can be coloured either black or white. Initially all vertices are black. We are allowed to pick a vertex $P$ and change the colour of $P$ and all of its neighbours. Is it possible to change the colour of every vertex from black to white by a sequence of operations of this type? Note: A finite graph consists of a finite set of vertices and a finite set of edges between vertices. If there is an edge between vertex $A$ and vertex $B,$ then $A$ and $B$ are neighbours of each other.

In a garden, which is organized as a $2024\times 2024$ board, we plant three types of flowers: roses, daisies, and orchids. We want to plant flowers such that the following conditions are satisfied: (i) Each grid is planted with at most one type of flower. Some grids can be left blank and not planted. (ii) For each planted grid $A$, there exist exactly $3$ other planted grids in the same column or row such that those $3$ grids are planted with flowers of different types from $A$'s. (iii) Each flower is planted in at least $1$ grid. What is the maximal number of the grids that can be planted with flowers?

Luffy is playing with some magic boxes and a machine. Each box has a value(number) inside. Opening a box, Luffy sees the value, adds the value to his score(if the box value is negative, Luffy loses points) and destroys the box. Putting a box of value $X$ in the machine, this box vanishes and it is replaced by two new boxes of values $X+1$ and $X-1$(it's [b]not[/b] known which one has the respective value, but he can identify the new boxes). At the beginning, Luffy has $0$ points and has a box whose value is known(it is zero). a) Prove that Luffy can reach at least $1000$ points b) Is it possible that Luffy reaches at least $1000000$ points, [b]without[/b] have less than $-42$ points in any moment?

$1992$ vectors are given in the plane. Two players pick unpicked vectors alternately. The winner is the one whose vectors sum to a vector with larger magnitude (or they draw if the magnitudes are the same). Can the first player always avoid losing?