Solve the system of equations: \[ x+y+z=a \] \[ x^2+y^2+z^2=b^2 \] \[ xy=z^2 \] where $a$ and $b$ are constants. Give the conditions that $a$ and $b$ must satisfy so that $x,y,z$ are distinct positive numbers.

Let $a,b,c$ positive real numbers and $a+b+c = 1$. Prove that \[a^2 + b^2 + c^2 + \frac{3}{\frac{1}{a} + \frac{1}{b} + \frac{1}{c}} \ge 2(ab + bc + ac)\]

Find all functions $f:\mathbb Z\to\mathbb Z$ such that $$19f(x)-17f(f(x))=2x$$for all $x\in\mathbb Z$.

Let $ n$ be a positive integer. Consider \[ S \equal{} \left\{ (x,y,z) \mid x,y,z \in \{ 0, 1, \ldots, n\}, x \plus{} y \plus{} z > 0 \right \} \] as a set of $ (n \plus{} 1)^{3} \minus{} 1$ points in the three-dimensional space. Determine the smallest possible number of planes, the union of which contains $ S$ but does not include $ (0,0,0)$. [i]Author: Gerhard Wöginger, Netherlands [/i]

Estimate the value of $$\sum^{2023}_{n=1} \left(1+ \frac{1}{n} \right)^n$$ to $3$ decimal places.

Let $p$ be a prime number. Call a positive integer $n$ interesting if \[x^n-1=(x^p-x+1)f(x)+pg(x)\] for some polynomials $f$ and $g$ with integer coefficients. a) Prove that the number $p^p-1$ is interesting. b) For which $p$ is $p^p-1$ the minimal interesting number?

When $(a-b)^n$, $n\geq 2$, $ab\neq 0$, is expanded by the binomial theorem, it is found that , when $a=kb$, where $k$ is a positive integer, the sum of the second and third terms is zero. Then $n$ equals: $\textbf{(A) }\tfrac12k(k-1)\qquad \textbf{(B) }\tfrac12k(k+1)\qquad \textbf{(C) }2k-1\qquad \textbf{(D) }2k\qquad \textbf{(E) }2k+1$

Let $m$ be the greatest number such that for any set of complex numbers having the sum of all modulus of all the elements $1$, there exists a subset having the modulus of the sum of the elements in the subset greater than $m$. Prove that $$\frac14 \le m \le \frac12.$$ (Optional Task for 3p) Find a smaller value for the RHS.

Find all non-negative real numbers $x, y, z$ satisfying $x^2y^2 + 1 = x^2 + xy$, $y^2z^2 + 1 = y^2 + yz$ and $z^2x^2 + 1 = z^2 + xz$.

Determine the smallest real constant $C$ such that the inequality \[(X+Y)^2(X^2+Y^2+C)+(1-XY)^2 \ge 0\] holds for all real numbers $X$ and $Y$. For which values of $X$ and $Y$ does equality hold for this smallest constant $C$? [i](Walther Janous)[/i]

For a given $n$, consider the points $(x,y)\in \mathbb{N}^2$ such that $x\leq y\leq n$. An ant starts from $(0,1)$ and, every move, it goes from $(a,b)$ to point $(c,d)$ if $bc-ad=1$ and $d$ is maximized over all such points. Let $g_n$ be the number of moves made by the ant until no more moves can be made. Find $g_{2023} - g_{2022}$. [i]Proposed by David Tang[/i]

Let $ p$ be a positive integer. Define the function $ f: \mathbb{N}\to\mathbb{N}$ by $ f(n)\equal{}a_1^p\plus{}a_2^p\plus{}\cdots\plus{}a_m^p$, where $ a_1, a_2,\ldots, a_m$ are the decimal digits of $ n$ ($ n\equal{}\overline{a_1a_2\ldots a_m}$). Prove that every sequence $ (b_k)^\infty_{k\equal{}0}$ of positive integer that satisfy $ b_{k\plus{}1}\equal{}f(b_k)$ for all $ k\in\mathbb{N}$, has a finite number of distinct terms. $ \mathbb{N}\equal{}\{1,2,3\ldots\}$

Find the area of the set $A = \{(x, y)\ |\ 1 \leq x \leq e,\ 0 \leq y \leq f (x)\}$, where \begin{tabular}{ c| c c c c |} &1 & 1& 1 & 1\\ $f(x)$=& $\ln x$ & 2$\ln x$ & 3$\ln x$ & 4$\ln x$ \\ &${(\ln x)}^2$ & $4{(\ln x)}^2 $& $9{(\ln x)}^2 $& $16{(\ln x)}^2$\\ &${(\ln x)}^3$ & $8{(\ln x)}^3$ &$ 27{(\ln x)}^3$ &$ 64{(\ln x)}^3$ \end{tabular}

Let $a,b,c$ be distinct positive integers such that $b+c-a$, $c+a-b$ and $a+b-c$ are all perfect squares. What is the largest possible value of $a+b+c$ smaller than $100$ ?

