[Math] Proving Big-Omega

algorithmsasymptotics

I have a tutorial sheet that asks:

Prove that $n^2 – 3$ is $\Omega(n^2)$

I understand that:

$$f(n) ≥ c g(n) $$

And that to $c > 0$ & $n > n_{0}$

The problem is that what ever $C$ value I use I keep ending up where the $n^2$ value shall fall into the negative domain.

Any help would be greatly appreciated

Best Answer

$\dfrac{n^2}2$ remains below $n^2-3$ as of $n=3$. Then you have it.