On a connected graph $G$, one may perform the following operations: [list] [*]choose a vertice $v$, and add a vertice $v'$ such that $v'$ is connected to $v$ and all of its neighbours [*] choose a vertice $v$ with odd degree and delete it [/list] Show that for any connected graph $G$, we may perform a finite number of operations such that the resulting graph is a clique. Proposed by [i]idonthaveanaopsaccount[/i]

The bottom, side, and front areas of a rectangular box are known. The product of these areas is equal to: $ \textbf{(A)}\ \text{the volume of the box} \qquad\textbf{(B)}\ \text{the square root of the volume} \qquad\textbf{(C)}\ \text{twice the volume}$ $ \textbf{(D)}\ \text{the square of the volume} \qquad\textbf{(E)}\ \text{the cube of the volume}$

Consider a triangle $ABC$. Let $S$ be a circumference in the interior of the triangle that is tangent to the sides $BC$, $CA$, $AB$ at the points $D$, $E$, $F$ respectively. In the exterior of the triangle we draw three circumferences $S_A$, $S_B$, $S_C$. The circumference $S_A$ is tangent to $BC$ at $L$ and to the prolongation of the lines $AB$, $AC$ at the points $M$, $N$ respectively. The circumference $S_B$ is tangent to $AC$ at $E$ and to the prolongation of the line $BC$ at $P$. The circumference $S_C$ is tangent to $AB$ at $F$ and to the prolongation of the line $BC$ at $Q$. Show that the lines $EP$, $FQ$ and $AL$ meet at a point of the circumference $S$.

Find all functions $f: \mathbb{Z}\to \mathbb{Z}$ such that for all $m\in \mathbb{Z}$: \[f(f(m))=m+1.\]

An underground burrow consists of an infinite sequence of rooms labeled by the integers $(\dots, -3, -2, -1, 0, 1, 2, 3,\dots)$. Initially, some of the rooms are occupied by one or more rabbits. Each rabbit wants to be alone. Thus, if there are two or more rabbits in the same room (say, room $m$), half of the rabbits (rounding down) will flee to room $m-1$, and half (also rounding down) to room $m+1$. Once per minute, this happens simultaneously in all rooms that have two or more rabbits. For example, if initially all rooms are empty except for $5$ rabbits in room $\#12$ and $2$ rabbits in room $\#13$, then after one minute, rooms $\text{\#11--\#14}$ will contain $2$, $2$, $2$, and $1$ rabbits, respectively, and all other rooms will be empty. Now suppose that initially there are $k+1$ rabbits in room $k$ for each $k=0, 1, 2, \ldots, 9, 10$, and all other rooms are empty. [list=a] [*]Show that eventually the rabbits will stop moving. [*] Determine which rooms will be occupied when this occurs. [/list]

$A$ is an acute angle. Show that $$\left(1 +\frac{1}{sen A}\right)\left(1 +\frac{1}{cos A}\right)> 5$$

In $ xy$ plane, find the minimum volume of the solid by rotating the region boubded by the parabola $ y \equal{} x^2 \plus{} ax \plus{} b$ passing through the point $ (1,\ \minus{} 1)$ and the $ x$ axis about the $ x$ axis

Call a right triangle $ABC$ [i]special [/i] if the lengths of its sides $AB, BC$ and$ CA$ are integers, and on each of these sides has some point $X$ (different from the vertices of $ \vartriangle ABC$), for which the lengths of the segments $AX, BX$ and $CX$ are integers numbers. Find at least one special triangle. (Maria Rozhkova)

In a classroom, $28$ students are divided into $4$ groups of $7$, and in each group the students are labeled $1, 2,..., 7$ in some order. Show that no matter how the labels are assigned, there must be four students of the same gender who come from two groups and share the same two labels.

There are several scientists collaborating in Niichavo. During an $ 8$-hour working day, the scientists went to cafeteria, possibly several times.It is known that for every two scientist, the total time in which exactly one of them was in cafeteria is at least $ x$ hours ($ x>4$). What is the largest possible number of scientist that could work in Niichavo that day,in terms of $ x$?

Find the number of sets $A$ containing $9$ positive integers with the following property: for any positive integer $n\le 500$, there exists a subset $B\subset A$ such that $\sum_{b\in B}{b}=n$. [i]Bogdan Enescu & Dan Ismailescu[/i]

Alice and Bob play the following game: They start with non-empty piles of coins. Taking turns, with Alice playing first, each player choose a pile with an even number of coins and moves half of the coins of this pile to the other pile. The game ends if a player cannot move, in which case the other player wins. Determine all pairs $(a,b)$ of positive integers such that if initially the two piles have $a$ and $b$ coins respectively, then Bob has a winning strategy. Proposed by Dimitris Christophides, Cyprus

