Given is a tree $G$ with $2023$ vertices. The longest path in the graph has length $2n$. A vertex is called good if it has degree at most $6$. Find the smallest possible value of $n$ if there doesn't exist a vertex having $6$ good neighbors.

Recall that a palindrome is a word which is the same when we read it forward or backward. (a) We have an infinite number of cards with words $\{abc, bca, cab\}$. A word is made from them in the following way. The initial word is an arbitrary card. At each step we obtain a new word either gluing a card (from the right or from the left) to the existing word or making a cut between any two of its letters and gluing a card between both parts. Is it possible to obtain a palindrome this way? [i](4 points)[/i] (b) We have an infinite number of red cards with words $\{abc, bca, cab\}$ and of blue cards with words $\{cba, acb, bac\}$. A palindrome was formed from them in the same way as in part (a). Is it necessarily true that the number of red and blue cards used was equal? [i](6 points)[/i] [i]Alexandr Gribalko, Ivan Mitrofanov [/i]

Emily draws six dots on a piece of paper such that no three lie on a straight line, then draws a line segment connecting each pair of dots. She then colors five of these segments red. Her coloring is said to be $\emph{red-triangle-free}$ if for every set of three points from her six drawn points there exists an uncolored segment connecting two of the three points. In how many ways can Emily color her drawing such that it is red-triangle-free?

Maria have $14$ days to train for an olympiad. The only conditions are that she cannot train by $3$ consecutive days and she cannot rest by $3$ consecutive days. Determine how many configurations of days(in training) she can reach her goal.

Let $n \geq 2$ be an integer. Find the minimum $k$ for which there exists a partition of $\{1, 2, . . . , k\}$ into $n$ subsets $X_1,X_2, \cdots , X_n$ such that the following condition holds: for any $i, j, 1 \leq i < j \leq n$, there exist $x_i \in X_1, x_j \in X_2$ such that $|x_i - x_j | = 1.$

A rectangle \( m \times n \), where \( m \) and \( n \) are natural numbers strictly greater than 1, is partitioned into \( mn \) unit squares, each of which can be colored either black or white. An operation consists of changing the color of all the squares in a row or in a column to the opposite color. Is it possible that, although initially exactly one square is colored black and all the others are white, after a finite number of moves all squares have the same color?

Let $n\geq1$ be a positive integer. $n$ lamps are placed in a line. At minute 0, some lamps are on (maybe all of them). Every minute the state of the lamps changes: A lamp is on at minute $t+1$ if and only if at minute $t$, exactly one of its neighbors is on (the two lamps at the ends have one neighbor each, all other lamps have two neighbors). For which values of $n$ can we guarantee that all lamps will be off after some time?

Pawns are placed on an infinite chess board so that they form an infinite square net (along any row or column containing pawns ther is a pawn , three free squares , pawn , three squares, and so on , with only every fourth row and every fourth column containing pawns). Prove that it is not possible for a knight to tour every free square once and only once. (An old problem of A . K . Tolpugo)

Let $n\geq 4$ be a positive integer.Out of $n$ people,each of two individuals play table tennis game(every game has a winner).Find the minimum value of $n$,such that for any possible outcome of the game,there always exist an ordered four people group $(a_{1},a_{2},a_{3},a_{4})$,such that the person $a_{i}$ wins against $a_{j}$ for any $1\leq i<j\leq 4$

An equilateral triangle is divided by lines, parallel to its sides, into equilateral triangles, all of the same size. One of the smaller triangles is black while the others are white. It is permitted to intersect simultaneously some small triangles with a line parallel to any side of the original triangle and to change the colour of each intersected small triangle from one colour to the other . Is it always possible to find a sequence of such operations so that the smaller triangles all become white?

Each cell in a \( 2024 \times 2024 \) table contains the letter \( A \) or \( B \), with the number of \( A \)'s in each row being the same and the number of \( B \)'s in each column being the same. Alexandra and Boris play the following game, alternating turns, with Alexandra going first. On each turn, the player chooses a row or column and erases all the letters in it that have not yet been erased, as long as at least one letter is erased during the turn, and at the end of the turn, at least one letter remains in the table. The game ends when exactly one letter remains in the table. Alexandra wins the game if the letter is \( A \), and Boris wins if it is \( B \). What is the number of initial tables for which Alexandra has a winning strategy?

Find all nonempty finite sets $X$ of real numbers such that for all $x\in X$, $x+|x| \in X$.

