At a festival, Jing Jing plays a game where she must knock down ten targets with as few balls as possible. Every time Jing Jing knocks down a target, she can reuse the ball she just threw and does not have to pick up a new ball. Suppose that Jing Jing knocks down each target with a probability of $\tfrac{3}{4}$. Compute the expected number of balls that Jing Jing needs to knock down all ten targets.

Find the number of $n$ that follow the following: $ \bigstar $ The number of integers $ (x,y,z) $ following this equation is not a multiple of 4. $ 2n=x^2+2y^2+2x^2+2xy+2yz $

Positive integers $x_1,...,x_m$ (not necessarily distinct) are written on a blackboard. It is known that each of the numbers $F_1,...,F_{2018}$ can be represented as a sum of one or more of the numbers on the blackboard. What is the smallest possible value of $m$? (Here $F_1,...,F_{2018}$ are the first $2018$ Fibonacci numbers: $F_1=F_2=1, F_{k+1}=F_k+F_{k-1}$ for $k>1$.)

A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]

Construct a quadrilateral given its side lengths and the length of the segment joining the midpoints of its diagonals. (IZ Titovich)

Let $a,b,c,x,y,z$ be real numbers such that $x+y+z=0$, $a+b+c\geq 0$, $ab+bc+ca \ge 0$. Prove that $$ ax^2+by^2+cz^2\ge 0 $$

Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that $$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$ for all positive integers $n$. Show that $a_{2022}\leq 1$.

Solve the system of equations: $ (1\plus{}4^{2x\minus{}y}).5^{1\minus{}2x\plus{}y}\equal{}1\plus{}2^{2x\minus{}y\plus{}1}$ $ y^3\plus{}4x\plus{}ln(y^2\plus{}2x)\plus{}1\equal{}0$

Given a real number $c$ and an integer $m, m \ge 2$. Real numbers $x_1, x_2,... , x_m$ satisfy the conditions $x_1 + x_2 +...+ x_m = 0$ and $\frac{x^2_1 + x^2_2 + ...+ x^2_m}{m}= c$. Find max $(x_1, x_2,..., x_m)$ if it is known to be as small as possible.

Let $\mathbb{R}^{+}$ be the set of all positive real numbers. Find all the functions $f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$ such that for all $x, y \in \mathbb{R}^{+}$, \[ f(x)f(y) = f(y)f(xf(y)) + \frac{1}{xy}. \]

Suppose $x$, $y$, $z$ are positive numbers such that $x+y+z=1$. Prove that \[ \frac{(1+xy+yz+zx)(1+3x^3 + 3y^3 + 3z^3)}{9(x+y)(y+z)(z+x)} \ge \left( \frac{x \sqrt{1+x} }{\sqrt[4]{3+9x^2}} + \frac{y \sqrt{1+y} }{\sqrt[4]{3+9y^2}} + \frac{z \sqrt{1+z}}{\sqrt[4]{3+9z^2}} \right)^2. \]

Three numbers $a,b,c$, none zero, form an arithmetic progression. Increasing $a$ by $1$ or increasing $c$ by $2$ results in a geometric progression. Then $b$ equals: $\textbf{(A)}\ 16 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ 8$

Find all Polynomial $P(x)$ and $Q(x)$ with Integer Coefficients satisfied the equation: \[Q(a+b) = \frac{P(a) - P(b)}{a - b}\] $\forall a, b \in \mathbb{Z}^+$ and $a>b$

Jorge's teacher asks him to plot all the ordered pairs $ (w, l)$ of positive integers for which $ w$ is the width and $ l$ is the length of a rectangle with area 12. What should his graph look like? $ \textbf{(A)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((1,12)); dot((2,6)); dot((3,4)); dot((4,3)); dot((6,2)); dot((12,1)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy] $ \textbf{(B)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((1,1)); dot((3,3)); dot((5,5)); dot((7,7)); dot((9,9)); dot((11,11)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy] $ \textbf{(C)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((1,11)); dot((3,9)); dot((5,7)); dot((7,5)); dot((9,3)); dot((11,1)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy] $ \textbf{(D)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((1,6)); dot((3,6)); dot((5,6)); dot((7,6)); dot((9,6)); dot((11,6)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy] $ \textbf{(E)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((6,1)); dot((6,3)); dot((6,5)); dot((6,7)); dot((6,9)); dot((6,11)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy]

