Nicu plays the Next game on the computer. Initially the number $S$ in the computer has the value $S = 0$. At each step Nicu chooses a certain number $a$ ($0 <a <1$) and enters it in computer. The computer arbitrarily either adds this number $a$ to the number $S$ or it subtracts from $S$ and displays on the screen the new result for $S$. After that Nicu does Next step. It is known that among any $100$ consecutive operations the computer the at least once apply the assembly. Give an arbitrary number $M> 0$. Show that there is a strategy for Nicu that will always allow him after a finite number of steps to get a result $S> M$. [hide=original wording]Nicu joacă la calculator următorul joc. Iniţial numărul S din calculator are valoarea S = 0. La fiecare pas Nicu alege un număr oarecare a (0 < a < 1) şi îl introduce în calculator. Calculatorul, în mod arbitrar, sau adună acest număr a la numărul S sau îl scade din S şi afişează pe ecran rezultatul nou pentru S. După aceasta Nicu face următorul pas. Se ştie că printre oricare 100 de operaţii consecutive calculatorul cel puţin o dată aplică adunarea. Fie dat un număr arbitrar M > 0. Să se arate că există o strategie pentru Nicu care oricând îi va permite lui după un număr finit de paşi să obţină un rezulat S > M.[/hide]

The polynomial $P(x) = x^3 - 6x - 2$ has three real roots, $\alpha$, $\beta$, and $\gamma$. Depending on the assignment of the roots, there exist two different quadratics $Q$ such that the graph of $y=Q(x)$ pass through the points $(\alpha,\beta)$, $(\beta,\gamma)$, and $(\gamma,\alpha)$. What is the larger of the two values of $Q(1)$?

Alice has got a circular key ring with $n$ keys, $n\ge3$. When she takes it out of her pocket, she does not know whether it got rotated and/or flipped. The only way she can distinguish the keys is by coloring them (a color is assigned to each key). What is the minimum number of colors needed?

What is the value of \[ \log_37\cdot\log_59\cdot\log_711\cdot\log_913\cdots\log_{21}25\cdot\log_{23}27? \] $\textbf{(A) } 3 \qquad \textbf{(B) } 3\log_{7}23 \qquad \textbf{(C) } 6 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 10 $

Let $f^1(x)=x^3-3x$. Let $f^n(x)=f(f^{n-1}(x))$. Let $\mathcal{R}$ be the set of roots of $\tfrac{f^{2022}(x)}{x}$. If \[\sum_{r\in\mathcal{R}}\frac{1}{r^2}=\frac{a^b-c}{d}\] for positive integers $a,b,c,d$, where $b$ is as large as possible and $c$ and $d$ are relatively prime, find $a+b+c+d$.

At a certain beach if it is at least $80 ^\circ F$ and sunny, then the beach will be crowded. On June 10 the beach was not crowded. What can be said about the weather conditions on June 10? $(A)$ The temperature was cooler than $80 ^\circ F$ and it was not sunny. $(B)$ The temperature was cooler than $80 ^\circ F$ or it was not sunny. $(C)$ If the temperature was at least $80 ^\circ F$, then it was sunny. $(D)$ If the temperature was cooler than $80 ^\circ F$, then it was sunny. $(E)$ If the temperature was cooler than $80 ^\circ F$, then it was not sunny.

A set of different positive integers is called meaningful if for any finite nonempty subset the corresponding arithmetic and geometric means are both integers. $a)$ Does there exist a meaningful set which consists of $2019$ numbers? $b)$ Does there exist an infinite meaningful set? Note: The geometric mean of the non-negative numbers $a_1, a_2,\cdots, $ $a_n$ is defined as $\sqrt[n]{a_1a_2\cdots a_n} .$

Andriyko has rectangle desk and a lot of stripes that lie parallel to sides of the desk. For every pair of stripes we can say that first of them is under second one. In desired configuration for every four stripes such that two of them are parallel to one side of the desk and two others are parallel to other side, one of them is under two other stripes that lie perpendicular to it. Prove that Andriyko can put stripes one by one such way that every next stripe lie upper than previous and get desired configuration. [i]Proposed by Denys Smirnov[/i]

