log: O(n^(1 + e))

[Anood]

I have to show that, by taking k sufficiently large, I can get O(n^(1+e)) for any positive e.

I have to start with log (base k) 2k-1 and end up with 2^(1/2)<=k. Please help me in that!

 

[Gene]

Sorry, I'm completly lost. Is O a function? If so is it
O(k)=2k-1?
O(k)=log_k(2k-1)?
something else?
Where does n come in?
Please show what you have tried so I have at least a hint of what is going on.

 

[galactus]

I beleive they mean Big O notation, Gene.

http://en.wikipedia.org/wiki/Big_O_notation

 

[happy]

Double post

http://www.mathgoodies.com/forums/topic ... C_ID=29418