The number $2023$ is written $2023$ times on a blackboard. On one move, you can choose two numbers $x, y$ on the blackboard, delete them and write $\frac{x+y} {4}$ instead. Prove that when one number remains, it is greater than $1$.

Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\] [i]Proposed by Denmark[/i]

Source: 1976 Euclid Part B Problem 4 ----- The remainder when $f(x)=x^5-2x^4+ax^3-x^2+bx-2$ is divided by $x+1$ is $-7$. When $f(x)$ is divided by $x-2$ the remainder is $32$. Determine the remainder when $f(x)$ is divided by $x-1$.

For every real number $ b$ determine all real numbers $ x$ satisfying $ x\minus{}b\equal{} \sum_{k\equal{}0}^{\infty}x^k$.

Given a function $p(x) = ax^5 + bx^4 + cx^3 + dx^2 + ex + f$. Each coefficient $a, b, c, d, e$, and$ f$ is equal to either $ 1$ or $-1$. If $p(2) = 11$, what is the value of $p(3)$?

A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where $[x]$ denotes the smallest integer $\leq x)$

Evaluate $2023^2 -2022^2 +2021^2 -2020^2$.

Compute the unique ordered pair $(x, y)$ of real numbers satisfying the system of equations $$\frac{x}{\sqrt{x^2 + y^2}}-\frac{1}{x}= 7 \,\,\, \text{and} \,\,\, \frac{y}{\sqrt{x^2 + y^2}}+\frac{1}{y}=4 $$

Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]

Find all monic polynomials $P(x)=x^{2023}+a_{2022}x^{2022}+\ldots+a_1x+a_0$ with real coefficients such that $a_{2022}=0$, $P(1)=1$ and all roots of $P$ are real and less than $1$.

Let $x, y, z, t$ be real numbers such that $(x^2 + y^2 -1)(z^2 + t^2 - 1) > (xz + yt -1)^2$. Prove that $x^2 + y^2 > 1$.

[b]p1.[/b] Darth Vader urgently needed a new Death Star battle station. He sent requests to four planets asking how much time they would need to build it. The Mandalorians answered that they can build it in one year, the Sorganians in one and a half year, the Nevarroins in two years, and the Klatoonians in three years. To expedite the work Darth Vader decided to hire all of them to work together. The Rebels need to know when the Death Star is operational. Can you help the Rebels and find the number of days needed if all four planets work together? We assume that one year $= 365$ days. [b]p2.[/b] Solve the inequality: $\left( \sin \frac{\pi}{12} \right)^{\sqrt{1-x}} > \left( \sin \frac{\pi}{12} \right)^x$ [b]p3.[/b] Solve the equation: $\sqrt{x^2 + 4x + 4} = x^2 + 3x - 6$ [b]p4.[/b] Solve the system of inequalities on $[0, 2\pi]$: $$\sin (2x) \ge \sin (x)$$ $$\cos (2x) \le \cos (x)$$ [b]p5.[/b] The planet Naboo is under attack by the imperial forces. Three rebellian camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle by a defensive field. What is the maximal area that they may need to cover? [b]p6.[/b] The Lake Country on the planet Naboo has the shape of a square. There are nine roads in the country. Each of the roads is a straight line that divides the country into two trapezoidal parts such that the ratio of the areas of these parts is $2:5$. Prove that at least three of these roads intersect at one point. PS. You should use hide for answers.

Find the smallest constant $C > 0$ for which the following statement holds: among any five positive real numbers $a_1,a_2,a_3,a_4,a_5$ (not necessarily distinct), one can always choose distinct subscripts $i,j,k,l$ such that \[ \left| \frac{a_i}{a_j} - \frac {a_k}{a_l} \right| \le C. \]

Consider the following sequence of positive real numbers $\dots<a_{-2}<a_{-1}<a_0<a_1<a_2<\dots$ infinite in both directions. For each positive integer $k$ let $b_k$ be the least integer such that the ratio between the sum of $k$ consecutive terms and the greatest of these $k$ terms is less than or equal to $b_k$(This fact occurs for any sequence of $k$ consecutive numbers). Prove that the sequence $b_1,b_2,b_3,...$ coincides with the sequence $1,2,3,...$ or is eventually constant.

Let $P(x)=a_nx^n+a_{n-1}x^{n-1}+\cdots+a_0$ and $Q(x)=b_nx^n+b_{n-1}x^{n-1}+\cdots+b_0$ be two polynomials with integral coefficients such that $a_n-b_n$ is a prime and $a_nb_0-a_0b_n\neq 0,$ and $a_{n-1}=b_{n-1}.$ Suppose that there exists a rational number $r$ such that $P(r)=Q(r)=0.$ Prove that $r\in\mathbb Z.$

Let $n$ be a positive integer. There are $n$ soldiers stationed on the $n$th root of unity in the complex plane. Each round, you pick a point, and all the soldiers shoot in a straight line towards that point; if their shot hits another soldier, the hit soldier dies and no longer shoots during the next round. What is the minimum number of rounds, in terms of $n$, required to eliminate all the soldiers? [i]David Yang.[/i]

Find all functions $f:\mathbb{Z} \rightarrow \mathbb{R}$ such that $f(1)=\tfrac{5}{2}$ and that \[f(x)f(y)=f(x+y)+f(x-y)\] for all integers $x$ and $y$.

A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$ [i]Proposed by Gerhard Wöginger, Austria[/i]

A polynomial $p(x)$ of degree $1000$ is such that $p(n) = (n+1)2^n$ for all nonnegative integers $n$ such that $n\leq 1000$. Given that \[p(1001) = a\cdot 2^b - c,\] where $a$ is an odd integer, and $0 < c < 2007$, find $c-(a+b)$.

Determine all real numbers $x{}$ satisfying $2^{x-1}+2^{1/\sqrt{x}}=3$.

Determine all integers $n$ such that both of the numbers: $$|n^3 - 4n^2 + 3n - 35| \text{ and } |n^2 + 4n + 8|$$ are both prime numbers.

Find the smallest positive value of $x$ such that $x^3-9x^2+22x-16=0$.

Prove that for every integer $k \ge 2$ there are $k$ different natural numbers $n_1$, $n_2$, $...$ , $n_k$ such that: $$\frac{1}{n_1}+\frac{1}{n_2}+...+\frac{1}{n_k}=\frac{3}{17}$$

For a given natural $n$, we consider the set $A\subset \{1,2, ..., n\}$, which consists of at least $\left[\frac{n+1}{2}\right]$ items. Prove that for $n \ge 2015$ the set $A$ contains a three-element arithmetic sequence.

Given any set $S$ of positive integers, show that at least one of the following two assertions holds: (1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$; (2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.