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 nlog_{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$
Well take $c_1\geq10^{-t}$ for some $t$ then you have that for $n=10^{2t}$ for example that $$c_110^{4t}\leq 10^{2t}2t\\2t\geq c_110^{2t}\geq10^t$$ But $2t< 10^t$ for any $t\geq1$ contradiction; hence there doesn't exist such $c_1$ since by assumption $t$ is arbitrary