Find one real value of $x$ satisfying $\frac{x^7}{7}=1+\sqrt[7]{10}x\left(x^2-\sqrt[7]{10}\right)^2$.

Circles $ \omega_1$ and $ \omega_2$ meet at $ P$ and $ Q$. Segments $ AC$ and $ BD$ are chords of $ \omega_1$ and $ \omega_2$ respectively, such that segment $ AB$ and ray $ CD$ meet at $ P$. Ray $ BD$ and segment $ AC$ meet at $ X$. Point $ Y$ lies on $ \omega_1$ such that $ PY \parallel BD$. Point $ Z$ lies on $ \omega_2$ such that $ PZ \parallel AC$. Prove that points $ Q,X,Y,Z$ are collinear.

Let $(P_n(X))_{n\in\mathbb{N}}$ be a sequence of polynomials defined as: $P_1(X)=X-1, P_2(X)=X^2-X-1, P_n(X)=XP_{n-1}(X)-P_{n-2}(X), \forall n>2$. For every nonnegative integer $n{}$ find all roots of the polynomial $P_n(X)$.

Let $A,B,C$ be real square matrices of the same order, and suppose $A$ is invertible. Prove that \[ (A-B)C=BA^{-1}\implies C(A-B)=A^{-1}B \]

Let $x_1,x_2,...,x_{1994}$ be positive real numbers. Prove that $$\left(\frac{x_1}{x_2}\right)^{\frac{x_1}{x_2}}\left(\frac{x_2}{x_3}\right)^{\frac{x_2}{x_3}}...\left(\frac{x_{1993}}{x_{1994}}\right)^{\frac{x_{1993}}{x_{1994}}} \ge \left(\frac{x_1}{x_2}\right)^{\frac{x_2}{x_1}}\left(\frac{x_2}{x_3}\right)^{\frac{x_3}{x_2}}...\left(\frac{x_{1993}}{x_{1994}}\right)^{\frac{x_{1994}}{x_{1993}}}$$

[b]10.[/b] Prove that if a graph with $2n+1$ vertices has at least $3n+1$ edges, then the graph contains a circuit having an even number of edges. Prove further that this statemente does not hold for $3n$ edges. (By a circuit, we mean a closed line which does not intersect itself.) [b](C. 5)[/b]

Let $ n\ge 3$ be an integer. Let $ f(x)$ and $ g(x)$ be polynomials with real coefficients such that the points $ (f(1),g(1)),(f(2),g(2)),\dots,(f(n),g(n))$ in $ \mathbb{R}^2$ are the vertices of a regular $ n$-gon in counterclockwise order. Prove that at least one of $ f(x)$ and $ g(x)$ has degree greater than or equal to $ n\minus{}1.$

Given a triangle $ABC$, a line $\delta$ and a constant $k$, distinct from $0$ and $1,M$ a variable point on the line $\delta$. Points $E, F$ are on $MB,MC$ respectively such that $\frac{\overline{ME}}{\overline{MB}} = \frac{\overline{MF}}{\overline{MC}} = k$. Points $P,Q$ are on $AB,AC$ such that $PE, QF$ are perpendicular to $\delta$. Prove that the line through $M$ perpendicular to $PQ$ has a fixed point. Nguyễn Minh Hà

Let $u_0, u_1, u_2, \ldots$ be integers such that $u_0 = 100$; $u_{k+2} \geqslant 2 + u_k$ for all $k \geqslant 0$; and $u_{\ell+5} \leqslant 5 + u_\ell$ for all $\ell \geqslant 0$. Find all possible values for the integer $u_{2023}$.

How many non-isomorphic graphs with $9$ vertices, with each vertex connected to exactly $6$ other vertices, are there? (Two graphs are isomorphic if one can relabel the vertices of one graph to make all edges be exactly the same.)

The prime numbers $p$ and $q$ and the integer $a$ are chosen such that $p> 2$ and $a \not\equiv 1$ (mod $q$), but $a^p \equiv 1$ (mod $q$). Prove that $(1 + a^1)(1 + a^2)...(1 + a^{p - 1})\equiv 1$ (mod $q$) .

There are $n$ blocks placed on the unit squares of a $n \times n$ chessboard such that there is exactly one block in each row and each column. Find the maximum value $k$, in terms of $n$, such that however the blocks are arranged, we can place $k$ rooks on the board without any two of them threatening each other. (Two rooks are not threatening each other if there is a block lying between them.)

