Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.

Alice and Bob play a game on a connected graph with $2n$ vertices, where $n\in \mathbb{N}$ and $n>1$.. Alice and Bob have tokens named A and B respectively. They alternate their turns with Alice going first. Alice gets to decide the starting positions of A and B. Every move, the player with the turn moves their token to an adjacent vertex. Bob's goal is to catch Alice, and Alice's goal is to prevent this. Note that positions of A, B are visible to both Alice and Bob at every moment. Provided they both play optimally, what is the maximum possible number of edges in the graph if Alice is able to evade Bob indefinitely? [i]Proposed by Shashank Ingalagavi and Vighnesh Sangle[/i]

At a party attended by $n$ married couples, each person talks to everyone else at the party except his or her spouse. The conversations involve sets of persons or cliques $C_1, C_2, \cdots, C_k$ with the following property: no couple are members of the same clique, but for every other pair of persons there is exactly one clique to which both members belong. Prove that if $n \geq 4$, then $k \geq 2n$. [i]Proposed by USA.[/i]

We call a matrix $\textsl{binary matrix}$ if all its entries equal to $0$ or $1$. A binary matrix is $\textsl{Good}$ if it simultaneously satisfies the following two conditions: (1) All the entries above the main diagonal (from left to right), not including the main diagonal, are equal. (2) All the entries below the main diagonal (from left to right), not including the main diagonal, are equal. Given positive integer $m$, prove that there exists a positive integer $M$, such that for any positive integer $n>M$ and a given $n \times n$ binary matrix $A_n$, we can select integers $1 \leq i_1 <i_2< \cdots < i_{n-m} \leq n$ and delete the $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th rows and $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th columns of $A_n$, then the resulting binary matrix $B_m$ is $\textsl{Good}$.

There are $12$ delegates in a mathematical conference. It is known that every two delegates share a common friend. Prove that there is a delegate who has at least five friends in that conference. [i]Proposed by Nairy Sedrakyan[/i]

There are $n$ students in a class, and some pairs of these students are friends. Among any six students, there are two of them that are not friends, and for any pair of students that are not friends there is a student among the remaining four that is friends with both of them. Find the maximum value of $n$.

On a party, there are 6 boys and a number of girls. Two of the girls know exactly four boys each and the remaining girls know exactly two boys each. None of the boys know more than three girls. (We assume that if $ A$ knows $ B$, then $ B$ will also know $ A$). Then, the greatest possible number of girls on the party is $ \text{(A)}\ 6 \qquad \text{(B)}\ 7 \qquad \text{(C)}\ 8 \qquad \text{(D)}\ 9 \qquad \text{(E)}\ \text{10 or more}$

Initially $A$ selects a graph with \( 2221 \) vertices such that each vertex is incident to at least one edge. Then $B$ deletes some of the edges (possibly none) from the chosen graph. Finally, $A$ pays $B$ one lev for each vertex that is incident to an odd number of edges. What is the maximum amount that $B$ can guarantee to earn?

There are $n > 2022$ cities in the country. Some pairs of cities are connected with straight two-ways airlines. Call the set of the cities {\it unlucky}, if it is impossible to color the airlines between them in two colors without monochromatic triangle (i.e. three cities $A$, $B$, $C$ with the airlines $AB$, $AC$ and $BC$ of the same color). The set containing all the cities is unlucky. Is there always an unlucky set containing exactly 2022 cities?

Ten localities are served by two international airlines such that there exists a direct service (without stops) between any two of these localities and all airline schedules offer round-trip service between the cities they serve. Prove that at least one of the airlines can offer two disjoint round trips each containing an odd number of landings.

In Tigre there are $2024$ islands, some of them connected by a two-way bridge. It is known that it is possible to go from any island to any other island using only the bridges (possibly several of them). In $k$ of the islands there is a flag ($0 \le k \le 2024$). Ana wants to destroy some of the bridges in such a way that after doing so, the following two conditions are met: \\ $\bullet$ If an island has a flag, it is connected to an odd number of islands. \\ $\bullet$ If an island does not have a flag, it is connected to an even number of islands. \\ Determine all values of $k$ for which Ana can always achieve her objective, no matter what the initial bridge configuration is and which islands have a flag.

