Will this inequality stay preserved if I take $\log$ on both sides? EDIT: Also, can someone please try and help me work towards a solution? I am trying to solved this inequality for $k$.
$x^{2k}<\varepsilon\cdot k^k$
Here $k\in\mathbb{N}$ and $x,\varepsilon$ are fixed such that $x,\varepsilon\in\mathbb{R}$ and $\varepsilon>0$. I was thinking about taking $\log_\varepsilon$ on both sides but I am not sure about whether this will preserve the inequality or not? Moreover, I cannot really think of any other way to isolate $k$ other than to consider logarithms. 
EDIT: Can someone suggest a solution?  
Also if possible, could someone tell me what are the conditions for when the inequalities are preserved under logarithms and what are the properties that need to be satisfied by the base? EDIT: Got the answer for this! Thank you!
 A: Suppose $0 < a < c$ and $b = 1$.  The $b^k = 1$ for all $k$ and defining $\log_1$ makes no sense. So you can't use logarithms base $1$.  (Duh....)
If $b > 1$ then for every $x > 0$ there is some $k = \log_b x$ so that $b^k = x$. 
Notice that if $0 < x < 1$ then $k =\log_b x < 0$.  If $x = 1$ then $k = \log_b x = 0$.  And if $x > 1$ then $k=\log_b x > 0$.
Now if we are given that $a,c$ are positive then notice:
$a < c \iff 1 < \frac ca \iff \log_b \frac ca > 0 \iff \log_b c - \log_b a > 0 \iff \log_b a < \log_b c$.
So if $b > 1$ then you can "take the logs of both sides" to perserve inequality.
If $0 < b < 1$ then we still have for every $x > 0$ there is some $k = \log_b x$ so that $b^k = x$.  
If this is not as intuitively obvious note if $0 < b < 1$ then $M = \frac 1b > 0$ and there is $j = \log_M x$ so that $M^j = x$.  So $(\frac 1b)^{j} = b^{-j} = x$ so $k =  \log_b x = -j = -\log_M x$.  So it is true.
We get "double negatives" but...
If $x > 1$ then $b^k = x> 1\implies k =\log_b x < 0$.  Of $x = 1$ then $b^k = x=1\implies k = \log_b x = 0$ and if $0 < x < 1$ then $0<b^k = x< 1\implies k = \log_b x > 0$.
And again if $a,c$ are positive and $a < c\iff 1 < \frac ca\iff \log_b \frac ca <0 \iff \log_b c - \log_b a <0 \iff \log_b a > \log_b c$.
So....
Upshot.  You can take logs of both sides to preserve inequality if the base is more than $1$.  You can take logs of both sides to reverse inequality if the base is less that $1$.  And if the base is $1$ you can't do anything.
A: Because the log function (to a base greater than $1$) is monotonically increasing, you can take the log of both sides.  You still won't get a clean answer for $k$ given $x,\varepsilon$  If we make it an equality to find the minimum $k$ we can look at it as $$\left(\frac {x^2}k\right)^k=\varepsilon$$
If $\varepsilon$ is a small positive number as it usually is, we can see that $k$ must be greater than $x^2$.  If $x^2$ is reasonably large, $k$ will not be much larger because the power will be so high.  If $x=10, \varepsilon=10^{-6}$ we have $k \approx 113$
A: Choosing $k=\max \left( \lceil x^2\rceil+1,\ \lceil\frac{x^2}{\varepsilon}\rceil \right)$ works. Thanks to everyone for their suggestions.
A: Since $\ln$ is increasing,  we have
$$
2k\ln(|x|)<k\varepsilon\ln(k)
$$
i.e
$$
\frac{2k\ln(|x|)}{k\varepsilon}=2\varepsilon^{-1}\ln(|x|)<\ln(k)
$$
Hence
$$
k>|x|^{2/\varepsilon}
$$
