# Proof by mathematical induction

Before we start, my textbook declares lgn as base two.

I only have one question, how did log2 become n (both highlighted in yellow in the picture)? Is it because log2 = 1, which is too small to even matter?

• 1) In which way is this a computer science as opposed to a pure mathematics question? Seems to me that this is about middle-grade arithmetics, which is probably a better fit for Mathematics. 2) Please get rid of the image and use Markdown and MathJax to reproduce its content. 3) You need to give attribution. Which book by whom are you referencing? – Raphael Feb 7 '17 at 10:56
• "how did log2 become n" -- it didn't. – Raphael Feb 7 '17 at 10:57

Since we're using base-$2$ logs, $\log2=1$, so $$n(\log n-\log 2) = n\big((\log n)-1\big)=n\log n -n\,.$$