Given an integer $n>1$ and a $n\times n$ grid $ABCD$ containing $n^2$ unit squares, each unit square is colored by one of three colors: Black, white and gray. A coloring is called [i]symmetry[/i] if each unit square has center on diagonal $AC$ is colored by gray and every couple of unit squares which are symmetry by $AC$ should be both colred by black or white. In each gray square, they label a number $0$, in a white square, they will label a positive integer and in a black square, a negative integer. A label will be called $k$-[i]balance[/i] (with $k\in\mathbb{Z}^+$) if it satisfies the following requirements: i) Each pair of unit squares which are symmetry by $AC$ are labelled with the same integer from the closed interval $[-k,k]$ ii) If a row and a column intersectes at a square that is colored by black, then the set of positive integers on that row and the set of positive integers on that column are distinct.If a row and a column intersectes at a square that is colored by white, then the set of negative integers on that row and the set of negative integers on that column are distinct. a) For $n=5$, find the minimum value of $k$ such that there is a $k$-balance label for the following grid [asy] size(4cm); pair o = (0,0); pair y = (0,5); pair z = (5,5); pair t = (5,0); dot("$A$", y, dir(180)); dot("$B$", z); dot("$C$", t); dot("$D$", o, dir(180)); fill((0,5)--(1,5)--(1,4)--(0,4)--cycle,gray); fill((1,4)--(2,4)--(2,3)--(1,3)--cycle,gray); fill((2,3)--(3,3)--(3,2)--(2,2)--cycle,gray); fill((3,2)--(4,2)--(4,1)--(3,1)--cycle,gray); fill((4,1)--(5,1)--(5,0)--(4,0)--cycle,gray); fill((0,3)--(1,3)--(1,1)--(0,1)--cycle,black); fill((2,5)--(4,5)--(4,4)--(2,4)--cycle,black); fill((2,1)--(3,1)--(3,0)--(2,0)--cycle,black); fill((2,1)--(3,1)--(3,0)--(2,0)--cycle,black); fill((4,3)--(5,3)--(5,2)--(4,2)--cycle,black); for (int i=0; i<=5; ++i) { draw((0,i)--(5,i)^^(i,0)--(i,5)); } [/asy] b) Let $n=2017$. Find the least value of $k$ such that there is always a $k$-balance label for a symmetry coloring.

An $ n \times n, n \geq 2$ chessboard is numbered by the numbers $ 1, 2, \ldots, n^2$ (and every number occurs). Prove that there exist two neighbouring (with common edge) squares such that their numbers differ by at least $ n.$

Let $n$ be a positive integer. There is a pawn in one of the cells of an $n\times n$ table. The pawn moves from an arbitrary cell of the $k$th column, $k \in \{1,2, \cdots, n \}$, to an arbitrary cell in the $k$th row. Prove that there exists a sequence of $n^{2}$ moves such that the pawn goes through every cell of the table and finishes in the starting cell.

A sequence of vertices $v_1,v_2,\ldots,v_k$ in a graph, where $v_i=v_j$ only if $i=j$ and $k$ can be any positive integer, is called a $\textit{cycle}$ if $v_1$ is attached by an edge to $v_2$, $v_2$ to $v_3$, and so on to $v_k$ connected to $v_1$. Rotations and reflections are distinct: $A,B,C$ is distinct from $A,C,B$ and $B,C,A$. Supposed a simple graph $G$ has $2013$ vertices and $3013$ edges. What is the minimal number of cycles possible in $G$?

Let $d_1, d_2, \ldots, d_n$ be given integers. Show that there exists a graph whose sequence of degrees is $d_1, d_2, \ldots, d_n$ and which contains an perfect matching if, and only if, there exists a graph whose sequence of degrees is $d_2, d_2, \ldots, d_n$ and a graph whose sequence of degrees is $d_1-1, d_2-1, \ldots, d_n-1$.

consider $n\geq 6$ points $x_1,x_2,\dots,x_n$ on the plane such that no three of them are colinear. We call graph with vertices $x_1,x_2,\dots,x_n$ a "road network" if it is connected, each edge is a line segment, and no two edges intersect each other at points other than the vertices. Prove that there are three road networks $G_1,G_2,G_3$ such that $G_i$ and $G_j$ don't have a common edge for $1\leq i,j\leq 3$. Proposed by Morteza Saghafian

Given a finite number of boys and girls, a [i]sociable set of boys[/i] is a set of boys such that every girl knows at least one boy in that set; and a [i]sociable set of girls[/i] is a set of girls such that every boy knows at least one girl in that set. Prove that the number of sociable sets of boys and the number of sociable sets of girls have the same parity. (Acquaintance is assumed to be mutual.) [i](Poland) Marek Cygan[/i]

