Consider all products by $2, 4, 6, ..., 2000$ of the elements of the set $A =\left\{\frac12, \frac13, \frac14,...,\frac{1}{2000},\frac{1}{2001}\right\}$ . Find the sum of all these products.

The polynomials $f(x)$ and $g(x)$ are given. The points $A_1(f(1),g(1)),\ldots,A_n(f(n),g(n))$ are marked on the coordinate plane. It turns out that $A_1\ldots A_n$ is a regular $n{}$-gon. Prove that the degree of at least one of $f{}$ and $g{}$ is at least $n-1$. [i]Proposed by V. Bragin[/i]

Let $A =\left\{a = q + \frac{1}{q }/ q \in Q^*,q > 0 \right\}$, $A + A = \{a + b |a,b \in A\}$,$A \cdot A =\{a \cdot b | a, b \in A\}$. Prove that: i) $A + A \ne A \cdot A$ ii) $(A + A) \cap N = (A \cdot A) \cap N$. Vasile Pop

[b]p16.[/b] Let $P(x)$ be a quadratic such that $P(-2) = 10$, $P(0) = 5$, $P(3) = 0$. Then, find the sum of the coefficients of the polynomial equal to $P(x)P(-x)$. [b]p17.[/b] Suppose that $a < b < c < d$ are positive integers such that the pairwise differences of $a, b, c, d$ are all distinct, and $a + b + c + d$ is divisible by $2023$. Find the least possible value of $d$. [b]p18.[/b] Consider a right rectangular prism with bases $ABCD$ and $A'B'C'D'$ and other edges $AA'$, $BB'$, $CC'$ and $DD'$. Suppose $AB = 1$, $AD = 2$, and $AA' = 1$. $\bullet$ Let $X$ be the plane passing through $A$, $C'$, and the midpoint of $BB'$. $\bullet$ Let $Y$ be the plane passing through $D$, $B'$, and the midpoint of $CC'$. Then the intersection of $X$, $Y$ , and the prism is a line segment of length $\ell$. Find $\ell$. PS. You should use hide for answers.

Let $a,b \in [0,1], c \in [-1,1]$ be reals chosen independently and uniformly at random. What is the probability that $p(x) = ax^2+bx+c$ has a root in $[0,1]$?

Find all triplets $(x,y,z)\in\mathbb{R}^3$ such that \begin{align*} x^2-yz &= |y-z|+1, \\ y^2-zx &= |z-x|+1, \\ z^2-xy &= |x-y|+1. \end{align*}

In the coordinate plane,the graps of functions $y=sin x$ and $y=tan x$ are drawn, along with the coordinate axes. Using compass and ruler, construct a line tangent to the graph of sine at a point above the axis, $Ox$, as well at a point below that axis (the line can also meet the graph at several other points)

Let $ a\geq 2$ be a real number; with the roots $ x_{1}$ and $ x_{2}$ of the equation $ x^2\minus{}ax\plus{}1\equal{}0$ we build the sequence with $ S_{n}\equal{}x_{1}^n \plus{} x_{2}^n$. [b]a)[/b]Prove that the sequence $ \frac{S_{n}}{S_{n\plus{}1}}$, where $ n$ takes value from $ 1$ up to infinity, is strictly non increasing. [b]b)[/b]Find all value of $ a$ for the which this inequality hold for all natural values of $ n$ $ \frac{S_{1}}{S_{2}}\plus{}\cdots \plus{}\frac{S_{n}}{S_{n\plus{}1}}>n\minus{}1$

Let $ R$ be a bounded domain of area $ t$ in the plane, and let $ C$ be its center of gravity. Denoting by $ T_{AB}$ the circle drawn with the diameter $ AB$, let $ K$ be a circle that contains each of the circles $ T_{AB} \;(A,B \in R)$. Is it true in general that $ K$ contains the circle of area $ 2t$ centered at $ C$? [i]J. Szucs[/i]

Consider the sequence $a_1, a_2, a_3, ...$ defined by $a_1 = 9$ and $a_{n + 1} = \frac{(n + 5)a_n + 22}{n + 3}$ for $n \ge 1$. Find all natural numbers $n$ for which $a_n$ is a perfect square of an integer.

There is a sequence of numbers $+1$ and $-1$ of length $n$. It is known that the sum of every $10$ neighbouring numbers in the sequence is $0$ and that the sum of every $12$ neighbouring numbers in the sequence is not zero. What is the maximal value of $n$?

