$x,y,z$ are positive real numbers such that: $$xyz+x+y+z=6$$ $$xyz+2xy+yz+zx+z=10$$ Find the maximum value of: $$(xy+1)(yz+1)(zx+1)$$

Determine the lowest positive integer n such that following statement is true: If polynomial with integer coefficients gets value 2 for n different integers, then it can't take value 4 for any integer.

Let $a,b,c{}$ be positive real numbers. Prove that \[108\cdot(ab+bc+ca)\leqslant(\sqrt{a+b}+\sqrt{b+c}+\sqrt{c+a})^4.\]

Let $n$ be a positive integer such that no matter how $10^n$ is expressed as the product of two positive integers, at least one of these two integers contains the digit 0. Find the smallest possible value of $n$

Let $l$ be the tangent line at the point $P(s,\ t)$ on a circle $C:x^2+y^2=1$. Denote by $m$ the line passing through the point $(1,\ 0)$, parallel to $l$. Let the line $m$ intersects the circle $C$ at $P'$ other than the point $(1,\ 0)$. Note : if $m$ is the line $x=1$, then $P'$ is considered as $(1,\ 0)$. Call $T$ the operation such that the point $P'(s',\ t')$ is obtained from the point $P(s,\ t)$ on $C$. (1) Express $s',\ t'$ as the polynomials of $s$ and $t$ respectively. (2) Let $P_n$ be the point obtained by $n$ operations of $T$ for $P$. For $P\left(\frac{\sqrt{3}}{2},\ \frac{1}{2}\right)$, plot the points $P_1,\ P_2$ and $P_3$. (3) For a positive integer $n$, find the number of $P$ such that $P_n=P$.

For the various values of the parameter $a \in R$, solve the equation $ ||x - 4| - 2x + 8| = ax + 4$

It is known about positive numbers $a, b, c$ that it is possible to form a triangle from segments of length $a^{2024}, b^{2024}, c^{2024}$. Prove that it is possible to reduce one of the numbers $a, b, c$ by $2024$ times and obtain the numbers $a', b', c'$ so that segments with lengths $a', b', c'$ can also be formed into a triangle. [i]L. Shatunov[/i]

Find all functions $ f : R \to R$ that satisfies $$xf(y) - yf(x)= f\left(\frac{y}{x}\right)$$ for all $x, y \in R$.

The $n$-th digit of number $a = 0.12457...$ equals the first digit of the integer part of the number $n\sqrt2$. Prove that $a$ is irrational number. (6)

Let $S$ be a set of positive integers $n_1, n_2, \cdots, n_6$ and let $n(f)$ denote the number $n_1n_{f(1)} +n_2n_{f(2)} +\cdots+n_6n_{f(6)}$, where $f$ is a permutation of $\{1, 2, . . . , 6\}$. Let \[\Omega=\{n(f) | f \text{ is a permutation of } \{1, 2, . . . , 6\} \} \] Give an example of positive integers $n_1, \cdots, n_6$ such that $\Omega$ contains as many elements as possible and determine the number of elements of $\Omega$.

Let $n\in\mathbb{N}^*$. Solve the equation $\sum_{k=0}^n C_n^k\cos2kx=\cos nx$ in $\mathbb{R}$.

Prove that it is possible to choose different real numbers $a_1, a_2, . . . , a_{10}$ that the equation $$(x - a_1)(x -a_2).... (x -a_{10}) = (x + a_1)(x + a_2) ...(x + a_{10})$$ will have exactly $5$ different real roots.

Let $a_1, a_2, \ldots, a_n$ be $n$ positive integers, and let $b_1, b_2, \ldots, b_m$ be $m$ positive integers such that $a_1 a_2 \cdots a_n = b_1 b_2 \cdots b_m$. Prove that a rectangular table with $n$ rows and $m$ columns can be filled with positive integer entries in such a way that * the product of the entries in the $i$-th row is $a_i$ (for each $i \in \left\{1,2,\ldots,n\right\}$); * the product of the entries in the $j$-th row is $b_j$ (for each $i \in \left\{1,2,\ldots,m\right\}$).

A function $f(x)$ defined for $x\ge 0$ satisfies the following conditions: i. for $x,y\ge 0$, $f(x)f(y)\le x^2f(y/2)+y^2f(x/2)$; ii. there exists a constant $M$($M>0$), such that $|f(x)|\le M$ when $0\le x\le 1$. Prove that $f(x)\le x^2$.

