Let $P(x) = a_{1998}X^{1998} + a_{1997}X^{1997} +...+a_1X + a_0$ be a polynomial with real coefficients such that $P(0) \ne P (-1)$, and let $a, b$ be real numbers. Let $Q(x) = b_{1998}X^{1998} + b_{1997}X^{1997} +...+b_1X + b_0$ be the polynomial with real coefficients obtained by taking $b_k = aa_k + b$ ,$\forall k = 0, 1,2,..., 1998$. Show that if $Q(0) = Q (-1) \ne 0$ , then the polynomial $Q$ has no real roots.

Suppose that $p$ and $q$ are two different positive integers and $x$ is a real number. Form the product $(x+p)(x+q).$ Find the sum $S(x,n) = \sum (x+p)(x+q),$ where $p$ and $q$ take values from 1 to $n.$ Does there exist integer values of $x$ for which $S(x,n) = 0.$

Discuss $ \lim_{x\to 0}\frac{\lambda +\sin\frac{1}{x} \pm\cos\frac{1}{x}}{x} . $

$2020*N$ is a perfect cube. If $N$ can be expressed as $2^a*5^b*101^c,$ find the least possible value of $a+b+c$ such that $a,b,c$ are all positive integers and not necessarily distinct. [i]Proposed by Ephram Chun[/i]

There are$n$ balls numbered $1,2,\cdots,n$, respectively. They are painted with $4$ colours, red, yellow, blue, and green, according to the following rules: First, randomly line them on a circle. Then let any three clockwise consecutive balls numbered $i, j, k$, in order. 1) If $i>j>k$, then the ball $j$ is painted in red; 2) If $i<j<k$, then the ball $j$ is painted in yellow; 3) If $i<j, k<j$, then the ball $j$ is painted in blue; 4) If $i>j, k>j$, then the ball $j$ is painted in green. And now each permutation of the balls determine a painting method. We call two painting methods distinct, if there exists a ball, which is painted with two different colours in that two methods. Find out the number of all distinct painting methods.

A game is played between two players on a $10 \times 10$ checkerboard. They move alternately, the first player marking $X$s on vacant cells and the second $O$s. When all $100$ cells have been marked, they calculate two numbers $C$ and $Z$. $C$ is the total number of five consecutive $X$s in a row, a column or a diagonal, so that $6$ consecutive $X$s contribute a count of $2$ to $C$, $7$ consecutive $X$s contribute $3$, and so on. Similarly, $Z$ is the total number of five consecutive Os. The first player wins if $C > Z$, loses if $C < Z$ and draws if $C = Z$. Does the first player have a strategy which guarantees (a) a draw or a win (b) a win regardless of the counter-strategy of the second player? (A Belov)

Determine all sets of real numbers $S$ such that: [list] [*] $1$ is the smallest element of $S$, [*] for all $x,y\in S$ such that $x>y$, $\sqrt{x^2-y^2}\in S$ [/list] [i]Adian Anibal Santos Sepcic[/i]

The circles $(R, r)$ and $(P, \rho)$, where $r > \rho$, touch externally at $A$. Their direct common tangent touches $(R, r)$ at B and $(P, \rho)$ at $C$. The line $RP$ meets the circle $(P, \rho)$ again at $D$ and the line $BC$ at $E$. If $|BC| = 6|DE|$, prove that: [b](a)[/b] the lengths of the sides of the triangle $RBE$ are in an arithmetic progression, and [b](b)[/b] $|AB| = 2|AC|.$

Is the infinite series $$\sum_{n=1}^{\infty} \frac{1}{n^{1+\frac{1}{n}}}$$ convergent?

If $x=1+2^p$ and $y=1+2^{-p}$, then $y$ in terms of $x$ is: $\textbf{(A) }\dfrac{x+1}{x-1}\qquad\textbf{(B) }\dfrac{x+2}{x-1}\qquad\textbf{(C) }\dfrac{x}{x-1}\qquad\textbf{(D) }2-x\qquad \textbf{(E) }\dfrac{x-1}{x}$