A circle is located on the plane. What is the smallest number of lines you need to draw so that, symmetrically reflecting a given circle relative to these lines (in any order a finite number of times), it could cover any given point of the plane?

A tournament is arranged amongst a finite number of people. Every person plays every other person just once and each game results in a win to one of the players (there are no draws). Show that there must a person $X$ such that, given any other person $Y$ in the tournament, either $X$ beat $Y$ , or $X$ beat $Z$ and $Z$ beat $Y$ for some $Z$.

Consider all possible sets of natural numbers $(x_1, x_2, ..., x_{100})$ such that $1\leq x_i \leq 2017$ for every $i = 1,2, ..., 100$. We say that the set $(y_1, y_2, ..., y_{100})$ is greater than the set $(z_1, z_2, ..., z_{100})$ if $y_i> z_i$ for every $i = 1,2, ..., 100$. What is the largest number of sets that can be written on the board, so that any set is not more than the other set?

Givan the set $S = \{1,2,3,....,n\}$. We want to partition the set $S$ into three subsets $A,B,C$ disjoint (to each other) with $A\cup B\cup C=S$ , such that the sums of their elements $S_{A} S_{B} S_{C}$ to be equal .Examine if this is possible when: a) $n=2014$ b) $n=2015 $ c) $n=2018$

Let $n$ be a positive integer. A board with a format $n*n$ is divided in $n*n$ equal squares.Determine all integers $n$≥3 such that the board can be covered in $2*1$ (or $1*2$) pieces so that there is exactly one empty square in each row and each column.

Let $n\ge 3$ be an integer. An [i]inner diagonal[/i] of a [i]simple $n$-gon[/i] is a diagonal that is contained in the $n$-gon. Denote by $D(P)$ the number of all inner diagonals of a simple $n$-gon $P$ and by $D(n)$ the least possible value of $D(Q)$, where $Q$ is a simple $n$-gon. Prove that no two inner diagonals of $P$ intersect (except possibly at a common endpoint) if and only if $D(P)=D(n)$. [i]Remark:[/i] A simple $n$-gon is a non-self-intersecting polygon with $n$ vertices. A polygon is not necessarily convex.

Given is a square board with dimensions $2023 \times 2023$, in which each unit cell is colored blue or red. There are exactly $1012$ rows in which the majority of cells are blue, and exactly $1012$ columns in which the majority of cells are red. What is the maximal possible side length of the largest monochromatic square?

For which natural number $n$ is it possible to place natural number from 1 to $3n$ on the edges of a right $n$-angled prism (on each edge there is exactly one number placed and each one is used exactly 1 time) in such a way, that the sum of all the numbers, that surround each face is the same?

At a chess tournament the winner gets 1 point and the defeated one 0 points. A tie makes both obtaining $\frac{1}{2}$ points. 14 players, none of them equally aged, participated in a competition where everybody played against all the other players. After the competition a ranking was carried out. Of the two players with the same number of points the younger received the better ranking. After the competition Jan realizes that the best three players together got as many points as the last 9 players obtained points together. And Joerg noted that the number of ties was maximal. Determine the number of ties.

An urn contain a number of yellow and green balls. You extract two balls from the urn (without adding them back) and calculate the probability of both balls being green. Can you choose the number of yellow and green balls such that this probability to be $\frac{1}{4}$?

The squares in a $3\times 7$ grid are colored either blue or yellow. Consider all $m\times n$ rectangles in this grid, where $m \in \{2,3\}$, $n \in \{2,...,7\}$. Prove that at least one of these rectangles has all four corner squares the same color.

Let $n\ge2$ be an integer and let $x_1,x_2,\ldots,x_n$ be real numbers. Consider $N=\binom n2$ sums $x_i+x_j$, $1\le i<j\le n$, and denote them by $y_1,y_2,\ldots,y_N$ (in an arbitrary order). For which $n$ are the numbers $x_1,x_2,\ldots,x_n$ uniquely determined by the numbers $y_1,y_2,\ldots,y_N$?

A white equilateral triangle is split into $n^2$ equal smaller triangles by lines that are parallel to the sides of the triangle. Denote a [i]line of triangles[/i] to be all triangles that are placed between two adjacent parallel lines that forms the grid. In particular, a triangle in a corner is also considered to be a line of triangles. We are to paint all triangles black by a sequence of operations of the following kind: choose a line of triangles that contains at least one white triangle and paint this line black (a possible situation with $n=6$ after four operations is shown in Figure 1; arrows show possible next operations in this situation). Find the smallest and largest possible number of operations.