Inductive Hypothesis (assume that n=k is true)

Assume that 101 + 102 + 103 + … + 10k = 10/9 (10k – 1) is true for some K in the set of positive
integers.

Inductive step (show that n=k is true => n=k+1 is also true)

101 + 102 + 103 + … + 10k + 10k+1 = 10/9 (10k – 1) + 10k+1

= 10/9 (10k – 1) + 10/9 x 9/10 x 10k + 1

= 10/9 [(10k – 1) + 9/10 x 10k+1]

= 10/9 (10k – 1 + 9/10 x101 x 10k )

= 10/9 (1x10k - 1 + 9 x 10k )

= 10/9 (101x10k - 1)

= 10/9 (10k+1 – 1)

Since the statement is true for n=1, and true for n=k follows that n=k+1 is also true then the
statement is true for all positive integers n.