I want to demonstrate this relation. I know that $f(n)=\Theta(g(n))$ when $\exists c_1>0, c_2>0, n_o\in \mathbb{N} \mid \forall n \geq n_0$ for which: $$c_1g(n) \leq f(n) \leq c_2g(n)$$ For the first part of the relation, I have $c_1n^2 \leq n\log_{10}(n)$. How can I now demostrate that these $c_1$ and $n$ exist (or better, don't exist, since I know that the initial equation is wrong)?
EDIT: Sorry, I forgot to say. I can't use logarithms, only the definition of $\Theta$