Let $ABC$ be a triangle with circumcircle $\omega$, circumcenter $O{}$, and orthocenter $H{}$. Let $K{}$ be the midpoint of $AH{}$. The perpendicular to $OK{}$ at $K{}$ intersects $AB{}$ and $AC{}$ at $P{}$ and $Q{}$, respectively. The lines $BK$ and $CK$ intersect $\omega$ again at $X{}$ and $Y{}$, respectively. Prove that the second intersection of the circumcircles of triangles $KPY$ and $KQX$ lies on $\omega$. [i]Stefan Lozanovski[/i]

On Christmas Eve, 1983, Dean Jixon, the famous seer who had made startling predictions of the events of the preceding year that the volcanic and seismic activities of $1980$ and $1981$ were connected with mathematics. The diminishing of this geological activity depended upon the existence of an elementary proof of the irreducibility of the polynomial \[P(x)=x^{1981}+x^{1980}+12x^{2}+24x+1983.\] Is there such a proof?

Let the sequence $(a_{n})_{n\geqslant 1}$ be defined as: $$a_{n}=\sqrt{A_{n+2}^{1}\sqrt[3]{A_{n+3}^{2}\sqrt[4]{A_{n+4}^{3}\sqrt[5]{A_{n+5}^{4}}}}},$$ where $A_{m}^{k}$ are defined by $$A_{m}^{k}=\binom{m}{k}\cdot k!.$$ Prove that $$a_{n}<\frac{119}{120}\cdot n+\frac{7}{3}.$$

Let $n$ be a positive integer. Determine the maximum value of $gcd(a, b) + gcd(b, c) + gcd(c, a)$ for positive integers $a, b, c$ such that $a + b + c = 5n$.

For three points $ X,Y,Z$ let $ R_{XYZ}$ be the circumcircle radius of the triangle $ XYZ.$ If $ ABC$ is a triangle with incircle centre $ I$ then we have: \[ \frac{1}{R_{ABI}} \plus{} \frac{1}{R_{BCI}} \plus{} \frac{1}{R_{CAI}} \leq \frac{1}{\bar{AI}} \plus{} \frac{1}{\bar{BI}} \plus{} \frac{1}{\bar{CI}}.\]

In triangle $ABC$, $\sin A \sin B \sin C = \frac{1}{1000}$ and $AB \cdot BC \cdot CA = 1000$. What is the area of triangle $ABC$? [i]Proposed by Evan Chen[/i]

Find the value of $\frac12+\frac{4}{2^2} +\frac{9}{2^3} +\frac{16}{2^4} + ...$

Tim is thinking of a positive integer between $2$ and $15,$ inclusive, and Ted is trying to guess the integer. Tim tells Ted how many factors his integer has, and Ted is then able to be certain of what Tim's integer is. What is Tim's integer?

Show that for all positive reals $a,b,c$ with $a+b+c=3$, $$\sum_{\text{cyc}}\sqrt{a+3b+\frac2c}\ge3\sqrt6.$$

Let $ABC$ a triangle. Let $D$ be a point on the circumcircle of this triangle and let $E , F$ be the feet of the perpendiculars from $A$ on $DB, DC$, respectively. Finally, let $N$ be the midpoint of $EF$. Let $M \ne N$ be the midpoint of the side $BC$ . Prove that the lines $NA$ and $NM$ are perpendicular.

For a real number $x$, let $[x]$ denote the greatest integer not exceeding $x$. If $m \ge 3$, prove that \[\left[\frac{m(m+1)}{2(2m-1)}\right]=\left[\frac{m+1}{4}\right]\]