Steply

Prove 3 + 9 + 27 + ... + 3^n = (3^(n + 1) - 3)/2 by induction

Step by step, with the reason for every step · Proof by induction · Discrete Math

Step by step

The question

Question: prove by induction that 3 + 9 + 27 + … + 3ⁿ = (3ⁿ ⁺ ¹ − 3)/2.

3 + 9 + 27 + … + 3n = 3n + 1 − 32

Induction works like dominoes.

Push the first one: it is true for n = 1.

Then show each one knocks over the next: if it is true for k, it is true for k + 1.

Then they all fall.

1 Check n = 1

For n = 1 the left side is just the first number, 3.

The right side with n = 1 is also 3.

The first domino falls.

3 = 31 + 1 − 32 = 3
✓ n = 1 works

2 Assume it works for k

Now suppose it works for some whole number k: the sum up to k equals the formula with k.

3 + 9 + 27 + … + 3k = 3k + 1 − 32
we assume this

3 What we must show

We must show it for k + 1: one more term, 3ᵏ ⁺ ¹, and every n on the right becomes k + 1.

3 + 9 + 27 + … + 3k + 3k + 1 = 3(k + 1) + 1 − 32

Tidy the brackets.

= 3k + 2 − 32
we must get this

Careful!

k + 1 goes into every n of the formula.

Adding 1 at the end is not the same.

Careful: not 3k + 1 − 32 + 1 ✗

4 Use the assumption

The left side starts with the sum up to k.

By our assumption, that is the formula with k.

We swap it in.

3 + 9 + 27 + … + 3k + 3k + 1 = 3k + 1 − 32 + 3k + 1

5 Make both sides the same

Same bottom: 3ᵏ ⁺ ¹ is 2 times it, over 2.

= 3k + 1 − 3 + 2 × 3k + 12

Open the brackets.

= 3 × 3k − 3 + 6 × 3k2

Like terms together.

= 9 × 3k − 32

Now the right side, the one we must get.

A power with k + 1 is one more of the same number.

3k + 2 − 32 = 9 × 3k − 32

The same as the left side!

So if it works for k, it works for k + 1.

= the left side ✓

It is true for n = 1, and each n passes it on to the next.

So it is true for every whole number n.

The proof is done.

true for n = 1, and k → k + 1: true for every n ≥ 1. ∎

6 Check

Let's check n = 4 by adding: 3 + 9 + 27 + 81 is 120.

n = 4: 3 + 9 + 27 + 81 = 120

And the formula with 4: also 120.

Right!

34 + 1 − 32 = 120

Let's look back.

First: check n = 1.

Then: assume it works for k.

Then: what we must show.

Then: use the assumption.

Then: make both sides the same.

Last: check.

Answer
= the left side ✓

Your turn

Try this one yourself, then check:

1 + 4 + 16 + … + 4n − 1 = 4n − 13
Show the answer
4 × 4k − 13

More from Proof by induction

The whole lesson: Proof by induction →