Prove that if $a,b,c>0,$ then \[ \frac{ab}{3a+4b+5c}+\frac{bc}{3b+4c+5a}+\frac{ca}{3c+4a+5b}\le \frac{a+b+c}{12}. \] [i] Nikolai Nikolov[/i]

Determine the prime numbers $p, q, r$ with the property that: $p(p-7) + q (q-7) = r (r-7)$.

Let $\gamma$ be the incircle in the triangle $A_0A_1A_2$. For all $i\in\{0,1,2\}$ we make the following constructions (all indices are considered modulo 3): $\gamma_i$ is the circle tangent to $\gamma$ which passes through the points $A_{i+1}$ and $A_{i+2}$; $T_i$ is the point of tangency between $\gamma_i$ and $\gamma$; finally, the common tangent in $T_i$ of $\gamma_i$ and $\gamma$ intersects the line $A_{i+1}A_{i+2}$ in the point $P_i$. Prove that a) the points $P_0$, $P_1$ and $P_2$ are collinear; b) the lines $A_0T_0$, $A_1T_1$ and $A_2T_2$ are concurrent.

The figure below shows a $9\times7$ arrangement of $2\times2$ squares. Alternate squares of the grid are split into two triangles with one of the triangles shaded. Find the area of the shaded region. [asy] size(5cm); defaultpen(linewidth(.6)); fill((0,1)--(1,1)--(1,0)--cycle^^(0,3)--(1,3)--(1,2)--cycle^^(1,2)--(2,2)--(2,1)--cycle^^(2,1)--(3,1)--(3,0)--cycle,rgb(.76,.76,.76)); fill((0,5)--(1,5)--(1,4)--cycle^^(1,4)--(2,4)--(2,3)--cycle^^(2,3)--(3,3)--(3,2)--cycle^^(3,2)--(4,2)--(4,1)--cycle^^(4,1)--(5,1)--(5,0)--cycle,rgb(.76,.76,.76)); fill((0,7)--(1,7)--(1,6)--cycle^^(1,6)--(2,6)--(2,5)--cycle^^(2,5)--(3,5)--(3,4)--cycle^^(3,4)--(4,4)--(4,3)--cycle^^(4,3)--(5,3)--(5,2)--cycle^^(5,2)--(6,2)--(6,1)--cycle^^(6,1)--(7,1)--(7,0)--cycle,rgb(.76,.76,.76)); fill((2,7)--(3,7)--(3,6)--cycle^^(3,6)--(4,6)--(4,5)--cycle^^(4,5)--(5,5)--(5,4)--cycle^^(5,4)--(6,4)--(6,3)--cycle^^(6,3)--(7,3)--(7,2)--cycle^^(7,2)--(8,2)--(8,1)--cycle^^(8,1)--(9,1)--(9,0)--cycle,rgb(.76,.76,.76)); fill((4,7)--(5,7)--(5,6)--cycle^^(5,6)--(6,6)--(6,5)--cycle^^(6,5)--(7,5)--(7,4)--cycle^^(7,4)--(8,4)--(8,3)--cycle^^(8,3)--(9,3)--(9,2)--cycle,rgb(.76,.76,.76)); fill((6,7)--(7,7)--(7,6)--cycle^^(7,6)--(8,6)--(8,5)--cycle^^(8,5)--(9,5)--(9,4)--cycle,rgb(.76,.76,.76)); fill((8,7)--(9,7)--(9,6)--cycle,rgb(.76,.76,.76)); draw((0,0)--(0,7)^^(1,0)--(1,7)^^(2,0)--(2,7)^^(3,0)--(3,7)^^(4,0)--(4,7)^^(5,0)--(5,7)^^(6,0)--(6,7)^^(7,0)--(7,7)^^(8,0)--(8,7)^^(9,0)--(9,7)); draw((0,0)--(9,0)^^(0,1)--(9,1)^^(0,2)--(9,2)^^(0,3)--(9,3)^^(0,4)--(9,4)^^(0,5)--(9,5)^^(0,6)--(9,6)^^(0,7)--(9,7)); draw((0,1)--(1,0)^^(0,3)--(3,0)^^(0,5)--(5,0)^^(0,7)--(7,0)^^(2,7)--(9,0)^^(4,7)--(9,2)^^(6,7)--(9,4)^^(8,7)--(9,6)); [/asy]