For this exercise, $ \{\} $ denotes the fractional part. [b]a)[/b] Let be a natural number $ n. $ Compare $ \left\{ \sqrt{n+1} -\sqrt{n} \right\} $ with $ \left\{ \sqrt{n} -\sqrt{n-1} \right\} . $ [b]b)[/b] Show that there are two distinct natural numbers $ a,b, $ such that $ \left\{ \sqrt{a} -\sqrt{b} \right\} =\left\{ \sqrt{b} -\sqrt{a} \right\} . $ [i]Traian Preda[/i]

Find all functions $\displaystyle f : \mathbb N^\ast \to M$ such that \[ \displaystyle 1 + f(n) f(n+1) = 2 n^2 \left( f(n+1) - f(n) \right), \, \forall n \in \mathbb N^\ast , \] in each of the following situations: (a) $\displaystyle M = \mathbb N$; (b) $\displaystyle M = \mathbb Q$. [i]Dinu Şerbănescu[/i]

A bee starts flying from point $P_0$. She flies 1 inch due east to point $P_1$. For $j \ge 1$, once the bee reaches point $P_j$, she turns $30^{\circ}$ counterclockwise and then flies $j+1$ inches straight to point $P_{j+1}$. When the bee reaches $P_{2015}$ she is exactly $a\sqrt{b} + c\sqrt{d}$ inches away from $P_0$, where $a$, $b$, $c$ and $d$ are positive integers and $b$ and $d$ are not divisible by the square of any prime. What is $a+b+c+d$? $ \textbf{(A)}\ 2016 \qquad\textbf{(B)}\ 2024 \qquad\textbf{(C)}\ 2032 \qquad\textbf{(D)}\ 2040 \qquad\textbf{(E)}\ 2048$

Determine all real constants $t$ such that whenever $a$, $b$ and $c$ are the lengths of sides of a triangle, then so are $a^2+bct$, $b^2+cat$, $c^2+abt$.

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$.

Let $x_1,x_2,...,x_{1994}$ be positive real numbers. Prove that $$\left(\frac{x_1}{x_2}\right)^{\frac{x_1}{x_2}}\left(\frac{x_2}{x_3}\right)^{\frac{x_2}{x_3}}...\left(\frac{x_{1993}}{x_{1994}}\right)^{\frac{x_{1993}}{x_{1994}}} \ge \left(\frac{x_1}{x_2}\right)^{\frac{x_2}{x_1}}\left(\frac{x_2}{x_3}\right)^{\frac{x_3}{x_2}}...\left(\frac{x_{1993}}{x_{1994}}\right)^{\frac{x_{1994}}{x_{1993}}}$$

Let $p$ and $q$ be different prime numbers. Solve the following system in integers: \[\frac{z+ p}x+\frac{z-p}y= q,\\ \frac{z+ p}y -\frac{z-p}x= q.\]

Find the functions $ f:\mathbb{Z}\longrightarrow\mathbb{Z}_{\ge 0} $ that satisfy the following two conditions: $ \text{(a)} f(m+n)=f(n)+f(m)+2mn,\quad\forall m,n\in\mathbb{Z} $ $ \text{(b)} f(f(1))-f(1) $ is a perfect square [i]Marin Ionescu[/i]

$(YUG 1)$ Suppose that positive real numbers $x_1, x_2, x_3$ satisfy $x_1x_2x_3 > 1, x_1 + x_2 + x_3 <\frac{1}{x_1}+\frac{1}{x_2}+\frac{1}{x_3}$ Prove that: $(a)$ None of $x_1, x_2, x_3$ equals $1$. $(b)$ Exactly one of these numbers is less than $1.$

Define a positive number sequence sequence $\{a_n\}$ by \[a_{1}=1,(n^2+1)a^2_{n-1}=(n-1)^2a^2_{n}.\]Prove that\[\frac{1}{a^2_1}+\frac{1}{a^2_2}+\cdots +\frac{1}{a^2_n}\le 1+\sqrt{1-\frac{1}{a^2_n}} .\]

We call a number [i]pal[/i] if it doesn't have a zero digit and the sum of the squares of the digits is a perfect square. For example, $122$ and $34$ are pal but $304$ and $12$ are not pal. Prove that there exists a pal number with $n$ digits, $n > 1$.