Find all pairs $(p,q)$ of real numbers such that $p+q=1998$ and the solutions of the equation $x^2+px+q=0$ are integers.

Given regular $1987$ -gon on plane with vertices $A_1, A_2,..., A_{1987}$. Find locus of points M of the plane sych that $$\left|\overrightarrow{MA_1}+\overrightarrow{MA_2}+...+\overrightarrow{MA_{1987}}\right| \le 1987$$.

Euhan and Minjune are playing a game. They choose a number $N$ so that they can only say integers up to $N$. Euhan starts by saying the $1$, and each player takes turns saying either $n+1$ or $4n$ (if possible), where $n$ is the last number said. The player who says $N$ wins. What is the smallest number larger than $2019$ for which Minjune has a winning strategy? [i]Proposed by Janabel Xia[/i]

A treasure is buried under a square of an $8\times 8$ board. Under each other square is a message which indicates the minimum number of steps needed to reach the square with the treasure. Each step takes one from a square to another square sharing a common side. What is the minmum number of squares we must dig up in order to bring up the treasure for sure?

The road infrastructure in a country consists of an even number of direct roads, each of which is bidirectional. Moreover, for any two cities $X$ and $Y$, there is at most one direct road between the two of them and there exists a sequence $X = X_0, X_1, ..., X_{n - 1}, X_n = Y$ of cities such that for any $i = 0, ..., n - 1$, there exists a direct road between $X_i$ and $X_{i + 1}$. Prove that all direct roads in this country can be oriented (i.e. each road can become a one-way road) such that each city $X$ is the starting point for an even number of direct roads. Proposed by [i]Mirko Petrushevski[/i]

Initially, two distinct positive integers $a$ and $b$ are written on a blackboard. At each step, Andrea picks two distinct numbers $x$ and $y$ on the blackboard and writes the number $gcd(x, y) + lcm(x, y)$ on the blackboard as well. Let $n$ be a positive integer. Prove that, regardless of the values of $a$ and $b$, Andrea can perform a finite number of steps such that a multiple of $n$ appears on the blackboard.

Let the set $A=(a_{1},a_{2},a_{3},a_{4})$ . If the sum of elements in every 3-element subset of $A$ makes up the set $B=(-1,5,3,8)$ , then find the set $A$.

A uniform disk ($ I = \dfrac {1}{2} MR^2 $) of mass 8.0 kg can rotate without friction on a fixed axis. A string is wrapped around its circumference and is attached to a 6.0 kg mass. The string does not slip. What is the tension in the cord while the mass is falling? [asy] size(250); pen p=linewidth(3), dg=gray(0.25), llg=gray(0.90), lg=gray(0.75),g=grey; void f(path P, pen p, pen q) { filldraw(P,p,q); } path P=CR((0,0),1); D((1,0)--(1,-2.5),p+lg); f(P,g,p); P=scale(0.4)*P; f(P,lg,p); path Q=arc((0,0),0.3,-40,130)--arc((-1,-1),0.5,130,320)--cycle; f(Q,llg,dg+p); P=scale(0.45)*P; f(P,llg,dg+p); P=shift((0.15,0.15))*((-1,-1)--(-1,-2)--(-1.1,-2)--(-1.1,-1.1)--(-2,-1.1)--(-2,-1)--cycle); f(P,llg,lg+p); P=shift((1.55,1.55))*scale(3)*P; f(P,llg,g+p); unfill((-1.23,-1.23)--(-1.23,-5)--(-5,-1.23)--cycle); clip((-3.8,-3.8)--(-3.8,3.8)--(3.8,3.8)--(3.8,-3.8)--cycle); P=(0.2,-2.5)--(1.8,-2.5)--(1.8,-4.1)--(0.2,-4.1)--cycle; f(P,llg,lg+p); MP("m",(1,-3.3),(0,0),fontsize(16)); MP("M",(0,-1),fontsize(16));[/asy] $ \textbf {(A) } \text {20.0 N} \qquad \textbf {(B) } \text {24.0 N} \qquad \textbf {(C) } \text {34.3 N} \qquad \textbf {(D) } \text {60.0 N} \qquad \textbf {(E) } \text {80.0 N} $