In the triangle $\triangle ABC$, let $G$ be the centroid, and let $I$ be the center of the inscribed circle.  Let $\alpha$ and $\beta$ be the angles at the vertices $A$ and $B$, respectively.  Suppose that the segment $IG$ is parallel to $AB$ and that $\beta = 2\tan^{-1}(1/3)$.  Find $\alpha$.

Find all integer solutions of the equation $a^3+3ab^2+7b^3=2011$.

We call a function $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ [i]good[/i] if for all $x,y \in \mathbb{Q}^+$ we have: $$f(x)+f(y)\geq 4f(x+y).$$ a) Prove that for all good functions $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ and $x,y,z \in \mathbb{Q}^+$ $$f(x)+f(y)+f(z) \geq 8f(x+y+z)$$ b) Does there exists a good functions $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ and $x,y,z \in \mathbb{Q}^+$ such that $$f(x)+f(y)+f(z) < 9f(x+y+z) ?$$

For a positive integer $n$, let $\alpha(n)$ be the arithmetic mean of the divisors of $n$, and let $\beta(n)$ be the arithmetic mean of the numbers $k \le n$ with $\text{gcd}(k,n)=1$. Determine all positive integers $n$ with $\alpha(n)=\beta(n)$.

We have $2p-1$ integer numbers, where $p$ is a prime number. Prove that we can choose exactly $p$ numbers (from these $2p-1$ numbers) so that their sum is divisible by $p$.

A square measuring $15$ by $15$ is partitioned into five rows of five congruent squares as shown below. The small squares are alternately colored black and white as shown. Find the total area of the part colored black. [asy] size(150); defaultpen(linewidth(0.8)); int i,j; for(i=1;i<=5;i=i+1) { for(j=1;j<=5;j=j+1) { if (floor((i+j)/2)==((i+j)/2)) { filldraw(shift((i-1,j-1))*unitsquare,gray); } else { draw(shift((i-1,j-1))*unitsquare); } } } [/asy]

Consider the prime numbers $p_1,p_2,\dots ,p_{2021}$ such that the sum $$p_1^4+p_2^4+\dots +p_{2021}^4$$ is divisible by $6060$. Prove that at least $4$ of these prime numbers are less than $2021$. $\textit{Stefan Bălăucă}$

A positive integer $b$ and a sequence $a_0,a_1,a_2,\dots$ of integers $0\le a_i<b$ is given. It is known that $a_0\neq 0$ and the sequence $\{a_i\}$ is eventually periodic but has infinitely many nonzero terms. Let $S$ be the set of positive integers $n$ so that $n\mid (a_0a_1\dots a_n)_b$. Given that $S$ is infinite, show that there are infinitely many primes that divide at least one element of $S$. [i]Proposed by Carl Schildkraut and Holden Mui[/i]

Solve the equation $4xy-x-y=z^2$ in positive integers.

Let $ABC$ be a triangle inscribed in circle $\omega$, and let the medians from $B$ and $C$ intersect $\omega$ at $D$ and $E$ respectively. Let $O_1$ be the center of the circle through $D$ tangent to $AC$ at $C$, and let $O_2$ be the center of the circle through $E$ tangent to $AB$ at $B$. Prove that $O_1$, $O_2$, and the nine-point center of $ABC$ are collinear. [i]Proposed by Michael Kural[/i]

Compute the sum of all prime numbers $p$ with $p \ge 5$ such that $p$ divides $(p + 3)^{p-3} + (p + 5)^{p-5}$. .

Show that it is possible to color the points of $\mathbb Q\times\mathbb Q$ in two colors in such a way that any two points having distance $1$ have distinct colors.

Let $M$ be the set of all integers from $1$ to $2013$. Each subset of $M$ is given one of $k$ available colors, with the only condition that if the union of two different subsets $A$ and $B$ is $M$, then $A$ and $B$ are given different colors. What is the least possible value of $k$?

For the nonnegative numbers $a, b, c$ prove the inequality: $$\frac{a}{b+c}+\frac{b}{c+a}+\frac{c}{a+b}+\sqrt{\frac{ab+bc+ca}{a^2+b^2+c^2}}\ge \frac52$$

Let $S$ be a nonempty set of primes satisfying the property that for each proper subset $P$ of $S$, all the prime factors of the number $\left(\prod_{p\in P}p\right)-1$ are also in $S$. Determine all possible such sets $S$.