I am doing an exercise in approximation algorithms course, and my algorithm takes as input a constant number $\alpha$ and finds the minimal $k_{0}$ s.t $\sqrt[k]{\alpha}<1+ε$ (this would promise me a $1+ε$ approximation).
Clearly, such $k_{0}$ exist and I am not bothered with calculating it within my algorithm. What I am bothered about is how my solution behaves as $ε\to0$.
My question is this: Is $k_{0}$, which is the minimal solution for $\sqrt[k]{\alpha}<1+ε$, polynomial in $\dfrac{1}{ε}$?
Since$$ α^{\frac{1}{k}} < 1 + ε \Longleftrightarrow \frac{1}{k} \ln α < \ln(1 + ε) \Longleftrightarrow k > \frac{\ln α}{\ln(1 + ε)}, $$ then$$ k_0 = \frac{\ln α}{\ln(1 + ε)} \sim \frac{\ln α}{ε} = \ln α · \frac{1}{ε}. \quad (ε \to 0^+) $$