Consider the following sequence: $a_1 = 1$, $a_2 = 2$, $a_3 = 3$, and \[a_{n+3} = \frac{a_{n+1}^2 + a_{n+2}^2 - 2}{a_n}\] for all integers $n \ge 1$. Prove that every term of the sequence is a positive integer.

[b]a)[/b] Prove that the sum of all the elements of a finite union of sets of elements of finite cyclic subgroups of the group of complex numbers, is an integer number. [b]b)[/b] Show that there are finite union of sets of elements of finite cyclic subgroups of the group of complex numbers such that the sum of all its elements is equal to any given integer. [i]Paltin Ionescu[/i]

Prove that for positive real numbers $a, b, c$ such that $abc=1$, the following inequality holds: $$\frac{a}{b(a+b)}+\frac{b}{c(b+c)}+\frac{c}{a(c+a)} \ge \frac32$$ (I. Voronovich)

Let $P,Q,R$ be polynomials and let $S(x) = P(x^3) + xQ(x^3) + x^2R(x^3)$ be a polynomial of degree $n$ whose roots $x_1,\ldots, x_n$ are distinct. Construct with the aid of the polynomials $P,Q,R$ a polynomial $T$ of degree $n$ that has the roots $x_1^3 , x_2^3 , \ldots, x_n^3.$

For each positive integer $n$, show that the polynomial: $$P_n(x)=\sum _{k=0}^n2^k\binom{2n}{2k}x^k(x-1)^{n-k}$$ has $n$ real roots.

Let $ \mathbb{N}$ denote the set of all positive integers. Prove that there exists a unique function $ f: \mathbb{N} \mapsto \mathbb{N}$ satisfying \[ f(m \plus{} f(n)) \equal{} n \plus{} f(m \plus{} 95) \] for all $ m$ and $ n$ in $ \mathbb{N}.$ What is the value of $ \sum^{19}_{k \equal{} 1} f(k)?$

If positive reals $a,b,c,d$ satisfy $abcd = 1.$ Prove the following inequality $$1<\frac{b}{ab+b+1}+\frac{c}{bc+c+1}+\frac{d}{cd+d+1}+\frac{a}{da+a+1}<2.$$

Does there exist a nonnegative integer $a$ for which the equation \[\left\lfloor\frac{m}{1}\right\rfloor + \left\lfloor\frac{m}{2}\right\rfloor + \left\lfloor\frac{m}{3}\right\rfloor + \cdots + \left\lfloor\frac{m}{m}\right\rfloor = n^2 + a\] has more than one million different solutions $(m, n)$ where $m$ and $n$ are positive integers? [i]The expression $\lfloor x\rfloor$ denotes the integer part (or floor) of the real number $x$. Thus $\lfloor\sqrt{2}\rfloor = 1, \lfloor\pi\rfloor =\lfloor 22/7 \rfloor = 3, \lfloor 42\rfloor = 42,$ and $\lfloor 0 \rfloor = 0$.[/i]

Prove the identity $ \left[ \frac{3+x}{6} \right] -\left[ \frac{4+x}{6} \right] +\left[ \frac{5+x}{6} \right] =\left[ \frac{1+x}{2} \right] -\left[ \frac{1+x}{3} \right] ,\quad\forall x\in\mathbb{R} , $ where $ [] $ is the integer part. [i]C. Mortici[/i]

Let $\alpha_1, \alpha_2, \dots, \alpha_n$, and $\beta_1, \beta_2, \ldots, \beta_n$, where $n \geq 4$, be 2 sets of real numbers such that \[\sum_{i=1}^{n} \alpha_i^2 < 1 \qquad \text{and} \qquad \sum_{i=1}^{n} \beta_i^2 < 1.\] Define \begin{align*} A^2 &= 1 - \sum_{i=1}^{n} \alpha_i^2,\\ B^2 &= 1 - \sum_{i=1}^{n} \beta_i^2,\\ W &= \frac{1}{2} (1 - \sum_{i=1}^{n} \alpha_i \beta_i)^2. \end{align*} Find all real numbers $\lambda$ such that the polynomial \[x^n + \lambda (x^{n-1} + \cdots + x^3 + Wx^2 + ABx + 1) = 0,\] only has real roots.

Let us define a $\textit{triangle equivalence}$ a group of numbers that can be arranged as shown $a+b=c$ $d+e+f=g+h$ $i+j+k+l=m+n+o$ and so on... Where at the $j$-th row, the left hand side has $j+1$ terms and the right hand side has $j$ terms. Now, we are given the first $N^2$ positive integers, where $N$ is a positive integer. Suppose we eliminate any one number that has the same parity with $N$. Prove that the remaining $N^2-1$ numbers can be formed into a $\textit{triangle equivalence}$. For example, if $10$ is eliminated from the first $16$ numbers, the remaining numbers can be arranged into a $\textit{triangle equivalence}$ as shown. $1+3=4$ $2+5+8=6+9$ $7+11+12+14=13+15+16$