[b]p1.[/b] Solve the equation $x^2 - x - cos y+1.25 =0$. [b]p2.[/b] Solve the inequality: $\left| \frac{x - 2}{x - 3}\right| \le x$ [b]p3.[/b] Bilbo and Dwalin are seated at a round table of radius $R$. Bilbo places a coin of radius $r$ at the center of the table, then Dwalin places a second coin as near to the table’s center as possible without overlapping the first coin. The process continues with additional coins being placed as near as possible to the center of the table and in contact with as many coins as possible without overlap. The person who places the last coin entirely on the table (no overhang) wins the game. Assume that $R/r$ is an integer. (a) Who wins, Bilbo or Dawalin? Please justify your answer. (b) How many coins are on the table when the game ends? [b]p4.[/b] In the center of a square field is an orc. Four elf guards are on the vertices of that square. The orc can run in the field, the elves only along the sides of the square. Elves run $\$1.5$ times faster than the orc. The orc can kill one elf but cannot fight two of them at the same time. Prove that elves can keep the orc from escaping from the field. [b]p5.[/b] Nine straight roads cross the Mirkwood which is shaped like a square, with an area of $120$ square miles. Each road intersects two opposite sides of the square and divides the Mirkwood into two quadrilaterals of areas $40$ and $80$ square miles. Prove that there exists a point in the Mirkwood which is an intersection of at least three roads. PS. You should use hide for answers.

Let $ A\in M_2\left( \mathbb{C}\right) $ such that $ \det \left( A^2+A+I_2\right) =\det \left( A^2-A+I_2\right) =3. $ Prove that $ A^2\left( A^2+I_2\right) =2I_2. $

Find all continuous monotonic functions $f : R \to R$ that satisfy $f (1) = 1$ and $f(f (x)) = f (x)^2$ for all $x \in R$.

The function $f(n)$ satisfies $f(0)=0$, $f(n)=n-f \left( f(n-1) \right)$, $n=1,2,3 \cdots$. Find all polynomials $g(x)$ with real coefficient such that \[ f(n)= [ g(n) ], \qquad n=0,1,2 \cdots \] Where $[ g(n) ]$ denote the greatest integer that does not exceed $g(n)$.

Find all function $f:[0,\infty )\to\mathbb{R}$ such that $f$ is monotonic and \[ [f(x)+f(y)]^2=f(x^2-y^2)+f(2xy) \] for all $x\geq y\geq 0$

The function $f:\mathbb R^{\ge 0} \longrightarrow \mathbb R^{\ge 0}$ satisfies the following properties for all $a,b\in \mathbb R^{\ge 0}$: [b]a)[/b] $f(a)=0 \Leftrightarrow a=0$ [b]b)[/b] $f(ab)=f(a)f(b)$ [b]c)[/b] $f(a+b)\le 2 \max \{f(a),f(b)\}$. Prove that for all $a,b\in \mathbb R^{\ge 0}$ we have $f(a+b)\le f(a)+f(b)$. [i]Proposed by Masoud Shafaei[/i]

It is known that from segments of lengths $a$, $b$ and $c$, a triangle can be formed. Can it happen that from segments of lengths$$\sqrt{a^2 + bc}, \quad \sqrt{b^2 + ca}, \quad \sqrt{c^2 + ab}$$an obtuse triangle can be formed?

Find all $4$-tuple of real numbers $(x, y, z, w)$ that satisfy the following system of equations: $$x^2 + y^2 + z^2 + w^2 = 4$$ $$\frac{1}{x^2} +\frac{1}{y^2} +\frac{1}{z^2 }+\frac{1}{w^2} = 5 -\frac{1}{(xyzw)^2}$$

Let \[f_1(x) = \frac{1}{x}\quad\text{and}\quad f_2(x) = 1 - x\] Let $H$ be the set of all compositions of the form $h_1 \circ h_2 \circ \ldots \circ h_k$, where each $h_i$ is either $f_1$ or $f_2$. For all $h$ in $H$, let $h^{(n)}$ denote $h$ composed with itself $n$ times. Find the greatest integer $N$ such that $\pi, h(\pi), \ldots, h^{(N)}(\pi)$ are all distinct for some $h$ in $H$.

If integers $m,n,k$ satisfy $m^2+n^2+1=kmn$, what values can $k$ have?

