Find all functions, $ f:\mathbb{R}\longrightarrow\mathbb{R} , $ that have the properties that $ f^2 $ is differentiable and $ f=\left( f^2 \right)' . $

Let $a,b,c,d$ be positive real numbers such that $a+b+c+d=1$. Prove that\[ 6(a^3+b^3+c^3+d^3)\ge(a^2+b^2+c^2+d^2)+\frac{1}{8} \]

Let $ x,y,z$ be real numbers. Find the minimum value of $ x^2\plus{}y^2\plus{}z^2$ if $ x^3\plus{}y^3\plus{}z^3\minus{}3xyz\equal{}1$.

Let be a function $ f:\mathbb{R}_{>0}\longrightarrow\mathbb{R}_{>0} $ that satisfies the relation $$ \sqrt{x^2-x+1}\le f(x) e^{f(x)}\le \sqrt{x^2+x+1} , $$ for any positive real number $ x. $ Prove that [b]a)[/b] $ \lim_{x\to\infty } f(x)=\infty . $ [b]b)[/b] $ \lim_{x\to\infty } (1/x)^{1/f(x)} =1/e. $

For a positive integer $n$, denote $c_n=2017^n$. A function $f: \mathbb{N} \rightarrow \mathbb{R}$ satisfies the following two conditions. 1. For all positive integers $m, n$, $f(m+n) \le 2017 \cdot f(m) \cdot f(n+325)$. 2. For all positive integer $n$, we have $0<f(c_{n+1})<f(c_n)^{2017}$. Prove that there exists a sequence $a_1, a_2, \cdots $ which satisfies the following. For all $n, k$ which satisfies $a_k<n$, we have $f(n)^{c_k} < f(c_k)^n$.

The function $f: \mathbb{R}\rightarrow\mathbb{R}$ is twice differentiable and satisfies $f(0)=2,f'(0)=-2,f(1)=1$. Prove that there is a $\xi \in ]0,1[$ for which we have $f(\xi)\cdot f'(\xi)+f''(\xi)=0$.

Let $S$ be a finite set, and let $F$ be a family of subsets of $S$ such that a) If $A\subseteq S$, then $A\in F$ if and only if $S\setminus A\notin F$; b) If $A\subseteq B\subseteq S$ and $B\in F$, then $A\in F$. Determine if there must exist a function $f:S\to\mathbb{R}$ such that for every $A\subseteq S$, $A\in F$ if and only if \[\sum_{s\in A}f(s)<\sum_{s\in S\setminus A}f(s).\] [i]Evan O'Dorney.[/i]

A $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ where $h_i\left(x_1,x_2, \cdots , x_n\right)$ are $n$ variable polynomials with real coefficients is called [i]good[/i] if the following condition holds: For any $n$ functions $f_1,f_2, \cdots ,f_n : \mathbb R \to \mathbb R$ if for all $1 \le i \le n+1$, $P_i(x)=h_i \left(f_1(x),f_2(x), \cdots, f_n(x) \right)$ is a polynomial with variable $x$, then $f_1(x),f_2(x), \cdots, f_n(x)$ are polynomials. $a)$ Prove that for all positive integers $n$, there exists a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that the degree of all $h_i$ is more than $1$. $b)$ Prove that there doesn't exist any integer $n>1$ that for which there is a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that all $h_i$ are symmetric polynomials. [i]Proposed by Alireza Shavali[/i]

A positive proper divisor is a positive divisor of a number, excluding itself. For positive integers $n \ge 2$, let $f(n)$ denote the number that is one more than the largest proper divisor of $n$. Determine all positive integers $n$ such that $f(f(n)) = 2$.

$(FRA 5)$ Let $\alpha(n)$ be the number of pairs $(x, y)$ of integers such that $x+y = n, 0 \le y \le x$, and let $\beta(n)$ be the number of triples $(x, y, z)$ such that$ x + y + z = n$ and $0 \le z \le y \le x.$ Find a simple relation between $\alpha(n)$ and the integer part of the number $\frac{n+2}{2}$ and the relation among $\beta(n), \beta(n -3)$ and $\alpha(n).$ Then evaluate $\beta(n)$ as a function of the residue of $n$ modulo $6$. What can be said about $\beta(n)$ and $1+\frac{n(n+6)}{12}$? And what about $\frac{(n+3)^2}{6}$? Find the number of triples $(x, y, z)$ with the property $x+ y+ z \le n, 0 \le z \le y \le x$ as a function of the residue of $n$ modulo $6.$What can be said about the relation between this number and the number $\frac{(n+6)(2n^2+9n+12)}{72}$?

Find the least positive integer $n$ such that \[ \frac 1{\sin 45^\circ\sin 46^\circ}+\frac 1{\sin 47^\circ\sin 48^\circ}+\cdots+\frac 1{\sin 133^\circ\sin 134^\circ}=\frac 1{\sin n^\circ}. \]

Suppose that $f:[-1,1] \to \mathbb{R}$ is continuous and satisfies \[\left(\int_{-1}^1 e^xf(x) dx\right)^2 \ge \left(\int_{-1}^1 f(x) dx\right)\left(\int_{-1}^1 e^{2x}f(x) dx\right).\] Prove that there exists a point $c \in (-1,1)$ such that $f(c)=0$.

