While going through some solutions of calculating algorithm complexity, i came across this statement
$\frac{1}{1} + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + ........ + \frac{1}{n} = logn$
For example this is one question which came in GATE 2017 https://gateoverflow.in/118283/gate2017-2-38
I tried to prove it by mathematical induction, where P(n) = $\frac{1}{1} + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + ........ + \frac{1}{n}$
Basis : P(1) = 1 and Log (1) = 0, even basis is not true.
Let me know what i am missing, and is this the correct expansion of log n