I need to prove that f(n) = Ѳ(n) when f:N -> R defined by <= since log2n<=n (I left out these works) = 6n for n>0 since each term >= 0 >= since log2n is >= 0 for n>=1 >= = for n>0 Therefore f(n) = Ѳ(n) is it ok?
Follow Math Help Forum on Facebook and Google+
For the first part, I would just go with It's a sharper bound, if you care for such things. Assuming the steps you've left out are valid, it looks ok to me.
Thanks Ackbeet, I'm really learning a lot of little extras from posting on this forum, things that are not covered in my lecture notes.
You're welcome. Have a good one!
View Tag Cloud