Let $M$ be an arbitrary positive real number greater than $1$, and let $a_1,a_2,...$ be an infinite sequence of real numbers with $a_n\in [1,M]$ for any $n\in \mathbb{N}$. Show that for any $\epsilon\ge 0$, there exists a positive integer $n$ such that $$\frac{a_n}{a_{n+1}}+\frac{a_{n+1}}{a_{n+2}}+\cdots+\frac{a_{n+t-1}}{a_{n+t}}\ge t-\epsilon$$ holds for any positive integer $t$.

Prove that the functional equations \[f(x + y) = f(x) + f(y),\] \[ \text{and} \qquad f(x + y + xy) = f(x) + f(y) + f(xy) \quad (x, y \in \mathbb R)\] are equivalent.

Let $a, b, c$ be positive real numbers such that $abc = 1$. Prove that $$\frac{1}{a\sqrt{c^2 + 1}} + \frac{1}{b\sqrt{a^2 + 1}} + \frac{1}{c\sqrt{b^2+1}} > 2.$$

Let the function $f$ be defined on the set $\mathbb{N}$ such that $\text{(i)}\ \ \quad f(1)=1$ $\text{(ii)}\ \quad f(2n+1)=f(2n)+1$ $\text{(iii)}\quad f(2n)=3f(n)$ Determine the set of values taken $f$.

What is the largest integer less than or equal to $4x^3 - 3x$, where $x=\frac{\sqrt[3]{2+\sqrt3}+\sqrt[3]{2-\sqrt3}}{2}$ ? (A) $1$, (B) $2$, (C) $3$, (D) $4$, (E) None of the above.

A function $f : R -\{0\} \to R$ has the following properties: (i) $f(x)- f(y) = f(x)f\left(\frac{1}{y}\right)- f(y)f\left(\frac{1}{x}\right)$ for all $x,y \ne 0$, (ii) $f$ takes the value $\frac12$ at least once. Determine $f(-1)$. Prove that $f$ is a periodic function

Find all $3$-tuples of positive reals $(a,b,c)$ such that $$\begin{cases}a\sqrt[2019]b-c=a\\b\sqrt[2019]c-a=b\\c\sqrt[2019]a-b=c\end{cases}$$

Find all real solutions $(x,y)$ to the equation $y^4+2y^2+8x^2+16x^4 = 24xy-8$.

There are two given different polynomials $P(x),Q(x)$ with real coefficients such that $P(Q(x))=Q(P(x))$. Prove that $\forall n\in \mathbb{Z_{+}}$ polynomial: \[\underbrace{P(P(\ldots P(P}_{n}(x))\ldots))- \underbrace{Q(Q(\ldots Q(Q}_{n}(x))\ldots))\] is divisible by $P(x)-Q(x)$.

Determine all solutions in non-zero integers $a$ and $b$ of the equation \[(a^2+b)(a+b^2) = (a-b)^3.\]

Prove that the sides of any equilateral triangle you can either increase everything or decrease everything by the same amount so that you get a right triangle.

Let $ a_1 \geq a_2 \geq \ldots \geq a_n$ be real numbers such that for all integers $ k > 0,$ \[ a^k_1 \plus{} a^k_2 \plus{} \ldots \plus{} a^k_n \geq 0.\] Let $ p \equal{}\max\{|a_1|, \ldots, |a_n|\}.$ Prove that $ p \equal{} a_1$ and that \[ (x \minus{} a_1) \cdot (x \minus{} a_2) \cdots (x \minus{} a_n) \leq x^n \minus{} a^n_1\] for all $ x > a_1.$

[b]a)[/b] Determine if it's possible write $6$ positive rational numbers, pairwise distinct, in a circle such that each one is equal to the product of your [b]neighbor[/b] numbers. [b]b)[/b] Determine if it's possible write $8$ positive rational numbers, pairwise distinct, in a circle such that each one is equal to the product of your [b]neighbor[/b] numbers.

For each integer $n \ge 3$ solve in real numbers the system of equations: $$\begin{cases} x_1^3 = x_2 + x_3 + 1 \\...\\x_{n-1}^3 = x_n+ x_1 + 1\\x_{n}^3 = x_1+ x_2 + 1 \end{cases}$$

Let \begin{eqnarray*} f(x) & = & a_n x^n + a_{n-1} x^{n-1} + \cdots + a_0 \ \ \mbox{and} \\ g(x) & = & c_{n+1} x^{n+1} + c_n x^n + \cdots + c_0 \end{eqnarray*} be non-zero polynomials with real coefficients such that $g(x) = (x+r)f(x)$ for some real number $r$. If $a = \max(|a_n|, \ldots, |a_0|)$ and $c = \max(|c_{n+1}|, \ldots, |c_0|)$, prove that $\frac{a}{c} \leq n+1$.