Let $A = \left \{ \sqrt[n]{n} \mid n \in \mathbb{N}\right \}$. I need to find and prove the infimum of $A$.
Because $n \in \mathbb{N},$ we can know for sure that $\sqrt[n]{n} \geq 1$. (Does that need a deeper proof?)
Then to prove that $1$ is the infimum, for $\forall \varepsilon>0$, I need to find a certain $n \in \mathbb{N}$ that makes $$\sqrt[n]{n} < 1 + \varepsilon$$
How do I "engineer" that $n \in \mathbb{N}$ ?
What's the trick? Raising $\sqrt[n]{n} < 1 + \varepsilon $ to the power of $n$ doesn't really help.
The infimum of $A$ is $1$ because $1\in A$ (just take $n=1$) and $n>1\implies\sqrt[n]n>1$.
On the other hand, you can write $\sqrt[n]n$ as $1+\varepsilon_n$ and then\begin{align}n&=\sqrt[n]n^n\\&=(1+\varepsilon_n)^n\\&=1+n\varepsilon_n+\frac{n(n-1)}2{\varepsilon_n}^2+\cdots\\&>\frac{n(n-1)}2{\varepsilon_n}^2\end{align}and therefore$$\varepsilon_n<\sqrt{\frac2{n-1}},$$if $n>1$.