Let [i]Revolution[/i]$(x) = x^3 +Ux^2 +Sx + A$, where $U$, $S$, and $A$ are all integers and $U +S + A +1 = 1773$. Given that [i]Revolution[/i] has exactly two distinct nonzero integer roots $G$ and $B$, find the minimum value of $|GB|$. [i]Proposed by Jacob Xu[/i] [hide=Solution] [i]Solution.[/i] $\boxed{392}$ Notice that $U + S + A + 1$ is just [i]Revolution[/i]$(1)$ so [i]Revolution[/i]$(1) = 1773$. Since $G$ and $B$ are integer roots we write [i]Revolution[/i]$(X) = (X-G)^2(X-B)$ without loss of generality. So Revolution$(1) = (1-G)^2(1-B) = 1773$. $1773$ can be factored as $32 \cdot 197$, so to minimize $|GB|$ we set $1-G = 3$ and $1-B = 197$. We get that $G = -2$ and $B = -196$ so $|GB| = \boxed{392}$. [/hide]

Consider $\triangle ABC$ an isosceles triangle such that $AB = BC$. Let $P$ be a point satisfying $$\angle ABP = 80^\circ, \angle CBP = 20^\circ, \textrm{and} \hspace{0.17cm} AC = BP$$ Find all possible values of $\angle BCP$.

A pedestrian walked for $3.5$ hours. In every period of one hour’s duration he walked $5$ kilometres. Is it true that his average speed was $5$ kilometres per hour? (NN Konstantinov, Moscow)

Two players take turns alternatively and remove a number from $1,2,\dots,1000$. Players can not remove a number that differ with a number already removed by $1$ also they can not remove a number such that it sums up with another removed number to $1001$. The player who can not move loses. Determine the winner.

Find all positive integers $k$ for which there exist positive integers $x, y$, such that $\frac{x^ky}{x^2+y^2}$ is a prime.

The coefficients of the equation $ ax^2\plus{}bx\plus{}c\equal{}0$, where $ a\ne 0$, satisfy the inequality $ (a\plus{}b\plus{}c)(4a\minus{}2b\plus{}c)<0$. Prove that this equation has $ 2$ real distinct solutions.

Let $ABC$ a acute triangle. (a) Find the locus of all the points $P$ such that, calling $O_{a}, O_{b}, O_{c}$ the circumcenters of $PBC$, $PAC$, $PAB$: \[\frac{ O_{a}O_{b}}{AB}= \frac{ O_{b}O_{c}}{BC}=\frac{ O_{c}O_{a}}{CA}\] (b) For all points $P$ of the locus in (a), show that the lines $AO_{a}$, $BO_{b}$ , $CO_{c}$ are cuncurrent (in $X$); (c) Show that the power of $X$ wrt the circumcircle of $ABC$ is: \[-\frac{ a^{2}+b^{2}+c^{2}-5R^{2}}4\] Where $a=BC$ , $b=AC$ and $c=AB$.

For which real $a$ are there distinct reals $x$, $y$ such that $$\begin{cases} x = a - y^2 \\ y = a - x^2 \,\,\, ? \end {cases}$$

Rectangle $ABCD$ has $AB=5$ and $BC=4$. Point $E$ lies on $\overline{AB}$ so that $EB=1$, point $G$ lies on $\overline{BC}$ so that $CG=1$. and point $F$ lies on $\overline{CD}$ so that $DF=2$. Segments $\overline{AG}$ and $\overline{AC}$ intersect $\overline{EF}$ at $Q$ and $P$, respectively. What is the value of $\frac{PQ}{EF}$? [asy] pair A1=(2,0),A2=(4,4); pair B1=(0,4),B2=(5,1); pair C1=(5,0),C2=(0,4); draw(A1--A2); draw(B1--B2); draw(C1--C2); draw((0,0)--B1--(5,4)--C1--cycle); dot((20/7,12/7)); dot((3.07692307692,2.15384615384)); label("$Q$",(3.07692307692,2.15384615384),N); label("$P$",(20/7,12/7),W); label("$A$",(0,4), NW); label("$B$",(5,4), NE); label("$C$",(5,0),SE); label("$D$",(0,0),SW); label("$F$",(2,0),S); label("$G$",(5,1),E); label("$E$",(4,4),N); dot(A1); dot(A2); dot(B1); dot(B2); dot(C1); dot(C2); dot((0,0)); dot((5,4));[/asy] $\textbf{(A)}~\frac{\sqrt{13}}{16} \qquad \textbf{(B)}~\frac{\sqrt{2}}{13} \qquad \textbf{(C)}~\frac{9}{82} \qquad \textbf{(D)}~\frac{10}{91}\qquad \textbf{(E)}~\frac19$

A pair of positive integer numbers \((a, b)\) is given. It turns out that for every positive integer number \(n\), for which the numbers \((n - a)(n + b)\) and \(n^2 - ab\) are positive, they have the same number of divisors. Is it necessarily true that \(a = b\)? [i]Proposed by Oleksii Masalitin[/i]

Prove that there exists an integer $n \geq 1$, such that number of all pairs $(a, b)$ of positive integers, satisfying $$\frac{1}{a-b}-\frac{1}{a}+\frac{1}{b}=\frac{1}{n}$$ exceeds $2024.$

Let $a_0$, $a_1$, $a_2$, ... be an infinite sequence of real numbers satisfying the equation $a_n=\left|a_{n+1}-a_{n+2}\right|$ for all $n\geq 0$, where $a_0$ and $a_1$ are two different positive reals. Can this sequence $a_0$, $a_1$, $a_2$, ... be bounded? [i]Proposed by Mihai Bălună, Romania[/i]

Quadrilateral $ABCD$ is a parallelogram, and $E$ is the midpoint of the side $\overline{AD}$. Let $F$ be the intersection of lines $EB$ and $AC$. What is the ratio of the area of quadrilateral $CDEF$ to the area of triangle $CFB$? $\textbf{(A) } 5 : 4 \qquad \textbf{(B) } 4 : 3 \qquad \textbf{(C) } 3 : 2 \qquad \textbf{(D) } 5 : 3 \qquad \textbf{(E) } 2 : 1$

Stekel and Prick play a game on an $ m \times n$ board, where $m$ and $n$ are positive are integers. They alternate turns, with Stekel starting. Spine bets on his turn, he always takes a pawn on a square where there is no pawn yet. Prick does his turn the same, but his pawn must always come into a square adjacent to the square that Spike just placed a pawn in on his previous turn. Prick wins like the whole board is full of pawns. Spike wins if Prik can no longer move a pawn on his turn, while there is still at least one empty square on the board. Determine for all pairs $(m, n)$ who has a winning strategy.

Given positive integer $n$, find the biggest real number $C$ which satisfy the condition that if the sum of the reciprocals of a set of integers (They can be the same.) that are greater than $1$ is less than $C$, then we can divide the set of numbers into no more than $n$ groups so that the sum of reciprocals of every group is less than $1$.

Let $f \in Z[X]$, $f = X^2 + aX + b$, be a quadratic polynomial. Prove that $f$ has integer zeros if and only if for each positive integer $n$ there is an integer $u_n$ such that $n | f(u_n)$.