Big-O notation help...

[chiwawa626]

I was wondering if any of the CS majors could help me out on a problem:

I need to prove the problem below is true or false, but I don't know how I'd do that since the O part has 2 things in it...

n^(1/3) is O(n^(1/4)+log(n))


Please help me atleast get started...

 

[TuxDave]

False? Can't you reduce the big O like how O(n^2+n) is essentially O(n^2)

Isn't n^(1/4) a higher order than log(n) and so log(n) can be removed?

 

[chiwawa626]

Hmm thats what I was thinking TuxDave, but can I do that formally somehow?

 

[ActuaryTm]

Originally posted by: chiwawa626
I was wondering if any of the CS majors???? could help me out on a problem

As the possessor of a mathematics degree, I am greatly offended by the omission in the above, and thus cannot offer assistance.

 

[chiwawa626]

Originally posted by: ActuaryTm

Originally posted by: chiwawa626
I was wondering if any of the CS majors???? could help me out on a problem

As the possessor of a mathematics degree, I am greatly offended by the omission in the above, and thus cannot offer assistance.

Prove yourself worth of a mension by actaully answering the question and i will forever remember the significance of your degree...until then, bah!

 

[TuxDave]

Originally posted by: chiwawa626
Hmm thats what I was thinking TuxDave, but can I do that formally somehow?

Uhh... I dunno, limits? Beats me. I took only one class in big o notation and never really had to touch it since.