Let $ ABCD$ be a (not self-intersecting) quadrilateral satisfying $ \measuredangle DAB \equal{} \measuredangle BCD\neq 90^{\circ}$. Let $ X$ and $ Y$ be the orthogonal projections of the point $ D$ on the lines $ AB$ and $ BC$, and let $ Z$ and $ W$ be the orthogonal projections of the point $ B$ on the lines $ CD$ and $ DA$. Establish the following facts: [b]a)[/b] The quadrilateral $ XYZW$ is an isosceles trapezoid such that $ XY\parallel ZW$. [b]b)[/b] Let $ M$ be the midpoint of the segment $ AC$. Then, the lines $ XZ$ and $ YW$ pass through the point $ M$. [b]c)[/b] Let $ N$ be the midpoint of the segment $ BD$, and let $ X^{\prime}$, $ Y^{\prime}$, $ Z^{\prime}$, $ W^{\prime}$ be the midpoints of the segments $ AB$, $ BC$, $ CD$, $ DA$. Then, the point $ M$ lies on the circumcircles of the triangles $ W^{\prime}X^{\prime}N$ and $ Y^{\prime}Z^{\prime}N$. [hide="Notice"][i]Notice.[/i] This problem has been discussed at http://www.mathlinks.ro/Forum/viewtopic.php?t=172417 .[/hide]

Let $ k,m,n$ be integers such that $ 1 < n \leq m \minus{} 1 \leq k.$ Determine the maximum size of a subset $ S$ of the set $ \{1,2,3, \ldots, k\minus{}1,k\}$ such that no $ n$ distinct elements of $ S$ add up to $ m.$

Let $\phi = \frac{1+\sqrt5}{2}$. Prove that a positive integer appears in the list $$\lfloor \phi \rfloor , \lfloor 2 \phi \rfloor, \lfloor 3\phi \rfloor ,... , \lfloor n\phi \rfloor , ... $$ if and only if it appears exactly twice in the list $$\lfloor 1/ \phi \rfloor , \lfloor 2/ \phi \rfloor, \lfloor 3/\phi \rfloor , ... ,\lfloor n/\phi \rfloor , ... $$

We have $\vartriangle ABC$ with $I$ as its incenter. Let $D$ be the intersection of $AI$ and $BC$ and define $E, F$ in a similar way. Furthermore, let $Y = CI \cap DE, Z = BI \cap DF$. Prove that if $\angle BAC = 120^o$, then $E, F, Y,Z$ are concyclic. [img]https://1.bp.blogspot.com/-5IFojUbPE3o/XnSKTlTISqI/AAAAAAAALd0/0OwKMl02KJgqPs-SDOlujdcWXM0cWJiegCK4BGAYYCw/s1600/imoc2017%2Bg5.png[/img]

Let $n$ be an integer. Prove that the polynomial $f(x)$ has at most one zero, where \[ f(x) = x^4 - 1994 x^3 + (1993+n)x^2 - 11x + n . \] [i]Greece[/i]

A data set consists of $6$ (not distinct) positive integers: $1$, $7$, $5$, $2$, $5$, and $X$. The average (arithmetic mean) of the $6$ numbers equals a value in the data set. What is the sum of all positive values of $X$? $\textbf{(A) } 10 \qquad \textbf{(B) } 26 \qquad \textbf{(C) } 32 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 40$

For each positive integer $n$ write the sum $\sum_{i=}^{n}\frac{1}{i}=\frac{p_n}{q_n}$ with $\text{gcd}(p_n,q_n)=1$. Find all such $n$ such that $5\nmid q_n$.

Determine the smallest positive integer \( n \) with the following property: for every triple of positive integers \( x, y, z \), with \( x \) dividing \( y^3 \), \( y \) dividing \( z^3 \), and \( z \) dividing \( x^3 \), it also holds that \( (xyz) \) divides \( (x + y + z)^n \).