For a particular algorithm Tn 7n2 2n3 Show that Tn is in n

For a particular algorithm, T(n) = 7n2 + 2n+3. Show that T(n) is in (n2 ) using the definition of big-Omega

Solution

f(n) is big omega of g(n) if for some constant k and m, f(n)>=k*g(n) when n>m.

Lets consider k=1 and m=0 we know for n>0 T(n)>n^2. So from the definition we can now conclude that T(n) = big omega(n^2)