Prove that
1 + 1/2 + 1/3 + ... + 1/n is O(log n). Assume n = 2^k
I put the series into the summation, but I have no idea how to tackle this problem. Any help is appreciated
Hence k = log (n) . So, number of times it ran = log(n) + 1 = O(log n) .
This follows easily from a simple fact in Calculus:
and we have the following inequality:
Here we can conclude that S = 1 + 1/2 + ... + 1/n is both Ω(log(n)) and O(log(n)), thus it is Ɵ(log(n)), the bound is actually tight.
Here's a formulation using Discrete Mathematics:
So, H(n) = O(log n)
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With