Consider a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that admits primitives. Prove that: $ \text{(i)} $ Every term (function) of the sequence functions $ \left( h_n\right)_{n\ge 2}:\mathbb{R}\longrightarrow\mathbb{R} $ defined, for any natural number $ n $ as $ h_n(x)=x^nf\left( x^3 \right) , $ is primitivable. $ \text{(ii)} $ The function $ \phi :\mathbb{R}\longrightarrow\mathbb{R} $ defined as $$ \phi (x) =\left\{ \begin{matrix} e^{-1/x^2} f(x),& \quad x\neq 0 \\ 0,& \quad x=0 \end{matrix} \right. $$ is primitivable. [i]Cristinel Mortici[/i]

Let $\mathbb{Q}^{+}$ denote the set of positive rational numbers. Find, with proof, all functions $f:\mathbb{Q}^+ \to \mathbb{Q}^+$ such that, for all positive rational numbers $x$ and $y,$ we have \[f(x)=f(x+y)+f(x+x^2f(y)).\]

How many whole numbers between 99 and 999 contain exactly one 0? $\text{(A)}\ 72 \qquad \text{(B)}\ 90 \qquad \text{(C)}\ 144 \qquad \text{(D)}\ 162 \qquad \text{(E)}\ 180$

Which is larger: $2^{\sqrt{2}}$; $2^{1+\frac{1}{\sqrt{2}}}$ and 3 ?

Let $N,K,L$ be points on the sides $\overline{AB}, \overline{BC}, \overline{CA}$ respectively. Suppose $AL=BK$ and $\overline{CN}$ is the internal bisector of angle $ACB$. Let $P$ be the intersection of lines $\overline{AK}$ and $\overline{BL}$ and let $I,J$ be the incenters of triangles $APL$ and $BPK$ respectively. Let $Q$ be the intersection of lines $\overline{IJ}$ and $\overline{CN}$. Prove that $IP=JQ$.

Determine the last two digits of the product of the squares of all positive odd integers less than $2014$.

The diagram below shows two parallel rows with seven points in the upper row and nine points in the lower row. The points in each row are spaced one unit apart, and the two rows are two units apart. How many trapezoids which are not parallelograms have vertices in this set of $16$ points and have area of at least six square units? [asy] import graph; size(7cm); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); pen dotstyle = black; dot((-2,4),linewidth(6pt) + dotstyle); dot((-1,4),linewidth(6pt) + dotstyle); dot((0,4),linewidth(6pt) + dotstyle); dot((1,4),linewidth(6pt) + dotstyle); dot((2,4),linewidth(6pt) + dotstyle); dot((3,4),linewidth(6pt) + dotstyle); dot((4,4),linewidth(6pt) + dotstyle); dot((-3,2),linewidth(6pt) + dotstyle); dot((-2,2),linewidth(6pt) + dotstyle); dot((-1,2),linewidth(6pt) + dotstyle); dot((0,2),linewidth(6pt) + dotstyle); dot((1,2),linewidth(6pt) + dotstyle); dot((2,2),linewidth(6pt) + dotstyle); dot((3,2),linewidth(6pt) + dotstyle); dot((4,2),linewidth(6pt) + dotstyle); dot((5,2),linewidth(6pt) + dotstyle); [/asy]

Show that for any $n > 5$ we can find positive integers $x_1, x_2, ... , x_n$ such that $\frac{1}{x_1} + \frac{1}{x_2} +... + \frac{1}{x_n} = \frac{1997}{1998}$. Show that in any such equation there must be two of the $n$ numbers with a common divisor ($> 1$).

