Determine all functions $ f$ defined in the set of rational numbers and taking their values in the same set such that the equation $ f(x + y) + f(x - y) = 2f(x) + 2f(y)$ holds for all rational numbers $x$ and $y$.

a) Let $\{a_n\}_{n=1}^\infty$ is sequence of integers bigger than 1. Proove that if $x>0$ is irrational, then $\ds x_n>\frac{1}{a_{n+1}}$ for infinitely many $n$, where $x_n$ is fractional part of $a_na_{n-1}\dots a_1x$. b)Find all sequences $\{a_n\}_{n=1}^\infty$ of positive integers, for which exist infinitely many $x\in(0,1)$ such that $\ds x_n>\frac{1}{a_{n+1}}$ for all $n$. [i]Nikolai Nikolov, Emil Kolev[/i]

We say that a function \( f: \mathbb{R} \to \mathbb{R} \) is morally odd if its graph is symmetric with respect to a point, that is, there exists \((x_0, y_0) \in \mathbb{R}^2\) such that if \((u, v) \in \{(x, f(x)) : x \in \mathbb{R}\}\), then \((2x_0 - u, 2y_0 - v) \in \{(x, f(x)) : x \in \mathbb{R}\}\). On the other hand, \( f \) is said to be morally even if its graph \(\{(x, f(x)) : x \in \mathbb{R}\}\) is symmetric with respect to some line (not necessarily vertical or horizontal). If \( f \) is morally even and morally odd, we say that \( f \) is parimpar. (a) Let \( S \subset \mathbb{R} \) be a bounded set and \( f: S \to \mathbb{R} \) be an arbitrary function. Prove that there exists \( g: \mathbb{R} \to \mathbb{R} \) that is parimpar such that \( g(x) = f(x) \) for all \( x \in S \). (b) Find all polynomials \( P \) with real coefficients such that the corresponding polynomial function \( P: \mathbb{R} \to \mathbb{R} \) is parimpar.

Determine all real numbers $x$ which satisfy \[ x = \sqrt{a - \sqrt{a+x}} \] where $a > 0$ is a parameter.

Let $N_3$ be the answer to problem 3. Compute the sum of all real solutions $x$ to the equation \[ 50^x+72^x+(N_3)^x=800^x. \]

If $p = (1- \cos x)(1+ \sin x)$ and $q = (1+ \cos x)(1- \sin x)$, write the expression $$\cos^2 x - \cos^4 x - \sin2x + 2$$ in terms of $p$ and $q$.

Suppose that $ a_1,\cdots , a_{25}$ are non-negative integers, and $ k$ is the smallest of them. Prove that $$\big[\sqrt{a_1}\big]+\big[\sqrt{a_2}\big]+\cdots+\big[\sqrt{a_{25}}\big ]\geq\big[\sqrt{a_1+a_2+\cdots+a_{25}+200k}\big].$$ (As usual, $[x]$ denotes the integer part of the number $x$ , that is, the largest integer not exceeding $x$.)