Each positive integer $a$ undergoes the following procedure in order to obtain the number $d = d\left(a\right)$: (i) move the last digit of $a$ to the first position to obtain the numb er $b$; (ii) square $b$ to obtain the number $c$; (iii) move the first digit of $c$ to the end to obtain the number $d$. (All the numbers in the problem are considered to be represented in base $10$.) For example, for $a=2003$, we get $b=3200$, $c=10240000$, and $d = 02400001 = 2400001 = d(2003)$.) Find all numbers $a$ for which $d\left( a\right) =a^2$. [i]Proposed by Zoran Sunic, USA[/i]

Show that, for every positive integer $x$, there is a positive integer $y\in \{2, 5, 13\}$ such that $xy - 1$ is not a perfect square.

Joey is playing with a $2$-by-$2$-by-$2$ Rubik’s cube made up of $ 8$ $1$-by-$1$-by-$1$ cubes (with two of these smaller cubes along each of the sides of the bigger cubes). Each face of the Rubik’s cube is distinct color. However, one day, Joey accidentally breaks the cube! He decides to put the cube back together into its solved state, placing each of the pieces one by one. However, due to the nature of the cube, he is only able to put in a cube if it is adjacent to a cube he already placed. If different orderings of the ways he chooses the cubes are considered distinct, determine the number of ways he can reassemble the cube.

Albert, Bernard, and Cheryl are playing marbles. At the beginning, each of them brings 5 red marbles, 7 green marbles and 13 blue marbles and in the middle of the table, there is a box of infinitely many red, blue and green marbles. In each turn, each player may choose 2 marbles of different color and replace them with 2 marbles of the third color. After a finite number of steps, this conversation happens. Albert : " I have only red marbles" Bernard : "I have only blue marbles" Cheryl: "I have only green marbles" Which of the three are lying?

Find the largest real constant $a$ such that for all $n \geq 1$ and for all real numbers $x_0, x_1, ... , x_n$ satisfying $0 = x_0 < x_1 < x_2 < \cdots < x_n$ we have \[\frac{1}{x_1-x_0} + \frac{1}{x_2-x_1} + \dots + \frac{1}{x_n-x_{n-1}} \geq a \left( \frac{2}{x_1} + \frac{3}{x_2} + \dots + \frac{n+1}{x_n} \right)\]

Vika calls some positive integers [i]nice[/i], and it is known that among any ten consecutive positive integers there is at least one nice. Prove that there are infinitely many positive integers $n$ for which $ab-cd=2n^2$ for some pairwise distinct nice numbers $a,b,c,$ and $d$

Prove that there exists a positive integer $n$, such that the remainder of $3^n$ when divided by $2^n$ is greater than $10^{2021} $.

Let $n$ be a positive integer. Using the integers from $1$ to $4n$ inclusive, pairs are to be formed such that the product of the numbers in each pair is a perfect square. Each number can be part of at most one pair, and the two numbers in each pair must be different. Determine, for each $n$, the maximum number of pairs that can be formed.

Given that the polynomial $P(x) = x^5 - x^2 + 1$ has $5$ roots $r_1, r_2, r_3, r_4, r_5$. Find the value of the product $Q(r_1)Q(r_2)Q(r_3)Q(r_4)Q(r_5)$, where $Q(x) = x^2 + 1$.

The number $d_1d_2\cdots d_9$ has nine (not necessarily distinct) decimal digits. The number $e_1e_2\cdots e_9$ is such that each of the nine $9$-digit numbers formed by replacing just one of the digits $d_i$ in $d_1d_2\cdots d_9$ by the corresponding digit $e_i \;\;(1 \le i \le 9)$ is divisible by $7$. The number $f_1f_2\cdots f_9$ is related to $e_1e_2\cdots e_9$ is the same way: that is, each of the nine numbers formed by replacing one of the $e_i$ by the corresponding $f_i$ is divisible by $7$. Show that, for each $i$, $d_i-f_i$ is divisible by $7$. [For example, if $d_1d_2\cdots d_9 = 199501996$, then $e_6$ may be $2$ or $9$, since $199502996$ and $199509996$ are multiples of $7$.]

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.

$ ABC$ is a triangle with $ \angle BAC \equal{} 10{}^\circ$, $ \angle ABC \equal{} 150{}^\circ$. Let $ X$ be a point on $ \left[AC\right]$ such that $ \left|AX\right| \equal{} \left|BC\right|$. Find $ \angle BXC$. $\textbf{(A)}\ 15^\circ \qquad\textbf{(B)}\ 20^\circ \qquad\textbf{(C)}\ 25^\circ \qquad\textbf{(D)}\ 30^\circ \qquad\textbf{(E)}\ 35^\circ$

A bug starts at vertex $A$ of triangle $ABC$. Six times, the bug travels to a randomly chosen adjacent vertex. For example, the bug could go from $A$, to $B$, to $C$, back to $B$, and back to $C$. What is the probability that the bug ends up at $A$ after its six moves?