Let $\mathcal{G}$ be a simple graph with $n$ vertices and $m$ edges such that no two cycles share an edge. Prove that $2m < 3n$. [i]Note[/i]: A [i]simple graph[/i] is a graph with at most one edge between any two vertices and no edges from any vertex to itself. A [i]cycle[/i] is a sequence of distinct vertices $v_1, \dots, v_n$ such that there is an edge between any two consecutive vertices, and between $v_n$ and $v_1$. [i]Proposed by Ethan Tan[/i]

Let $P$ be a set of people. For two people $A$ and $B$, if $A$ knows $B$, $B$ also knows $A$. Each person in $P$ knows $2$ or less people in the set. $S$, a subset of $P$ with $k$ people, is called [i][b]k-independent set[/b][/i] of $P$ if any two people in $S$ don’t know each other. $X_1, X_2, …, X_{4041}$ are [i][b]2021-independent set[/b][/i]s of $P$ (not necessarily distinct). Show that there exists a [i][b]2021-independent set[/b][/i] of $P$, $\{v_1, v_2, …, v_{2021}\}$, which satisfies the following condition: [center] For some integer $1 \le i_1 < i_2 < \cdots < i_{2021} \leq 4041$, $v_1 \in X_{i_1}, v_2 \in X_{i_2}, \ldots, v_{2021} \in X_{i_{2021}}$ [/center] [hide=Graph Wording] Thanks to Evan Chen, here's a graph wording of the problem :) Let $G$ be a finite simple graph with maximum degree at most $2$. Let $X_1, X_2, \ldots, X_{4041}$ be independent sets of size $2021$ [i](not necessarily distinct)[/i]. Prove that there exists another independent set $\{v_1, v_2, \ldots, v_{2021}\}$ of size $2021$ and indices $1 \le t_1 < t_2 < \cdots < t_{2021} \le 4041$ such that $v_i \in X_{t_i}$ for all $i$. [/hide]

There are several gentlemen in the meeting of the Diogenes Club, some of which are friends with each other (friendship is mutual). Let's name a participant unsociable if he has exactly one friend among those present at the meeting. By the club rules, the only friend of any unsociable member can leave the meeting (gentlemen leave the meeting one at a time). The purpose of the meeting is to achieve a situation in which that there are no friends left among the participants. Prove that if the goal is achievable, then the number of participants remaining at the meeting does not depend on who left and in what order.

Let $S$ be a finite set of points on a plane, where no three points are collinear, and the convex hull of $S$, $\Omega$, is a $2016-$gon $A_1A_2\ldots A_{2016}$. Every point on $S$ is labelled one of the four numbers $\pm 1,\pm 2$, such that for $i=1,2,\ldots , 1008,$ the numbers labelled on points $A_i$ and $A_{i+1008}$ are the negative of each other. Draw triangles whose vertices are in $S$, such that any two triangles do not have any common interior points, and the union of these triangles is $\Omega$. Prove that there must exist a triangle, where the numbers labelled on some two of its vertices are the negative of each other.

Given is a graph $G$ of $n+1$ vertices, which is constructed as follows: initially there is only one vertex $v$, and one a move we can add a vertex and connect it to exactly one among the previous vertices. The vertices have non-negative real weights such that $v$ has weight $0$ and each other vertex has a weight not exceeding the avarage weight of its neighbors, increased by $1$. Prove that no weight can exceed $n^2$.

In a complete graph with $2025$ vertices, each edge has one of the colors $r_1$, $r_2$, or $r_3$. For each $i = 1,2,3$, if the $2025$ vertices can be divided into $a_i$ groups such that any two vertices connected by an edge of color $r_i$ are in different groups, find the minimum possible value of $a_1 + a_2 + a_3$.

In a galaxy far, far away there are $225$ inhabited planets. Between some pairs of inhabited planets there is a bidirectional space connection, and it is possible to reach any planet from any other (possibly with several transfers). The [i]influence[/i] of a planet is the number of other planets with which this planet has a direct connection. It is known that if two planets are not connected by a direct space flight, they have different influences. What is the smallest number of connections possible under these conditions? [i]Proposed by Arsenii Nikolaev, Bogdan Rublov[/i]