Let $a$, $b$ and $c$ positive integers. Three sequences are defined as follows: [list] [*] $a_1=a$, $b_1=b$, $c_1=c$[/*] [*] $a_{n+1}=\lfloor{\sqrt{a_nb_n}}\rfloor$, $\:b_{n+1}=\lfloor{\sqrt{b_nc_n}}\rfloor$, $\:c_{n+1}=\lfloor{\sqrt{c_na_n}}\rfloor$ for $n \ge 1$[/*] [/list] [list = a] [*]Prove that for any $a$, $b$, $c$, there exists a positive integer $N$ such that $a_N=b_N=c_N$.[/*] [*]Find the smallest $N$ such that $a_N=b_N=c_N$ for some choice of $a$, $b$, $c$ such that $a \ge 2$ y $b+c=2a-1$.[/*] [/list]

Solve in $ \mathbb{Z} $ the following system of equations: $$ \left\{\begin{matrix} 5^x-\log_2 (y+3) = 3^y\\ 5^y -\log_2 (x+3)=3^x\end{matrix}\right. . $$

Find all functions $f : \mathbb R \to \mathbb R$ for which \[f(a - b) f(c - d) + f(a - d) f(b - c) \leq (a - c) f(b - d),\] for all real numbers $a, b, c$ and $d$. Note that there is only one occurrence of $f$ on the right hand side!

Does there exist a rational $x_1$, such that all members of the sequence $x_1, x_2, \ldots, x_{2024}$ defined by $x_{n+1}=x_n+\sqrt{x_n^2-1}$ for $n=1, 2, \ldots, 2023$ are greater than $1$ and rational?

Solve the equation $ \sin x\sin 2x\cdots\sin nx+\cos x\cos 2x\cdots\cos nx =1, $ for $ n\in\mathbb{N} $ and $ x\in\mathbb{R} . $

Let $n$ be a positive even integer, and let $c_1, c_2, \dots, c_{n-1}$ be real numbers satisfying \[ \sum_{i=1}^{n-1} \left\lvert c_i-1 \right\rvert < 1. \] Prove that \[ 2x^n - c_{n-1}x^{n-1} + c_{n-2}x^{n-2} - \dots - c_1x^1 + 2 \] has no real roots.

Let $a, b, c, d$ be reals such that $a \ge b \ge c \ge d$ and \[ (a - b)^3 + (b - c)^3 + (c - d)^3 - 2(d - a)^3 - 12(a - b)^2 - 12(b - c)^2 - 12(c - d)^2 + 12(d - a)^2 - 2020(a - b)(b - c)(c - d)(d - a) = 1536. \] Find the minimum possible value of $d - a$.

Prove that there exist two functions $f,g \colon \mathbb{R} \to \mathbb{R}$, such that $f\circ g$ is strictly decreasing and $g\circ f$ is strictly increasing. [i](Poland) Andrzej Komisarski and Marcin Kuczma[/i]

Call a lattice point [i]visible[/i] if the line segment connecting the point and the origin does not pass through another lattice point. Given a positive integer $k$, denote by $S_k$ the set of all visible lattice points $(x, y)$ such that $x^2 + y^2 = k^2$. Let $D$ denote the set of all positive divisors of $2021 \cdot 2025$. Compute the sum \[ \sum_{d \in D} |S_d| \] Here, a lattice point is a point $(x, y)$ on the plane where both $x$ and $y$ are integers, and $|A|$ denotes the number of elements of the set $A$.

Let $\mathbb{S}$ be the set of all functions $f:\mathbb{Z}\rightarrow \mathbb{R}$. Now, consider the function $g:\mathbb{S} \rightarrow \mathbb{S} ,g(f(x)) = f(x + 1)-f(x)$. Now, we call a function $f \in \mathbb{S}$ good if $g^n(f(x))=0$ for some natural $n$. Prove that if $s \not = t \in S$ are good functions then $s(m)-t(m)$ is 0 for only finitely many $m \in \mathbb{Z}$.

A polynomial is [i]good[/i] if it has integer coefficients, it is monic, all its roots are distinct, and there exists a disk with radius $0.99$ on the complex plane that contains all the roots. Prove that there is no [i]good[/i] polynomial for a sufficient large degree. [i]Proposed by Rodrigo Sanches Angelo (rsa365), Brazil.[/i]

Given $a \in R^{+}$ and an integer $n > 4$ determine all n-tuples ($x_1, ...,x_n$) of positive real numbers that satisfy the following system of equations: $\begin {cases} x_1x_2(3a-2x_3) = a^3\\ x_2x_3(3a-2x_4) = a^3\\ ...\\ x_{n-2}x_{n-1}(3a-2x_n) = a^3\\ x_{n-1}x_n(3a-2x_1) = a^3 \\ x_nx_1(3a-2x_2) = a^3 \end {cases}$ .

For a positive integer $n$, a cubic polynomial $p(x)$ is said to be [i]$n$-good[/i] if there exist $n$ distinct integers $a_1, a_2, \ldots, a_n$ such that all the roots of the polynomial $p(x) + a_i = 0$ are integers for $1 \le i \le n$. Given a positive integer $n$ prove that there exists an $n$-good cubic polynomial.

Let $P(x)$ be a polynomial with rational coefficients. Prove that there exists a positive integer $n$ such that the polynomial $Q(x)$ defined by \[Q(x)= P(x+n)-P(x)\] has integer coefficients.

The sequence $a_1,a_2,\dots$ of integers satisfies the conditions: (i) $1\le a_j\le2015$ for all $j\ge1$, (ii) $k+a_k\neq \ell+a_\ell$ for all $1\le k<\ell$. Prove that there exist two positive integers $b$ and $N$ for which\[\left\vert\sum_{j=m+1}^n(a_j-b)\right\vert\le1007^2\]for all integers $m$ and $n$ such that $n>m\ge N$. [i]Proposed by Ivan Guo and Ross Atkins, Australia[/i]

Determine all the integers solutions $(x,y)$ of the following equation $$\frac{x^2-4}{2x-1}+\frac{y^2-4}{2y-1}=x+y$$

The geometric mean of a set of $m$ non-negative numbers is the $m$-th root of the product of these numbers. For which positive values of ​​$n$, is there a finite set $S_n$ of $n$ positive integers different such that the geometric mean of any subset of $S_n$ is an integer?

Is there any polynomial $P(x)$ with degree $n$ such that $ \underbrace{P(...(P(x))...)}_{m\,\, times \,\, P}$ has all roots from $1,2,..., mn$ ?