Find $ \lim_{a\rightarrow \plus{} \infty} \frac {\int_0^a \sin ^ 4 x\ dx}{a}$.

Let $\mathbb{Q^+}$ denote the set of positive rational numbers. Determine all functions $f: \mathbb{Q^+} \to \mathbb{Q^+}$ that satisfy the conditions \[ f \left( \frac{x}{x+1}\right) = \frac{f(x)}{x+1} \qquad \text{and} \qquad f \left(\frac{1}{x}\right)=\frac{f(x)}{x^3}\] for all $x \in \mathbb{Q^+}.$

Find all functions $f$ from the set of real numbers into the set of real numbers which satisfy for all $x$, $y$ the identity \[ f\left(xf(x+y)\right) = f\left(yf(x)\right) +x^2\] [i]Proposed by Japan[/i]

Find all $f : \mathbb{N} \to \mathbb{N} $ such that $f(a) + f(b)$ divides $2(a + b - 1)$ for all $a, b \in \mathbb{N}$. Remark: $\mathbb{N} = \{ 1, 2, 3, \ldots \} $ denotes the set of the positive integers.

Let $f(x)$ be a polynomial with integer coefficients such that $f(15) f(21) f(35) - 10$ is divisible by $105$. Given $f(-34) = 2014$ and $f(0) \ge 0$, find the smallest possible value of $f(0)$. [i]Proposed by Michael Kural and Evan Chen[/i]

Let $f$ be a function from $\mathbb Z$ to $\mathbb R$ which is bounded from above and satisfies $f(n)\le\frac12(f(n-1)+f(n+1))$ for all $n$. Show that $f$ is constant.

Let $f: \mathbb{Z}^2\to \mathbb{R}$ be a function. It is known that for any integer $C$ the four functions of $x$ \[f(x,C), f(C,x), f(x,x+C), f(x, C-x)\] are polynomials of degree at most $100$. Prove that $f$ is equal to a polynomial in two variables and find its maximal possible degree. [i]Remark: The degree of a bivariate polynomial $P(x,y)$ is defined as the maximal value of $i+j$ over all monomials $x^iy^j$ appearing in $P$ with a non-zero coefficient.[/i]

Let be an odd natural number $ n\ge 3. $ Find all continuous functions $ f:[0,1]\longrightarrow\mathbb{R} $ that satisfy the following equalities. $$ \int_0^1 \left( f\left(\sqrt[k]{x}\right) \right)^{n-k} dx=k/n,\quad\forall k\in\{ 1,2,\ldots ,n-1\} $$ [i]Titu Andreescu[/i]

Let $k>1$ be an integer. A function $f:\mathbb{N^*}\to\mathbb{N^*}$ is called $k$-[i]tastrophic[/i] when for every integer $n>0$, we have $f_k(n)=n^k$ where $f_k$ is the $k$-th iteration of $f$: \[f_k(n)=\underbrace{f\circ f\circ\cdots \circ f}_{k\text{ times}}(n)\] For which $k$ does there exist a $k$-tastrophic function?

Find all twice differentiable functions $f(x)$ such that $f^{\prime \prime}(x)=0$, $f(0)=19$, and $f(1)=99$.

Let $\mathbb N = \{0,1,2,\ldots\}$. Determine all functions $f: \mathbb N \to \mathbb N$ such that \[ xf(y) + yf(x) = (x+y) f(x^2+y^2) \] for all $x$ and $y$ in $\mathbb N$.

Find all functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that verify the relation $$ f\left( x^3+y^3 \right) =xf\left( y^2 \right) + yf\left( x^2 \right) , $$ for all real numbers $ x,y. $

Let $f: \mathbb{R}\to\mathbb{R}$ is a function such that $f( \cot x ) = \cos 2x+\sin 2x$ for all $0 < x < \pi$. Define $g(x) = f(x) f(1-x)$ for $-1 \leq x \leq 1$. Find the maximum and minimum values of $g$ on the closed interval $[-1, 1].$

Find all functions $f:\mathbb R\to\mathbb R$ such that $$f\left( x^2+xf(y)\right)=xf(x+y)$$ for all reals $x,y$.