p1. It is known that $m$ and $n$ are two positive integer numbers consisting of four digits and three digits respectively. Both numbers contain the number $4$ and the number $5$. The number $59$ is a prime factor of $m$. The remainder of the division of $n$ by $38$ is $ 1$. If the difference between $m$ and $n$ is not more than $2015$. determine all possible pairs of numbers $(m,n)$. p2. It is known that the equation $ax^2 + bx + c = $0 with $a> 0$ has two different real roots and the equation $ac^2x^4 + 2acdx^3 + (bc + ad^2) x^2 + bdx + c = 0$ has no real roots. Is it true that $ad^2 + 2ad^2 <4bc + 16c^3$ ? p3. A basketball competition consists of $6$ teams. Each team carries a team flag that is mounted on a pole located on the edge of the match field. There are four locations and each location has five poles in a row. Pairs of flags at each location starting from the far right pole in sequence. If not all poles in each location must be flagged, determine as many possible flag arrangements. p4. It is known that two intersecting circles $L_1$ and $L_2$ have centers at $M$ and $N$ respectively. The radii of the circles $L_1$ and $L_2$ are $5$ units and $6$ units respectively. The circle $L_1$ passes through the point $N$ and intersects the circle $L_2$ at point $P$ and at point $Q$. The point $U$ lies on the circle $L_2$ so that the line segment $PU$ is a diameter of the circle $L_2$. The point $T$ lies at the extension of the line segment $PQ$ such that the area of ​​the quadrilateral $QTUN$ is $792/25$ units of area. Determine the length of the $QT$. p5. An ice ball has an initial volume $V_0$. After $n$ seconds ($n$ is natural number), the volume of the ice ball becomes $V_n$ and its surface area is $L_n$. The ice ball melts with a change in volume per second proportional to its surface area, i.e. $V_n - V_{n+1} = a L_n$, for every n, where a is a positive constant. It is also known that the ratio between the volume changes and the change of the radius per second is proportional to the area of ​​the property, that is $\frac{V_n - V_{n+1}}{R_n - R_{n+1}}= k L_n$ , where $k$ is a positive constant. If $V_1=\frac{27}{64} V_0$ and the ice ball melts totally at exactly $h$ seconds, determine the value of $h$.

Polina wrote on the first page of her notebook $n$ different positive integers. On the second page she wrote all pairwise sums of the numbers from the first page, and on the third - absolute values of pairwise differences of number from the second page. After that she kept doing same operations, i.e. on the page $2k$ she wrote all pairwise sums of numbers from page $2k-1$, and on the page $2k+1$ absolute values of differences of numbers from page $2k$. At some moment Polina noticed that there exists a number $M$ such that, no matter how long she does her operations, on every page there are always at most $M$ distinct numbers. What is the biggest $n$ for which it is possible? [i]M. Karpuk[/i]

Call a set of points in the plane $good$ if any three points of the set are the vertices of an isosceles triangle or if they are collinear. Determine all $a)$ 6-element $good$ sets $b)$ 7-element $good$ sets.

Suppose that the function $ g : (0,1) \rightarrow \mathbb{R}$ can be uniformly approximated by polynomials with nonnegative coefficients. Prove that $ g$ must be analytic. Is the statement also true for the interval $ (\minus{}1,0)$ instead of $ (0,1)$? [i]J. Kalina, L. Lempert[/i]

Consider a function \( n \mapsto f(n) \) that satisfies the following conditions: \( f(n) \) is an integer for each \( n \). \( f(0) = 1 \). \( f(n+1) > f(n) + f(n-1) + \cdots + f(0) \) for each \( n = 0, 1, 2, \dots \). Determine the smallest possible value of \( f(2023) \).

Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$. [i]Proposed by North Korea[/i]

Let $ABCD$ be a cyclic quadrilateral, $K$ and $N$ be the midpoints of the diagonals and $P$ and $Q$ be points of intersection of the extensions of the opposite sides. Prove that $\angle PKQ + \angle PNQ = 180$. [i]($7$ points)[/i] .

Show that for a triangle with radii of circumcircle and incircle equal to $ R$, $ r$ respectively, the inequality $ R \geq 2r$ holds.

An acute-angled triangle $ABC$ is given. Points $A_1, B_1$ and $C_1$ are taken on its sides $BC, CA$ and $AB$, respectively, such that $\angle B_1A_1C_1 + 2 \angle BAC = 180^o$, $\angle A_1C_1B_1 + 2 \angle ACB = 180^o$, $\angle C_1B_1A_1 + 2 \angle CBA = 180^o$. Find the locus of the centers of the circles inscribed in triangles $A_1B_1C_1$ (all kinds of such triangles are considered).