How would you compare $O((\log n)^k)$ in relation to $O(n^c)$, $n,c \in \mathbb{N}*$ ? I'm very stuck on how to go about this.
I specifically need to see how $O((\log n)^{2021})$ relates to $O(n^3)$ and $O(\log n \cdot n^2)$. Thanks for any help I'm really stumped on this one. I tried using l'hôpital or proof by induction but I'm heading nowhere.
You have found
$\log(\log n) = o(\log n)\qquad$
i.e. $\log n$ grows faster than $\log(\log n)$ at least for large enough $n$
and so $2021 \log(\log n) = o(3 \log n)$
and from this $(\log n)^{2021} = o(n^3)$.
But large enough $n$ can require a big number.
That $2021$ makes a substantial difference, with $(\log n)^{2021} > n^3$ for $n$ between $3$ and about $2.75 \times 10^{2537}$.
For very large $n$, here from about $2.76 \times 10^{2537}$, $n^3> (\log n)^{2021}$ and increasingly so for larger $n$.