The function $f(x) = x^2+ax+b$ has two distinct zeros. If $f(x^2+2x-1)=0$ has four distinct zeros $x_1<x_2<x_3<x_4$ that form an arithmetic sequence, compute the range of $a-b$. [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 11)[/i]

A function $f_n(x)\ (n=1,\ 2,\ \cdots)$ is defined by $f_1(x)=x$ and \[f_n(x)=x+\frac{e}{2}\int_0^1 f_{n-1}(t)e^{x-t}dt\ (n=2,\ 3,\ \cdots)\]. Find $f_n(x)$.

Find all functions $f:\mathbb{R}\to \mathbb{R}$ such that for any real numbers $x$ and $y$ the following is true: $$x^2+y^2+2f(xy)=f(x+y)(f(x)+f(y))$$

For a given positive integer $n$ determine the maximum value of the function $f (x) = \frac{x + x^2 +...+ x^{2n-1}}{(1 + x^n)^2}$ over all $x \ge 0$ and find all positive $x$ for which the maximum is attained.

[color=blue][size=150]PERU TST IMO - 2006[/size] Saturday, may 20.[/color] [b]Question 02[/b] Find all pairs $(a,b)$ real positive numbers $a$ and $b$ such that: $[a[bn]]= n-1,$ for all $n$ positive integer. Note: [x] denotes the integer part of $x$. ---------- [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=88510]Spanish version[/url] $\text{\LaTeX}{}$ed by carlosbr

For a positive integer $n$ with prime factorization $n = p_1^{\alpha_1}p_2^{\alpha_2}\cdots p_k^{\alpha_k}$ let's define $\lambda(n) = (-1)^{\alpha_1 + \alpha_2 + \dots + \alpha_k}$. Define $L(n)$ as sum of $\lambda(x)$ over all integers from $1$ to $n$. Define $K(n)$ as sum of $\lambda(x)$ over all [b]composite[/b] integers from $1$ to $n$. For some $N>1$, we know, that for every $2\le n \le N$, $L(n)\le 0$. Prove that for this $N$, for every $2\le n \le N$, $K(n)\ge 0$. [i]Mykhailo Shtandenko[/i]

Given the vector spaces $V,W$ with coefficients over a field $K$ and function $ \phi :V\to W$ satisfying the relation : $$\varphi(\lambda x+y)= \lambda \varphi(x)+\phi (y)$$ for all $x,y \in V, \lambda \in K$. Such a function is called linear. Let $L\varphi=\{x\in V/\varphi(x)=0\}$ , and$M=\varphi(V)$ , prove that : (i) $L\varphi$ is subspace of $V$ and $M$ is subspace of $W$ (ii) $L\varphi={O}$ iff $\varphi$ is $1-1$ (iii) Dimension of $V$ equals to dimension of $L\varphi$ plus dimension of $M$ (iv) If $\theta : \mathbb{R}^3\to\mathbb{R}^3$ with $\theta(x,y,z)=(2x-z,x-y,x-3y+z)$, prove that $\theta$ is linear function . Find $L\theta=\{x\in {R}^3/\theta(x)=0\}$ and dimension of $M=\theta({R}^3)$.

Let $f:(-1,1)\to \mathbb{R}$ be a twice differentiable function such that $$2f’(x)+xf''(x)\geqslant 1 \quad \text{ for } x\in (-1,1).$$ Prove that $$\int_{-1}^{1}xf(x)dx\geqslant \frac{1}{3}.$$ [i]Proposed by Orif Ibrogimov, ETH Zurich and National University of Uzbekistan and Karim Rakhimov, Scuola Normale Superiore and National University of Uzbekistan[/i]

Find all function(s) $f:\mathbb R\to\mathbb R$ satisfying the equation \[f(x+y)+f(x)f(y)=(1+y)f(x)+(1+x)f(y)+f(xy);\] For all $x,y\in\mathbb R.$

Let \[ f(x_1,x_2,x_3,x_4,x_5,x_6,x_7)=x_1x_2x_4+x_2x_3x_5+x_3x_4x_6+x_4x_5x_7+x_5x_6x_1+x_6x_7x_2+x_7x_1x_3 \] be defined for non-negative real numbers $x_1,x_2,\dots,x_7$ with sum $1$. Prove that $f(x_1,x_2,\dots,x_7)$ has a maximum value and find that value.

