Let $\mathcal F = \{ f: [0,1] \to [0,\infty) \mid f$ continuous $\}$ and $n$ an integer, $n\geq 2$. Find the smallest real constant $c$ such that for any $f\in \mathcal F$ the following inequality takes place \[ \int^1_0 f \left( \sqrt [n] x \right) dx \leq c \int^1_0 f(x) dx.  \]
1. **Identify the problem and the function space:**
   We are given the function space $\mathcal{F} = \{ f: [0,1] \to [0,\infty) \mid f \text{ continuous} \}$ and need to find the smallest constant $c$ such that for any $f \in \mathcal{F}$, the inequality
   \[
   \int_0^1 f \left( \sqrt[n]{x} \right) dx \leq c \int_0^1 f(x) dx
   \]
   holds.

2. **Change of variables:**
   To simplify the integral on the left-hand side, we perform a change of variables. Let $u = \sqrt[n]{x}$, hence $x = u^n$. Then, $dx = nu^{n-1} du$. Substituting these into the integral, we get:
   \[
   \int_0^1 f \left( \sqrt[n]{x} \right) dx = \int_0^1 f(u) \cdot n u^{n-1} du = n \int_0^1 u^{n-1} f(u) du.
   \]

3. **Establishing the inequality:**
   We need to show that:
   \[
   n \int_0^1 u^{n-1} f(u) du \leq c \int_0^1 f(x) dx.
   \]
   To find the smallest $c$, we consider the properties of the function $u^{n-1}$ over the interval $[0,1]$. Note that $u^{n-1} \leq 1$ for $u \in [0,1]$ and $n \geq 2$.

4. **Bounding the integral:**
   Since $u^{n-1} \leq 1$, we have:
   \[
   n \int_0^1 u^{n-1} f(u) du \leq n \int_0^1 f(u) du.
   \]
   This suggests that $c \geq n$.

5. **Checking the tightness of the bound:**
   To check if $c = n$ is indeed the smallest constant, consider a function $f$ that is supported on $[1-\delta, 1]$ for a small $\delta > 0$. For such a function, $f(u) = 0$ for $u \in [0, 1-\delta)$ and $f(u) > 0$ for $u \in [1-\delta, 1]$. Then:
   \[
   n \int_0^1 u^{n-1} f(u) du \approx n (1-\delta)^{n-1} \int_{1-\delta}^1 f(u) du.
   \]
   As $\delta \to 0$, $(1-\delta)^{n-1} \to 1$, and thus:
   \[
   n \int_0^1 u^{n-1} f(u) du \approx n \int_0^1 f(u) du.
   \]
   This shows that $c = n$ is indeed the smallest constant that satisfies the inequality for all $f \in \mathcal{F}$.

\(\blacksquare\)

The final answer is \( \boxed{ c = n } \).