Prove that there is a unique $1000$-digit number $N$ in base $2022$ with the following properties: [list=1] [*] All of the digits of $N$ (in base $2022$) are $1$’s or $2$’s, and [/*] [*] $N$ is a multiple of the base-$10$ number $2^{1000}$. [/*] [/list] (Note that you must prove both that such a number exists and that there is not more than one such number. You do not have to write down the number! In fact, please don’t!)

Let be the polynomial $ f=X^4+X^2\in\mathbb{Z}_2[X] $ Find: a) its degree.. b) the splitting field of $ f $ c) the Galois group of $ f $ (Galois group of its splitting field)

A copsychus and a sparrow, each initially located at one of the vertex of a regular polygon with $103$ edges, fly clockwise to another vertex each. The copsychus moves across $\ell$ edges each time while the sparrow moves through$ d$ edges of the polygon, where $\ell \ne d$ are both integers less than $103$. Assume that, during their journeys, the copsychus has stopped at $m$ vertices while sparrow has stopped at $n$ vertices of the polygon, for $m \ge n \ge 3$. Determine the value of $m, n$ given that there is only one common single vertex of the polygon that both of birds have stopped at, and there is only one vertex that neither of the birds have reached. Vu Thi Khoi, Topo University, Hanoi Mathematics Institute, Vietnam, Hoang Qu6c Vietnam, Hanoi.

Prove that if an integer $n$ is of the form $4m+3$, where $m$ is another integer, then $n$ is not a sum of two perfect squares (a perfect square is an integer which is the square of some integer).

On a plane, Bob chooses 3 points $A_0$, $B_0$, $C_0$ (not necessarily distinct) such that $A_0B_0+B_0C_0+C_0A_0=1$. Then he chooses points $A_1$, $B_1$, $C_1$ (not necessarily distinct) in such a way that $A_1B_1=A_0B_0$ and $B_1C_1=B_0C_0$. Next he chooses points $A_2$, $B_2$, $C_2$ as a permutation of points $A_1$, $B_1$, $C_1$. Finally, Bob chooses points $A_3$, $B_3$, $C_3$ (not necessarily distinct) in such a way that $A_3B_3=A_2B_2$ and $B_3C_3=B_2C_2$. What are the smallest and the greatest possible values of $A_3B_3+B_3C_3+C_3A_3$ Bob can obtain?

Find all pairs of integers $(x, y)$ such that $y^3 = 8x^6 + 2x^3 y -y^2$.

Let $0<k<\frac{1}{2}$ be a real number and let $a_0, b_0$ be arbitrary real numbers in $(0,1)$. The sequences $(a_n)_{n\ge 0}$ and $(b_n)_{n\ge 0}$ are then defined recursively by $$a_{n+1} = \dfrac{a_n+1}{2} \text{ and } b_{n+1} = b_n^k$$ for $n\ge 0$. Prove that $a_n<b_n$ for all sufficiently large $n$. [i]Proposed by Michael Ma

There are $12$ seats at a round table in a restaurant. A group of five women and seven men arrives at the table. How many ways are there for choosing the sitting order, provided that every woman ought to be surrounded by two men and two orders are regarded as different, if at least one person has a different neighbour on one's right side.

Let $ S \equal{} \{1,2,3,\cdots ,280\}$. Find the smallest integer $ n$ such that each $ n$-element subset of $ S$ contains five numbers which are pairwise relatively prime.

How many ordered pairs of real numbers $(x,y)$ satisfy the following system of equations? \begin{align*}x+3y&=3\\ \big||x|-|y|\big|&=1\end{align*} $\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 3 \qquad \textbf{(D) } 4 \qquad \textbf{(E) } 8 $

Square $ABCD$ with side-length $n$ is divided into $n^2$ small (fundamental) squares by drawing lines parallel to its sides (the case $n=5$ is presented on the diagram).The squares' vertices that lie inside (or on the boundary) of the triangle $ABD$ are connected with each other with arcs.Starting from $A$,we move only upwards or to the right.Each movement takes place on the segments that are defined by the fundamental squares and the arcs of the circles.How many possible roots are there in order to reach $C$;

Find all vectors of $n$ real numbers $(x_1,x_2,\ldots,x_n)$ such that \[ \left\{ \begin{array}{ccc} x_1 & = & \dfrac 1{x_2} + \dfrac 1{x_3} + \cdots + \dfrac 1{x_n } \\ x_2 & = & \dfrac 1{x_1} + \dfrac 1{x_3} + \cdots + \dfrac 1{x_n} \\ \ & \cdots & \ \\ x_n & = & \dfrac 1{x_1} + \dfrac 1{x_2} + \cdots + \dfrac 1{x_{n-1}} \end{array} \right. \] [i]Mircea Becheanu[/i]

In the triangle $ABC$, $\angle ABC = \angle ACB = 78^o$. On the sides $AB$ and $AC$, respectively, the points $D$ and $E$ are chosen such that $\angle BCD = 24^o$, $\angle CBE = 51^o$. Find the measure of angle $\angle BED$.

In acute-angled triangle $ABC$ ($AC > AB$), point $H$ is the orthocenter and point $M$ is the midpoint of the segment $BC$. The median $AM$ intersects the circumcircle of triangle $ABC$ at $X$. The line $CH$ intersects the perpendicular bisector of $BC$ at $E$ and the circumcircle of the triangle $ABC$ again at $F$. Point $J$ lies on circle $\omega$, passing through $X, E,$ and $F$, such that $BCHJ$ is a trapezoid ($CB \parallel HJ$). Prove that $JB$ and $EM$ meet on $\omega$. [i]Proposed by Alireza Dadgarnia[/i]

The following analog clock has two hands that can move independently of each other. [asy] unitsize(2cm); draw(unitcircle,black+linewidth(2)); for (int i = 0; i < 12; ++i) { draw(0.9*dir(30*i)--dir(30*i)); } for (int i = 0; i < 4; ++i) { draw(0.85*dir(90*i)--dir(90*i),black+linewidth(2)); } for (int i = 0; i < 12; ++i) { label("\small" + (string) i, dir(90 - i * 30) * 0.75); } draw((0,0)--0.6*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); draw((0,0)--0.4*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); [/asy] Initially, both hands point to the number 12. The clock performs a sequence of hand movements so that on each movement, one of the two hands moves clockwise to the next number on the clock while the other hand does not move. Let $N$ be the number of sequences of 144 hand movements such that during the sequence, every possible positioning of the hands appears exactly once, and at the end of the 144 movements, the hands have returned to their initial position. Find the remainder when $N$ is divided by 1000.

If $S=\{s_1,s_2,\dots,s_n\}$ is a set of integers with $s_1<s_2<\dots<s_n$, define $$f(S)=\sum_{k=1}^n (-1)^k k^2 s_k.$$ (If $S$ is empty, $f(S)=0$.) Compute the average value of $f(S)$ as $S$ ranges over all subsets of $\{1^2,2^2,\dots,100^2\}$. [i]Proposed by Connor Gordon and Nairit Sarkar[/i]

[b]Problem:[/b]For a positive integer $ n$,let $ V(n; b)$ be the number of decompositions of $ n$ into a product of one or more positive integers greater than $ b$. For example,$ 36 \equal{} 6.6 \equal{}4.9 \equal{} 3.12 \equal{} 3 .3. 4$, so that $ V(36; 2) \equal{} 5$.Prove that for all positive integers $ n$; b it holds that $ V(n;b)<\frac{n}{b}$. :)

A rectangle $ABCD$ and a point $P$ are given. Lines passing through $A$ and $B$ and perpendicular to $PC$ and $PD$ respectively, meet at a point $Q$. Prove that $PQ \perp AB$.

Let $ABCD$ be a cyclic quadrilateral with $\angle BAD < \angle ADC$. Let $M$ be the midpoint of the arc $CD$ not containing $A$. Suppose there is a point $P$ inside $ABCD$ such that $\angle ADB = \angle CPD$ and $\angle ADP = \angle PCB$. Prove that lines $AD, PM$, and $BC$ are concurrent.

Let $ABCD$ be a convex quadrilateral with $AB$ is not parallel to $CD$. Circle $\omega_1$ with center $O_1$ passes through $A$ and $B$, and touches segment $CD$ at $P$. Circle $\omega_2$ with center $O_2$ passes through $C$ and $D$, and touches segment $AB$ at $Q$. Let $E$ and $F$ be the intersection of circles $\omega_1$ and $\omega_2$. Prove that $EF$ bisects segment $PQ$ if and only if $BC$ is parallel to $AD$.

In a triangle $ABC$, let $D$ and $E$ trisect $BC$, so $BD = DE = EC$. Let $F$ be the point on $AB$ such that $\frac{AF}{F B}= 2$, and $G$ on $AC$ such that $\frac{AG}{GC} =\frac12$ . Let $P$ be the intersection of $DG$ and $EF$, and extend $AP$ to intersect $BC$ at a point $X$. Find $\frac{BX}{XC}$

Find all positive integers $n < 10^{100}$ for which simultaneously $n$ divides $2^n$, $n-1$ divides $2^n - 1$, and $n-2$ divides $2^n - 2$.

What are the last two digits of $9^{8^{.^{.^{.^2}}}}$ ?

The sum of several (not necessarily different) positive integers not exceeding $10$ is equal to $S$. Find all possible values of $S$ such that these numbers can always be partitioned into two groups with the sum of the numbers in each group not exceeding $70$. [i](I. Voronovich)[/i]

On a plane with a fixed coordinate system, there is a convex polygon whose all vertices have integer coordinates. Prove that twice the area of this polygon is an integer.