Let $A$ be a set of $2025$ non-negative integers and $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ be a function with the following two properties: 1) For every two distinct positive integers $x,y$ there exists $a\in A$, such that $x-y$ divides $f(x+a) - f(y+a)$. 2) For every positive integer $N$ there exists a positive integer $t$ such that $f(x) \neq f(y)$ whenever $x,y \in [t, t+N]$ are distinct. Prove that there are infinitely many primes $p$ such that $p$ divides $f(x)$ for some positive integer $x$.

Suppose that $ R(z)= \sum_{n=-\infty}^{\infty} a_nz^n$ converges in a neighborhood of the unit circle $ \{ z : \;|z|=1\ \}$ in the complex plane, and $ R(z)=P(z) / Q(z)$ is a rational function in this neighborhood, where $ P$ and $ Q$ are polynomials of degree at most $ k$. Prove that there is a constant $ c$ independent of $ k$ such that \[ \sum_{n=-\infty} ^{\infty} |a_n| \leq ck^2 \max_{|z|=1} |R(z)|.\] [i]H. S. Shapiro, G. Somorjai[/i]

a. Prove that there are infinitely many positive integers $t$ such that both $2012t+1$ and $2013t+1$ are perfect squares. b. Suppose that $m,n$ are positive integers such that both $mn+1$ and $mn+n+1$ are perfect squares. Prove that $8(2m+1)$ divides $n$.

A cubic function $ y \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d\ (a\neq 0)$ touches a line $ y \equal{} px \plus{} q$ at $ x \equal{} \alpha$ and intersects $ x \equal{} \beta \ (\alpha \neq \beta)$. Find the area of the region bounded by these graphs in terms of $ a,\ \alpha ,\ \beta$.

4. Let $\mathbb{N}$ denote the strictly positive integers. A function $f$ : $\mathbb{N}$ $\to$ $\mathbb{N}$ has the following properties which hold for all $n \in$ $\mathbb{N}$: a) $f(n)$ < $f(n+1)$; b) $f(f(f(n)))$ = 4$n$ Find $f(2022)$.

The given parabola $y=ax^2+bx+c$ doesn't intersect the $X$-axis and passes from the points $A(-2,1)$ and $B(2,9)$. Find all the possible values of the $x$ coordinates of the vertex of this parabola.

Does there exist a strictly increasing function $f: \mathbb{R} \rightarrow \mathbb{R}$ that takes on only irrational values?

Prove that every nonzero coefficient of the Taylor series of $(1-x+x^2)e^x$ about $x=0$ is a rational number whose numerator (in lowest terms) is either $1$ or a prime number.

$x_{1}, x_{2}, \cdots, x_{n}$ are positive numbers such that $\sum_{i=1}^{n}x_{i}= 1$. Prove that \[\left( \sum_{i=1}^{n}\sqrt{x_{i}}\right) \left( \sum_{i=1}^{n}\frac{1}{\sqrt{1+x_{i}}}\right) \leq \frac{n^{2}}{\sqrt{n+1}}\]

Let $A = \left\{ 1,2,3,4,5,6,7 \right\}$ and let $N$ be the number of functions $f$ from set $A$ to set $A$ such that $f(f(x))$ is a constant function. Find the remainder when $N$ is divided by $1000$.

We call a subset $B$ of natural numbers [i]loyal[/i] if there exists natural numbers $i\le j$ such that $B=\{i,i+1,\ldots,j\}$. Let $Q$ be the set of all [i]loyal[/i] sets. For every subset $A=\{a_1<a_2<\ldots<a_k\}$ of $\{1,2,\ldots,n\}$ we set \[f(A)=\max_{1\le i \le k-1}{a_{i+1}-a_i}\qquad\text{and}\qquad g(A)=\max_{B\subseteq A, B\in Q} |B|.\] Furthermore, we define \[F(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} f(A)\qquad\text{and}\qquad G(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} g(A).\] Prove that there exists $m\in \mathbb N$ such that for each natural number $n>m$ we have $F(n)>G(n)$. (By $|A|$ we mean the number of elements of $A$, and if $|A|\le 1$, we define $f(A)$ to be zero). [i]Proposed by Javad Abedi[/i]