In the game of Guess the Card, two players each have a $\frac{1}{2}$ chance of winning and there is exactly one winner. Sixteen competitors stand in a circle, numbered $1,2,\dots,16$ clockwise. They participate in an $4$-round single-elimination tournament of Guess the Card. Each round, the referee randomly chooses one of the remaining players, and the players pair off going clockwise, starting from the chosen one; each pair then plays Guess the Card and the losers leave the circle. If the probability that players $1$ and $9$ face each other in the last round is $\frac{m}{n}$ where $m,n$ are positive integers, find $100m+n$. [i]Proposed by Evan Chen[/i]

Let $ p \geq 2$ be a prime number. Eduardo and Fernando play the following game making moves alternately: in each move, the current player chooses an index $i$ in the set $\{0,1,2,\ldots, p-1 \}$ that was not chosen before by either of the two players and then chooses an element $a_i$ from the set $\{0,1,2,3,4,5,6,7,8,9\}$. Eduardo has the first move. The game ends after all the indices have been chosen .Then the following number is computed: $$M=a_0+a_110+a_210^2+\cdots+a_{p-1}10^{p-1}= \sum_{i=0}^{p-1}a_i.10^i$$. The goal of Eduardo is to make $M$ divisible by $p$, and the goal of Fernando is to prevent this. Prove that Eduardo has a winning strategy. [i]Proposed by Amine Natik, Morocco[/i]

Square $ABCD$ has side length $4$. Points $E$ and $F$ are the midpoints of sides $AB$ and $CD$, respectively. Eight $1$ by $2$ rectangles are placed inside the square so that no two of the eight rectangles overlap (see diagram). If the arrangement of eight rectangles is chosen randomly, then there are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that none of the rectangles crosses the line segment $EF$ (as in the arrangement on the right). Find $m + n$. [asy] size(200); defaultpen(linewidth(0.8)+fontsize(10pt)); real r = 7; path square=origin--(4,0)--(4,4)--(0,4)--cycle; draw(square^^shift((r,0))*square,linewidth(1)); draw((1,4)--(1,0)^^(3,4)--(3,0)^^(0,2)--(1,2)^^(1,3)--(3,3)^^(1,1)--(3,1)^^(2,3)--(2,1)^^(3,2)--(4,2)); draw(shift((r,0))*((2,4)--(2,0)^^(0,2)--(4,2)^^(0,1)--(4,1)^^(0,3)--(2,3)^^(3,4)--(3,2))); label("A",(4,4),NE); label("A",(4+r,4),NE); label("B",(0,4),NW); label("B",(r,4),NW); label("C",(0,0),SW); label("C",(r,0),SW); label("D",(4,0),SE); label("D",(4+r,0),SE); label("E",(2,4),N); label("E",(2+r,4),N); label("F",(2,0),S); label("F",(2+r,0),S); [/asy]

(a) Prove that $x^4+3x^3+6x^2+9x+12$ cannot be expressed as product of two polynomials of degree 2 with integers coefficients. (b) $2n+1$ segments are marked on a line. Each of these segments intersects at least $n$ other segments. Prove that one of these segments intersects all other segments.

Given a set of 102 elements. Is it possible to choose 102 17-element subsets so that the intersection of any two subsets contains no more than 3 elements?

Prove that for all $\displaystyle a,b \in \left( 0 ,\frac{\pi}{4} \right)$ and $\displaystyle n \in \mathbb N^\ast$ we have \[ \frac{\sin^n a + \sin^n b}{\left( \sin a + \sin b \right)^n} \geq \frac{\sin^n 2a + \sin^n 2b}{\left( \sin 2a + \sin 2b \right)^n} . \]

Determine for what $n\ge 3$ integer numbers, it is possible to find positive integer numbers $a_1 < a_2 < ...< a_n$ such $\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_n}=1$ and $a_1 a_2\cdot\cdot\cdot a_n$ is a perfect square.

Let the roots of $x^2-3x+1=0$ be $r$ and $s$. Then the expression $r^2+s^2$ is: $ \textbf{(A)}\ \text{a positive integer} \qquad\textbf{(B)}\ \text{a positive fraction greater than 1}\qquad\textbf{(C)}\ \text{a positive fraction less than 1}$ $\textbf{(D)}\ \text{an irrational number}\qquad\textbf{(E)}\ \text{an imaginary number}$

Define the sequence of positive integers $f_n$ by $f_0 = 1, f_1 = 1, f_{n+2} = f_{n+1} + f_n$. Show that $f_n =\frac{ (a^{n+1} - b^{n+1})}{\sqrt5}$, where $a, b$ are real numbers such that $a + b = 1, ab = -1$ and $a > b$.