If $a, b, c$ are positive real numbers, prove that $$\frac{a}{\sqrt{(a + 2b)^3}}+\frac{b}{\sqrt{(b + 2c)^3}} +\frac{c} {\sqrt{(c + 2a)^3}} \ge \frac{1}{\sqrt{a + b + c}}$$ Alexandru Mihalcu

Determine all $x\in(0,3/4)$ which satisfy \[\log_x(1-x)+\log_2\frac{1-x}{x}=\frac{1}{(\log_2x)^2}.\]

Rational numbers $a$ and $b$ satisfy the equality $$a^3b+ab^3+2a^2b^2+2a + 2b + 1 = 0. $$ Prove that the number $1-ab$ is the square of the rational numbers.

We define the [i]Fibonacci sequence[/i] $\{F_n\}_{n\ge0}$ by $F_0=0$, $F_1=1$, and for $n\ge2$, $F_n=F_{n-1}+F_{n-2}$; we define the [i]Stirling number of the second kind[/i] $S(n,k)$ as the number of ways to partition a set of $n\ge1$ distinguishable elements into $k\ge1$ indistinguishable nonempty subsets. For every positive integer $n$, let $t_n = \sum_{k=1}^{n} S(n,k) F_k$. Let $p\ge7$ be a prime. Prove that \[ t_{n+p^{2p}-1} \equiv t_n \pmod{p} \] for all $n\ge1$. [i]Proposed by Victor Wang[/i]

Let $P_0(x) = x^3 + 313x^2 - 77x - 8$. For integers $n \ge 1$, define $P_n(x) = P_{n - 1}(x - n)$. What is the coefficient of $x$ in $P_{20}(x)$?

For a positive integer $n$ and a nonzero digit $d$, let $f(n, d)$ be the smallest positive integer $k$, such that $kn$ starts with $d$. What is the maximal value of $f(n, d)$, over all positive integers $n$ and nonzero digits $d$?

Let $n$ be a natural number and the polynomial, $P(x)=x^n+n$. $(a)$ Is it possible that for some odd number $n$ , the polynomial $P(x)$ is composite for all natural numbers $x$. $(b)$ Is it possible that for some even number $n$ , the polynomial $P(x)$ is composite for all natural numbers $x$. Reason your answers.

Suppose that $P$ is the polynomial of least degree with integer coefficients such that $$P(\sqrt{7} + \sqrt{5}) = 2(\sqrt{7} - \sqrt{5})$$Find $P(2)$.

Let $ a_1, a_2, \ldots , a_n$ be distinct positive integers and let $ M$ be a set of $ n \minus{} 1$ positive integers not containing $ s \equal{} a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n.$ A grasshopper is to jump along the real axis, starting at the point $ 0$ and making $ n$ jumps to the right with lengths $ a_1, a_2, \ldots , a_n$ in some order. Prove that the order can be chosen in such a way that the grasshopper never lands on any point in $ M.$ [i]Proposed by Dmitry Khramtsov, Russia[/i]

Let $n \geq 2$ be an integer and $x_1, x_2, \ldots, x_n$ be positive real numbers such that $\sum_{i=1}^nx_i=1$. Show that $$\bigg(\sum_{i=1}^n\frac{1}{1-x_i}\bigg)\bigg(\sum_{1 \leq i < j \leq n}x_ix_j\bigg) \leq \frac{n}{2}.$$

Define functions $f$ and $g$ as nonconstant, differentiable, real-valued functions on $R$. If $f(x+y)=f(x)f(y)-g(x)g(y)$, $g(x+y)=f(x)g(y)+g(x)f(y)$, and $f'(0)=0$, prove that $\left(f(x)\right)^2+\left(g(x)\right)^2=1$ for all $x$.

Determine all monic polynomials $ p(x)$ of fifth degree having real coefficients and the following property: Whenever $ a$ is a (real or complex) root of $ p(x)$, then so are $ \frac{1}{a}$ and $ 1\minus{}a$.

The numbers $2, 2, ..., 2$ are written on a blackboard (the number $2$ is repeated $n$ times). One step consists of choosing two numbers from the blackboard, denoting them as $a$ and $b$, and replacing them with $\sqrt{\frac{ab + 1}{2}}$. $(a)$ If $x$ is the number left on the blackboard after $n - 1$ applications of the above operation, prove that $x \ge \sqrt{\frac{n + 3}{n}}$. $(b)$ Prove that there are infinitely many numbers for which the equality holds and infinitely many for which the inequality is strict.

Prove for each non-negative integer $n$ and real number $x$ the inequality \[ \sin{x} \cdot(n \sin{x}-\sin{nx}) \geq 0 \]