Prove that for every convex function $ f(x)$ defined on the interval $ \minus{}1\leq x \leq 1$ and having absolute value at most $ 1$, there is a linear function $ h(x)$ such that \[ \int_{\minus{}1}^1|f(x)\minus{}h(x)|dx\leq 4\minus{}\sqrt{8}.\] [L. Fejes-Toth]

Find all functions $f: \mathbb{R}^2 \rightarrow \mathbb{R}$, such that 1) $f(0,x)$ is non-decreasing ; 2) for any $x,y \in \mathbb{R}$, $f(x,y)=f(y,x)$ ; 3) for any $x,y,z \in \mathbb{R}$, $(f(x,y)-f(y,z))(f(y,z)-f(z,x))(f(z,x)-f(x,y))=0$ ; 4) for any $x,y,a \in \mathbb{R}$, $f(x+a,y+a)=f(x,y)+a$ .

Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ such that whenever $a>b>c>d>0$ and $ad=bc$, \[f(a+d)+f(b-c)=f(a-d)+f(b+c).\] [i]Calvin Deng.[/i]

(1) Evaluate $ \int_{\minus{}\sqrt{3}}^{\sqrt{3}}( x^2\minus{}1)dx,\ \int_{\minus{}\sqrt{3}}^{\sqrt{3}} (x\minus{}1)^2dx,\ \int_{\minus{}\sqrt{3}}^{\sqrt{3}} (x\plus{}1)^2dx$. (2) If a linear function $ f(x)$ satifies $ \int_{\minus{}\sqrt{3}}^{\sqrt{3}} (x\minus{}1)f(x)dx\equal{}5\sqrt{3},\ \int_{\minus{}\sqrt{3}}^{\sqrt{3}} (x\plus{}1)f(x)dx\equal{}3\sqrt{3}$, then we have $ f(x)\equal{}\boxed{\ A\ }(x\minus{}1)\plus{}\boxed{\ B\ }(x\plus{}1)$, thus we have $ f(x)\equal{}\boxed{\ C\ }$.

Prove that there exists just one function $ f:\mathbb{N}^2\longrightarrow\mathbb{N} $ which simultaneously satisfies: $ \text{(1)}\quad f(m,n)=f(n,m),\quad\forall m,n\in\mathbb{N} $ $ \text{(2)}\quad f(n,n)=n,\quad\forall n\in\mathbb{N} $ $ \text{(3)}\quad n>m\implies (n-m)f(m,n)=nf(m,n-m), \quad\forall m,n\in\mathbb{N} $

In how many ways can $n$ identical balls be distributed to nine persons $A,B,C,D,E,F,G,H,I$ so that the number of balls recieved by $A$ is the same as the total number of balls recieved by $B,C,D,E$ together,.

assume that k,n are two positive integer $k\leq n$count the number of permutation $\{\ 1,\dots ,n\}\ $ st for any $1\leq i,j\leq k$and any positive integer m we have $f^m(i)\neq j$ ($f^m$ meas iterarte function,)

The function $f$ from the set $\mathbb{N}$ of positive integers into itself is defined by the equality \[f(n)=\sum_{k=1}^{n} \gcd(k,n),\qquad n\in \mathbb{N}.\] a) Prove that $f(mn)=f(m)f(n)$ for every two relatively prime ${m,n\in\mathbb{N}}$. b) Prove that for each $a\in\mathbb{N}$ the equation $f(x)=ax$ has a solution. c) Find all ${a\in\mathbb{N}}$ such that the equation $f(x)=ax$ has a unique solution.

Determine which integers $n > 1$ have the property that there exists an infinite sequence $a_1, a_2, a_3, \ldots$ of nonzero integers such that the equality \[a_k+2a_{2k}+\ldots+na_{nk}=0\]holds for every positive integer $k$.

Assume that $f : [0,1)\to R$ is a function such that $f(x)-x^3$ and $f(x)-3x$ are both increasing functions. Determine if $f(x)-x^2-x$ is also an increasing function.

Let $S$ be a finite set, and let $\mathcal{A}$ be the set of all functions from $S$ to $S$. Let $f$ be an element of $\mathcal{A}$, and let $T=f(S)$ be the image of $S$ under $f$. Suppose that $f\circ g\circ f\ne g\circ f\circ g$ for every $g$ in $\mathcal{A}$ with $g\ne f$. Show that $f(T)=T$.

Let $f:\mathbb R^+ \to \mathbb R^+$ be a function such that: \[ x,y > 0 \qquad f(x+f(y)) = yf(xy+1). \] a) Show that $(y-1)*(f(y)-1) \le 0$ for $y>0$. b) Find all such functions that require the given condition.

Find all functions $ f: \mathbb{N^{*}}\to \mathbb{N^{*}}$ satisfying \[ \left(f^{2}\left(m\right)+f\left(n\right)\right) \mid \left(m^{2}+n\right)^{2}\] for any two positive integers $ m$ and $ n$. [i]Remark.[/i] The abbreviation $ \mathbb{N^{*}}$ stands for the set of all positive integers: $ \mathbb{N^{*}}=\left\{1,2,3,...\right\}$. By $ f^{2}\left(m\right)$, we mean $ \left(f\left(m\right)\right)^{2}$ (and not $ f\left(f\left(m\right)\right)$). [i]Proposed by Mohsen Jamali, Iran[/i]