it's related to an inequality wich has a link with Dottie number :
It's simple define the following functions : $f(x)=\frac{\sin(x)}{x}$ and $g_n(x)= \cos(\cos(\cdots(x)\cdots)$ where we compose $n$ times the function $\cos(x)$ with herself and on each interval between two consecutive zeroes of $f^{(n)}$ we have : $$\max |f^{(n)}(x)|> \max\left|\frac{g_n(x)}{x}\right| $$
My question is how to prove the inequality above ?
Edit :I add the condition $x\geq n^2\geq 16$
I think we can implement a recurrent inequality of Redheffer like this :
Theorem : Let $f_k(a_1,\cdots,a_k),g_k(a_1,\cdots,a_k)$ be real-valued functions defined for $a_k$ in the set $D_k$,$1\leq k \leq n $ and for wich there exist real-valued functions $F_k$ such that for all $k$,$1\leq k\leq n$, $$\underset{a_k \in D_k}{\sup}(\mu f_k(a_1,\cdots,a_k)-g_k(a_1,\cdots,a_k))=F_k(\mu)f_{k-1}(a_1,\cdots,a_{k-1})$$ where $f_0=1$.Then $$\sum_{k=1}^{n}\mu_k f_k(a_1,\cdots,a_k)\leq \sum_{k=1}^{n}g_k(a_1,\cdots,a_k)$$provided we can find real numbers $\lambda_k$,$1\leq k\leq n+1$ such that :
$\lambda_1\leq 0$$\quad$$\lambda_{n+1}=0$$\quad$$\lambda_{k}=F_k^{-1}(\lambda_{k})-\lambda_{k+1}$
Where $F_k^{-1}(y)$ denotes any $x$ such that $F_k(x)=y$
Thanks a lot .