I have an inequality:
$$ n \ge C\log^k n \times (A\log(n^r\log^l n) + B)$$
I want to turn it into an inquality
$$n > F(A,B,C,k,l,r)$$
that implies the first inequality, while making it $F$ as tight as possible. How can I do that?
I have an inequality:
$$ n \ge C\log^k n \times (A\log(n^r\log^l n) + B)$$
I want to turn it into an inquality
$$n > F(A,B,C,k,l,r)$$
that implies the first inequality, while making it $F$ as tight as possible. How can I do that?
I don't think you will get a satisfying bound on n without iteration. You can expand the right side to $n \ge AC*log^{(k+r)}n+AC*log^kn*log log^ln+BClog^kn$. If n is very large, you can even ignore all but the first term as it will dominate. Using the fact that $log n$ varies slowly with $n$, start with some guess for $log n$, such as 1 or 2. Plug it in to the right hand side and calculate a new value of n. Then calculate $logn$. Continue to convergence, which should be quick.