For all rational $x$ satisfying $0 \leq x < 1$, the functions $f$ is defined by \[f(x)=\begin{cases}\frac{f(2x)}{4},&\mbox{for }0 \leq x < \frac 12,\\ \frac 34+ \frac{f(2x - 1)}{4}, & \mbox{for } \frac 12 \leq x < 1.\end{cases}\] Given that $x = 0.b_1b_2b_3 \cdots $ is the binary representation of $x$, find, with proof, $f(x)$.

Find all the functions $ f :\mathbb{R}\mapsto\mathbb{R} $ with the following property: $ \forall x$ $f(x)= f(x/2) + (x/2)f'(x)$

For $i=1,2,$ let $T_i$ be a triangle with side length $a_i,b_i,c_i,$ and area $A_i.$ Suppose that $a_1\le a_2, b_1\le b_2, c_1\le c_2,$ and that $T_2$ is an acute triangle. Does it follow that $A_1\le A_2$?

Let $n\geq 2$ and consider the functions $f,g:\{1,2,\dots ,n\}\rightarrow\{1,2,\dots ,n\}$ such that $$g(k)=|\{i\mid f(i)\leq f(k)\}|$$ for all $1\leq k\leq n$. [list=a] [*] Show that $f$ is bijective if and only if $g$ is bijective. [*] If $g$ is a given function, find how many functions $f$ (in terms of $g$) satisfy the hypothesis. [/list] [i]Silviu Cristea[/i]

Prove the inequalities \[\frac{u}{v}\le \frac{\sin u}{\sin v}\le \frac{\pi}{2}\times\frac{u}{v},\text{ for }0 \le u < v \le \frac{\pi}{2}\]

A function $f(S)$ assigns to each nine-element subset of $S$ of the set $\{1,2,\ldots, 20\}$ a whole number from $1$ to $20$. Prove that regardless of how the function $f$ is chosen, there will be a ten-element subset $T\subset\{1,2,\ldots, 20\}$ such that $f(T - \{k\})\neq k$ for all $k\in T$.

Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$. (For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)

Let two bijective and continuous functions$f,g: \mathbb{R}\to\mathbb{R}$ such that : $\left(f\circ g^{-1}\right)(x)+\left(g\circ f^{-1}\right)(x)=2x$ for any real $x$. Show that If we have a value $x_{0}\in\mathbb{R}$ such that $f(x_{0})=g(x_{0})$, then $f=g$.

Given an integer $ n > 3.$ Let $ a_{1},a_{2},\cdots,a_{n}$ be real numbers satisfying $ min |a_{i} \minus{} a_{j}| \equal{} 1, 1\le i\le j\le n.$ Find the minimum value of $ \sum_{k \equal{} 1}^n|a_{k}|^3.$

Determine, whether there exist a function $f$ defined on the set of all positive real numbers and taking positive values such that $f(x+y)\geqslant yf(x)+f(f(x))$ for all positive x and y?

Let $ S $ be a set of $ n $ concentric circles in the plane. Prove that if a function $ f: S\to S $ satisfies the property \[ d( f(A),f(B)) \geq d(A,B) \] for all $ A,B \in S $, then $ d(f(A),f(B)) = d(A,B) $, where $ d $ is the euclidean distance function.

Let be a nonnegative integer $ n. $ Find all continuous functions $ f:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R} $ for which the following equation holds: $$ (1+n)\int_0^x f(t) dt =nxf(x) ,\quad\forall x>0. $$

Find all functions $ f:[0,1]\longrightarrow [0,1] $ that are bijective, continuous and have the property that, for any continuous function $ g:[0,1]\longrightarrow\mathbb{R} , $ the following equality holds. $$ \int_0^1 g\left( f(x) \right) dx =\int_0^1 g(x) dx $$

$d$ and $n$ are positive integers such that $d \mid n$. The n-number sets $(x_1, x_2, \cdots x_n)$ satisfy the following condition: (1) $0 \leq x_1 \leq x_2 \leq \cdots \leq x_n \leq n$ (2) $d \mid (x_1+x_2+ \cdots x_n)$ Prove that in all the n-number sets that meet the conditions, there are exactly half satisfy $x_n=n$.

Let $A=\{a_1,a_2,\cdots,a_{2010}\}$ and $B=\{b_1,b_2,\cdots,b_{2010}\}$ be two sets of complex numbers. Suppose \[\sum_{1\leq i<j\leq 2010} (a_i+a_j)^k=\sum_{1\leq i<j\leq 2010}(b_i+b_j)^k\] holds for every $k=1,2,\cdots, 2010$. Prove that $A=B$.