Big O and Big Omega proofs

[death95317]

Help please

using the definition for O, prove that each of the following functions is O(n^2)

a 3n^2 + 100
b. 4n^2 + 50n
c. 5n^2 + 200n + 100

using the definitions of O and Omega prove the following are true (they are all proofs by contradiction)

a. n^2 / 5000 IS NOT O(n)
b. 3^n IS NOT O(2^n)
c. 1000n + 5000 IS NOT Omega(n^2)


help is appreciated and repped. Thanks in advance

[VAC Angel]

I think this classifies as a "when the hell are we gonna use this?"

[death95317]

I think this classifies as a "when the hell are we gonna use this?"

I know, It's mainly used to show the efficiency of different programs and crap in my data structures class
CSC 241 sucks