FP1 Chapter 6

Heinemann Solutionbank: Further Pure FP1 Page 1 of 1
Solutionbank FP1
Edexcel AS and A Level Modular Mathematics
Proof by mathematical induction
Exercise A, Question 1
Question:
Prove by the method of mathematical induction, the following statement for n Z+.
n
1
r= 2
n(n + 1)
r=1
Solution:
1
n = 1; LHS = r=1
r=1
1
RHS = (1)(2) = 1
2
As LHS = RHS, the summation formula is true for n = 1.
Assume that the summation formula is true for n = k.
k
1
ie. r= 2
k(k + 1).
r=1
With n = k + 1 terms the summation formula becomes:
k +1
r = 1 + 2 + 3+ +k + (k + 1)
r=1
1
= k(k + 1) + (k + 1)
2
1
= (k + 1)(k + 2)
2
1
= (k + 1)(k + 1 + 1)
2
Therefore, summation formula is true when n = k + 1.
If the summation formula is true for n = k, then it is shown to be true for n = k + 1. As the result is true for n = 1, it is now
also true for all n 1 and n Z+ by mathematical induction.
Pearson Education Ltd 2008
PhysicsAndMathsTutor.com
file://C:\Users\Buba\kaz\ouba\fp1_6_a_1.html 3/18/2013
Solutionbank FP1
Question:
n
1 2
r3 = 4
n (n + 1)2
r=1
Solution:
1
n = 1; LHS = r3 = 1
r=1
1 2 2 1
RHS = (1) (2) = (4) = 1
4 4
k
1 2
ie. r3 = 4
k (k + 1)2.
r=1
k +1
r3 = 13 + 23 + 33+ +k 3 + (k + 1)3
r=1
1 2
= k (k + 1)2 + (k + 1)3
4
1
= (k + 1)2k 2 + 4(k + 1)
4
1
= (k + 1)2(k 2 + 4k + 4)
4
1
= (k + 1)2(k + 2)2
4
1
= (k + 1)2(k + 1 + 1)2
4
Solutionbank FP1
Question:
n
1
r(r 1) = 3
n(n + 1)(n 1)
r=1
Solution:
1
n = 1; LHS = r(r 1) = 1(0) = 0
r=1
1
RHS = (1)(2)(0) = 0
3
k
1
ie. r(r 1) = 3
k(k + 1)(k 1).
r=1
k +1
r(r 1) = 1(0) + 2(1) + 3(2)+ +k(k 1) + (k + 1)k
r=1
1
= k(k + 1)(k 1) + (k + 1)k
3
1
= k(k + 1)[(k 1) + 3]
3
1
= k(k + 1)(k + 2)
3
1
= (k + 1)(k + 2)k
3
1
= (k + 1)(k + 1 + 1)(k + 1 1)
3
Solutionbank FP1
Question:
1
(1 6) + (2 7) + (3 8)+ +n(n + 5) = n(n + 1)(n + 8)
3
Solution:
n
1 1
The identity (1 6) + (2 7) + (3 8)+ +n(n + 5) = n(n + 1)(n + 8) can be rewritten as
3
r(r + 5) = 3
n(n + 1)(n + 8).
r=1
1
n = 1; LHS = r (r + 5) = 1(6) = 6
r =1
1 1
RHS = (1)(2)(9) = (18) = 6
3 3
Assume that the summation formula is true for n = k .
k
1
ie. r(r + 5) = 3
k(k + 1)(k + 8).
r=1
k+1
r(r + 5) = 1(6) + 2(7) + 3(8)+ +k(k + 5) + (k + 1)(k + 6)
r=1
1
= k(k + 1)(k + 8) + (k + 1)(k + 6)
3
1
= (k + 1)[k(k + 8) + 3(k + 6)]
3
1
= (k + 1)k 2 + 8k + 3k + 18
3
1
= (k + 1)k + 11k + 18
2
3
1
= (k + 1)(k + 9)(k + 2)
3
1
= (k + 1)(k + 2)(k + 9)
3
1
= (k + 1)(k + 1 + 1)(k + 1 + 8)
3
If the summation formula is true for n = k , then it is shown to be true for n = k + 1. As the result is true for n = 1, it is now also
true for all n 1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
n
r(3r 1) = n 2(n + 1)
r=1
Solution:
1
n = 1; LHS = r(3r 1) = 1(2) = 2
r=1
2
RHS = 1 (2) = (1)(2) = 2
k
ie. r(3r 1) = k 2(k + 1).
r=1
k +1
r(3r 1) = 1(2) + 2(5) + 3(8)+ +k(3k 1) + (k + 1)(3(k + 1) 1)
r=1
= k 2(k + 1) + (k + 1)(3k + 3 1)
= k 2(k + 1) + (k + 1)(3k + 2)
= (k + 1)k 2 + 3k + 2

= (k + 1)(k + 2)(k + 1)
= (k + 1)2(k + 2)
= (k + 1)2(k + 1 + 1)
Solutionbank FP1
Question:
n
1
(2r 1)2 = 3
n(4n 2 1)
r=1
Solution:
1
n = 1; LHS = (2r 1)2 = 12 = 1
r =1
1 1
RHS = (1)(4 1) = (1)(3) = 1
3 3
k
1 1
ie. (2r 1)2 = 3
k(4k 2 1) = k(2k + 1)(2k 1).
3
r=1
k+1
(2r 1)2 = 12 + 32 + 52 + +(2k 1)2 + (2(k + 1) 1)2
r=1
1
= k(4k 2 1) + (2k + 2 1)2
3
1
= k(4k 2 1) + (2k + 1)2
3
1
= k(2k + 1)(2k 1) + (2k + 1)2
3
1
= (2k + 1)[k(2k 1) + 3(2k + 1)]
3
1
= (2k + 1)2k 2 k + 6k + 3
3
1
= (2k + 1)2k 2 + 5k + 3
3
1
= (2k + 1)(k + 1)(2k + 3)
3
1
= (k + 1)(2k + 3)(2k + 1)
3
1
= (k + 1)[2(k + 1) + 1][2(k + 1) 1]
3
1
= (k + 1)4(k + 1) 2 1
3
Solutionbank FP1
Question:
n
2r = 2n+1 2
r=1
Solution:
1
n = 1; LHS = 2r = 21 = 2
r=1
2
RHS = 2 2 = 4 2 = 2
k
ie. 2r = 2k +1 2.
r=1
k +1
2r = 21 + 22 + 23+ +2k + 2k +1
r=1
= 2k +1 2 + 2k+1
= 2(2k+1) 2
= 21(2k+1) 2
= 21+k +1 2
= 2k +1+1 2
Solutionbank FP1
Question:
n
4n 1
4r1 = 3
r=1
Solution:
1
n = 1; LHS = 4r1 = 40 = 1
r=1
41 3
RHS = = =1
3 3
k
4k 1
ie. 4r1 = 3
.
r=1
k +1
4r1 = 40 + 41 + 42+ +4k1 + 4k+11
r=1
4k 1
= + 4k
3
4k 1 3(4k )
= +
3 3
4k 1 + 3(4k )
=
3
4(4k ) 1
=
3
41(4k ) 1
=
3
4k +1 1
=
3
Solutionbank FP1
Question:
n
r(r !) = (n + 1) ! 1
r=1
Solution:
1
n = 1; LHS = r(r !) = 1(1 !) = 1(1) = 1
r=1
RHS = 2 ! 1 = 2 1 = 1
k
ie. r(r !) = (k + 1) ! 1.
r=1
k +1
r(r !) = 1(1 !) + 2(2 !) + 3(3 !)+ +k(k !) + (k + 1)[(k + 1) !]
r=1
= (k + 1) ! 1 + (k + 1)[(k + 1) !]
= (k + 1) ! + (k + 1)[(k + 1) !] 1
= (k + 1) ! [1 + k + 1] 1
= (k + 1) ! (k + 2) 1
= (k + 2) ! 1
= (k + 1 + 1) ! 1
Solutionbank FP1
Question:
2n
1
r2 = 3
n(2n + 1)(4n + 1)
r=1
Solution:
2
n = 1; LHS = r 2 = 12 + 22 = 1 + 4 = 5
r =1
1 1
RHS = (1)(3)(5) = (15) = 5
3 3
2k
1
ie. r2 = 3
k(2k + 1)(4k + 1).
r=1
2(k+1) 2k+2
r2 = r 2 = 12 + 22 + 32 + +k 2 + (2k + 1)2 + (2k + 2)2
r=1 r=1
1
= k(2k + 1)(4k + 1) + (2k + 1)2 + (2k + 2)2
3
1
= k(2k + 1)(4k + 1) + (2k + 1)2 + 4(k + 1)2
3
1
= (2k + 1)[k(4k + 1) + 3(2k + 1)] + 4(k + 1)2
3
1
= (2k + 1)[4k 2 + 7k + 3] + 4(k + 1)2
3
1
= (2k + 1)(4k + 3)(k + 1) + 4(k + 1)2
3
1
= (k + 1)[(2k + 1)(4k + 3) + 12(k + 1)]
3
1
= (k + 1)[8k 2 + 6k + 4k + 3 + 12k + 12]
3
1
= (k + 1)[8k 2 + 22k + 15]
3
1
= (k + 1)(2k + 3)(4k + 5)
3
1
= (k + 1)[2(k + 1) + 1][4(k + 1) + 1]
3
Solutionbank FP1
Exercise B, Question 1
Question:
Use the method of mathematical induction to prove the following statement for n Z+.
8 n 1 is divisible by 7
Solution:
Let f(n) = 8n 1, where n Z+.
f(1) = 81 1 = 7, which is divisible by 7.
f(n) is divisible by 7 when n = 1.
Assume that for n = k ,
f(k ) = 8k 1 is divisible by 7 for k Z+.
f(k + 1) = 8k +1 1
= 8k .81 1
= 8(8k ) 1
f(k + 1) f(k) = [8(8k ) 1] [8k 1]

= 8(8k ) 1 8k + 1
= 7(8k )
f(k + 1) = f(k ) + 7(8k )
As both f(k) and 7(8k ) are divisible by 7 then the sum of these two terms must also be divisible by 7. Therefore f(n) is
divisible by 7 when n = k + 1.
If f(n) is divisible by 7 when n = k, then it has been shown that f(n) is also divisible by 7 when n = k + 1. As f(n) is
divisible by 7 when n = 1, f(n) is also divisible by 7 for all n 1 and n Z+ by mathematical induction.
file://C:\Users\Buba\kaz\ouba\fp1_6_b_1.html 3/18/2013
Solutionbank FP1
Question:
32n 1 is divisible by 8
Solution:
f(1) = 32(1) 1 = 9 1 = 8, which is divisible by 8.
f(k + 1) = 32(k +1) 1

= 32k +2 1
= 32k .32 1
= 9(32k ) 1
f(k + 1) f(k ) = [9(32k ) 1] [32k 1]

= 9(32k ) 1 32k + 1
= 8(32k )
f(k + 1) = f(k ) + 8(32k )
Solutionbank FP1
Question:
5n + 9 n + 2 is divisible by 4
Solution:
Let f(n) = 5n + 9n + 2, where n Z+.
f(1) = 51 + 91 + 2 = 5 + 9 + 2 = 16, which is divisible by 4.
f(k ) = 5k + 9k + 2 is divisible by 4 for k Z+.
f(k + 1) = 5k+1 + 9k +1 + 2
= 5k .51 + 9k .91 + 2
= 5(5k ) + 9(9k ) + 2
f(k + 1) f(k ) = [5(5k ) + 9(9k ) + 2] [5k + 9k + 2]

= 5(5k ) + 9(9k ) + 2 5k 9k 2
= 4(5k ) + 8(9k )
= 4[5k + 2(9)k ]
f(k + 1) = f(k ) + 4[5k + 2(9)k ]
As both f(k) and 4[5k + 2(9)k ] are divisible by 4 then the sum of these two terms must also be divisible by 4. Therefore f
(n) is divisible by 4 when n = k + 1.
Solutionbank FP1
Question:
24n 1 is divisible by 15
Solution:
f(1) = 24(1) 1 = 16 1 = 15, which is divisible by 15.
Assume that for n = k,
f(k + 1) = 24(k+1) 1
= 24k +4 1
= 24k .24 1
= 16(24k ) 1
f(k + 1) f(k) = [16(24k ) 1] [24k 1]

= 16(24k ) 1 24k + 1
= 15(8k )
f(k + 1) = f(k ) + 15(8k )
Solutionbank FP1
Question:
32n1 + 1 is divisible by 4
Solution:
Let f(n) = 32n1 + 1, where n Z+.
f(1) = 32(1)1 + 1 = 3 + 1 = 4, which is divisible by 4.
f(k ) = 32k 1 + 1 is divisible by 4 for k Z+.
f(k + 1) = 32(k +1)1 + 1

= 32k+21 + 1
= 32k1.32 + 1
(
= 9 32k1 + 1 )
f(k + 1) f(k ) = 9(32k1) + 1 32k 1 + 1

( )
= 9 32k1 + 1 32k1 1
= 8(32k1)
f(k + 1) = f(k ) + 8 32k 1

( )
As both f(k) and 8 32k 1 are divisible by 4 then the sum of these two terms must also be divisible by 4. Therefore f(n) is
( )
Solutionbank FP1
Question:
n 3 + 6n 2 + 8n is divisible by 3
Solution:
Let f(n) = n3 + 6n 2 + 8n, where n 1 and n Z+.
f(1) = 1 + 6 + 8 = 15, which is divisible by 3.
f(k ) = k 3 + 6k 2 + 8k is divisible by 3 for k Z+.
f(k + 1) = (k + 1)3 + 6(k + 1)2 + 8(k + 1)

= k 3 + 3k 2 + 3k + 1 + 6(k 2 + 2k + 1) + 8(k + 1)
= k 3 + 3k 2 + 3k + 1 + 6k 2 + 12k + 6 + 8k + 8
= k 3 + 9k 2 + 23k + 15
f(k + 1) f(k ) = [k 3 + 9k 2 + 23k + 15] [k 3 + 6k 2 + 8k]

= 3k 2 + 15k + 15
= 3(k 2 + 5k + 5)
(
f(k + 1) = f(k ) + 3 k 2 + 5k + 5 )
( )
As both f(k) and 3 k 2 + 5k + 5 are divisible by 3 then the sum of these two terms must also be divisible by 3.
Therefore f(n) is divisible by 3 when n = k + 1.
Solutionbank FP1
Question:
n 3 + 5n is divisible by 6
Solution:
Let f(n) = n3 + 5n, where n 1 and n Z+.
f(1) = 1 + 5 = 6, which is divisible by 6.
f(k ) = k 3 + 5k is divisible by 6 for k Z+.
f(k + 1) = (k + 1)3 + 5(k + 1)

= k 3 + 3k 2 + 3k + 1 + 5(k + 1)
= k 3 + 3k 2 + 3k + 1 + 5k + 5
= k 3 + 3k 2 + 8k + 6
f(k + 1) f(k) = [k 3 + 3k 2 + 8k + 6] [k 3 + 5k] Let k(k + 1) = 2m, m Z+, as the

product of two consecutive integers
= 3k 2 + 3k + 6 must be even.
= 3k(k + 1) + 6
= 3(2m) + 6
= 6m + 6
= 6(m + 1)
f(k + 1) = f(k ) + 6(m + 1).
As both f(k) and 6(m + 1) are divisible by 6 then the sum of these two terms must also be divisible by 6. Therefore f(n) is
Solutionbank FP1
Question:
2n .32n 1 is divisible by 17
Solution:
Let f(n) = 2n.32n 1, where n Z+.
f(1) = 21.32(1) 1 = 2(9) 1 = 18 1 = 17, which is divisible by 17.
f(k ) = 2k .32k 1 is divisible by 17 for k Z+.
f(k + 1) = 2k +1.32(k +1) 1

= 2k (2)1(3)2k (3)2 1
= 2k (2)1(3)2k (9) 1
= 18(2k .32k ) 1
f(k + 1) f(k ) = 18(2k .32k ) 1 2k .32k 1

= 18(2k .32k ) 1 2k .32k + 1
= 17(2k .32k )
f(k + 1) = f(k ) + 17(2k .32k )
As both f(k) and 17(2k .32k ) are divisible by 17 then the sum of these two terms must also be divisible by 17.
divisible by 17 when n = 1, f(n ) is also divisible by 17 for all n 1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
f(n) = 13n 6n, n Z+.
a Express for k Z+, f(k + 1) 6f(k ) in terms of k, simplifying your answer.
b Use the method of mathematical induction to prove that f(n) is divisible by 7 for all n Z+.
Solution:
f(k + 1) = 13k +1 6k +1
= 13k .131 6k .61
= 13(13k ) 6(6k )
f(k + 1) 6f(k) = 13(13k ) 6(6k ) 613k 6k

= 13(13k ) 6(6k ) 6(13k ) + 6(6k )
= 7(13k )
b f(n ) = 13n 6n, where n Z+.
f(n ) is divisible by 7 when n = 1.
f(k ) = 13k 6k is divisible by 7 for k Z+.
From (a), f(k + 1) = 6f(k ) + 7(13k )
As both 6f(k ) and 7(13k ) are divisible by 7 then the sum of these two terms must also be divisible by 7. Therefore f(n) is
If f(n ) is divisible by 7 when n = k, then it has been shown that f(n ) is also divisible by 7 when n = k + 1. As f(n ) is divisible
by 7 when n = 1, f(n ) is also divisible by 7 for all n 1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
g(n) = 52n 6n + 8, n Z+.
a Express for k Z+, g(k + 1) 25g(k ) in terms of k, simplifying your answer.
b Use the method of mathematical induction to prove that g(n) is divisible by 9 for all n Z+.
Solution:
g(k + 1) = 52(k +1) 6(k + 1) + 8

= 52k .52 6k 6 + 8
= 25(52k ) 6k + 2
g(k + 1) 25g(k ) = 25(52k ) 6k + 2 2552k 6k + 8

= 25(52k ) 6k + 2 25(52k ) + 150k 200
= 144k 198
g(n) = 52n 6n + 8, where n Z+.
g(1) = 52 6(1) + 8 = 25 6 + 8 = 27, which is divisible by 9.
g(n) is divisible by 9 when n = 1.
g(k ) = 52k 6k + 8 is divisible by 9 for k Z+.
From(a), g(k + 1) = 25g(k) + 144n 198

= 25g(k) + 18(8n 11)
As both 25g(k ) and 18(8n 11) are divisible by 9 then the sum of these two terms must also be divisible by 9. Therefore
g(n) is divisible by 9 when n = k + 1.
If g(n ) is divisible by 9 when n = k, then it has been shown that g(n ) is also divisible by 9 when n = k + 1. As g(n ) is
divisible by 9 when n = 1, g(n ) is also divisible by 9 for all n 1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
Use the method of mathematical induction to prove that 8n 3n is divisible by 5 for all n Z+.
Solution:
f(n) = 8n 3n, where n Z+.
f(k ) = 8k 3k is divisible by 5 for k Z+.
f(k + 1) = 8k +1 3k +1
= 8k .81 3k .31
= 8(8k ) 3(3k )
f(k + 1) 3f(k) = 8(8k ) 3(3k ) 38k 3k

= 8(8k ) 3(3k ) 3(8k ) + 3(3k )
= 5(8k )
From (a), f(k + 1) = f(k ) + 5(8k )
As both f(k ) and 5(8k ) are divisible by 5 then the sum of these two terms must also be divisible by 5. Therefore f(n) is
Solutionbank FP1
Question:
Use the method of mathematical induction to prove that 32n+2 + 8n 9 is divisible by 8 for all n Z+.
Solution:
f(n) = 32n+2 + 8n 9, where n Z+.
f(1) = 32(1)+2 + 8(1) 9
= 34 + 8 9 = 81 1 = 80 , which is divisible by 8.
f(k ) = 32k +2 + 8k 9 is divisible by 8 for k Z+.
f(k + 1) = 32(k+1)+2 + 8(k + 1) 9

= 32k+2+2 + 8(k + 1) 9
= 32k+2 .(32 ) + 8k + 8 9
= 9(32k +2 ) + 8k 1
f(k + 1) f(k ) = 9(32k +2 ) + 8k 1 32k +2 + 8k 9

= 9(32k+2 ) + 8k 1 32k +2 8k + 9
= 8(32k+2 ) + 8
= 832k +2 + 1

f(k + 1) = f(k ) + 832k +2 + 1

As both f(k ) and 832k +2 + 1 are divisible by 8 then the sum of these two terms must also be divisible by 8. Therefore f(n)

is divisible by 8 when n = k + 1.
Solutionbank FP1
Question:
Use the method of mathematical induction to prove that 26n + 32n2 is divisible by 5 for all n Z+.
Solution:
f(n) = 26n + 32n2, where n Z+.
f(1) = 26(1) + 32(1)2 = 26 + 30 = 64 + 1 = 65, which is divisible by 5.
f(k ) = 26k + 32k 2 is divisible by 5 for k Z+.
f(k + 1) = 26(k+1) + 32(k+1)2

= 26k+6 + 32k +22
= 26 26k + 32 32k 2
( ) ( )
= 64(26k ) + 9(32k2 )
f(k + 1) f(k ) = 64 26k + 9 32k2 26k + 32k 2

( ) ( )

= 64(26k ) + 9(32k 2 ) 26k 32k 2
= 63(26k ) + 8(32k 2 )
= 63(26k ) + 63(32k2 ) 55(32k 2 )
= 6326k + 32k 2 55(32k 2 )

f(k + 1) = f(k ) + 6326k + 32k 2 55 32k 2( )

(
= f(k ) + 63f(k) 55 3 2k2
)
= 64f(k ) 55(32k 2 )
f(k + 1) = 64f(k ) 55(32k 2 )
As both 64f (k) and 55 32k 2 are divisible by 5 then the sum of these two terms must also be divisible by 5. Therefore
( )
f(n ) is divisible by 5 when n = k + 1.
Solutionbank FP1
Exercise C, Question 1
Question:
Given that un+1 = 5un + 4, u1 = 4, prove by induction that un = 5n 1.
Solution:
n = 1; u1 = 51 1 = 4, as given.
n = 2; u2 = 52 1 = 24, from the general statement.
and u2 = 5u1 + 4 = 5(4) + 4 = 24, from the recurrence relation.
So u n is true when n = 1 and also true when n = 2.
Assume that for n = k that, uk = 5k 1 is true for k Z+.
Then uk +1 = 5uk + 4
(
= 5 5k 1 + 4 )
k +1
=5 5+4
k +1
=5 1
Therefore, the general statement, un = 5n 1 is true when n = k + 1.
If u n is true when n = k , then it has been shown that un = 5n 1 is also true when n = k + 1. As u n is true for n = 1 and n = 2,
then u n is true for all n 1 and n Z+ by mathematical induction.
file://C:\Users\Buba\kaz\ouba\fp1_6_c_1.html 3/18/2013
Solutionbank FP1
Question:
Given that un+1 = 2un + 5, u1 = 3, prove by induction that un = 2n+2 5.
Solution:
n = 1; u1 = 21+2 5 = 8 5 = 3, as given.
n = 2; u2 = 24 5 = 16 5 = 11, from the general statement.
Assume that for n = k that, uk = 2k +2 5 is true for k Z+.
Then uk+1 = 2uk + 5
( )
= 2 2k+2 5 + 5
= 2k +3 10 + 5
= 2k +1+2 5
Therefore, the general statement, un = 2n+2 5 is true when n = k + 1.
If u n is true when n = k , then it has been shown that un = 2n+2 5 is also true when n = k + 1. As u n is true for n = 1 and
n = 2, then u n is true for all n 1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
Given that un+1 = 5un 8, u1 = 3, prove by induction that un = 5n1 + 2.
Solution:
n = 1; u1 = 511 + 2 = 1 + 2 = 3, as given.
n = 2; u2 = 521 + 2 = 5 + 2 = 7, from the general statement.
and u2 = 5u1 8 = 5(3) 8 = 7, from the recurrence relation.
Assume that for n = k that, uk = 5k 1 + 2 is true for k Z+.
Then uk +1 = 5uk 8
= 5 5k 1 + 2 8
( )
= 5k 1+1 + 10 8
= 5k + 2
= 5k +11 + 2
Therefore, the general statement, un = 5n1 + 2 is true when n = k + 1.
If u n is true when n = k, then it has been shown that un = 5n1 + 2 is also true when n = k + 1. As u n is true for n = 1 and
n = 2, then u n is true for all n 1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
3n 1
Given that un+1 = 3un + 1, u1 = 1, prove by induction that un = .
2
Solution:
31 1 2
n = 1; u1 = = = 1, as given.
2 2
32 1 8
n = 2; u2 = = = 4, from the general statement.
2 2
3k 1
Assume that for n = k that, uk = is true for k Z+.
2
Then uk+1 = 3uk + 1

3k 1
= 3 +1
2
3(3k ) 3 2
= + 2
2
3k +1 3 + 2
=
2
3k +1 1
=
2
3n 1
Therefore, the general statement, un = is true when n = k + 1.
2
3n 1
If u n is true when n = k, then it has been shown that un = is also true when n = k + 1. As u n is true for n = 1 and n = 2,
2
+
then u n is true for all n 1 and n Z by mathematical induction.
Solutionbank FP1
Question:
Given that un+2 = 5un+1 6un, u1 = 1, u2 = 5 prove by induction that un = 3n 2n.
Solution:
n = 1; u1 = 31 21 = 3 2 = 1, as given.
n = 2; u2 = 32 22 = 9 4 = 5, as given.
n = 3; u3 = 33 23 = 27 8 = 19, from the general statement.
and u3 = 5u2 6u1 = 5(5) 6(1)
= 25 6 = 19, from the recurrence relation.
So u n is true when n = 1, n = 2 and also true when n = 3.
Assume that for n = k and n = k + 1,
both uk = 3k 2k and uk +1 = 3k +1 2k +1 are true for k Z+.
Then uk +2 = 5uk+1 6uk

= 5 3k +1 2k +1 6 3k 2k
( ) ( )
= 5(3k +1) 5(2k+1) 6(3k ) + 6(2k )
= 5(3k +1) 5(2k+1) 2(31)(3k ) + 3(21)(2k )
= 5(3k +1) 5(2k+1) 2(3k+1) + 3(2k +1)
= 3(3k +1) 2(2k+1)
= (31)(3k +1) (21)(2k +1)
= 3k +2 2k+2
Therefore, the general statement, un = 3n 2n is true when n = k + 2.
If u n is true when n = k and n = k + 1 then it has been shown that un = 3n 2n is also true when n = k + 2. As u n is true for
n = 1, n = 2 and n = 3, then u n is true for all n 1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
Given that un+2 = 6un+1 9un, u1 = 1, u2 = 0, prove by induction that un = (n 2)3n1.
Solution:
n = 1; u1 = (1 2)311 = (1)(1) = 1, as given.
n = 2; u2 = (2 2)321 = (0)(3) = 0, as given.
n = 3; u3 = (3 2)331 = (1)(9) = 9, from the general statement.
and u3 = 6u2 9u1 = 6(0) 9(1)

both uk = (k 2)3k 1
and uk +1 = (k + 1 2)3k +11 = (k 1)3k are true for k Z+.
Then uk+2 = 6uk+1 9uk
( ) (
= 6 (k 1)3k 9 (k 2)3k1 )
= 6(k 1)(3k ) 3(k 2).3(3k 1)
= 6(k 1)(3k ) 3(k 2)(3k1+1)
= 6(k 1)(3k ) 3(k 2)(3k )
= (3k )[6(k 1) 3(k 2)]
= (3k )[6k 6 3k + 6]
= 3k (3k )
= k (3k +1)
= (k + 2 2)(3k +21)
Therefore, the general statement, un = (n 2)3n1 is true when n = k + 2.
If u n is true when n = k and n = k + 1 then it has been shown that un = (n 2)3n1 is also true when n = k + 2. As u n is true
for n = 1, n = 2 and n = 3, then u n is true for all n1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
Given that un+2 = 7un+1 10un, u1 = 1, u2 = 8, prove by induction that un = 2(5n1) 2n1.
Solution:
n = 1; u1 = 2(50 ) (20) = 2 1 = 1, as given.
n = 2; u2 = 2(51) (21) = 10 2 = 8, as given.
n = 3; u3 = 2(52 ) (22) = 50 4 = 46, from the general statement.
and u3 = 7u2 10u1 = 7(8) 10(1)

both uk = 2(5k 1) 2k 1
and uk+1 = 2(5k+11) 2k +11 = 2(5k ) 2k are true for k Z+.

= 7 2(5k ) 2k 10 2(5k 1) 2k1
( ) ( )
= 14(5k ) 7(2k ) 20(5k1) + 10(2k 1)
= 14(5k ) 7(2k ) 4(51)(5k1) + 5(21)(2k 1)
= 14(5k ) 7(2k ) 4(5k 1+1) + 5(2k1+1)
= 14(5k ) 7(2k ) 4(5k ) + 5(2k )
= 2(51)(5k ) (21)(2k )
= 2(5k +1) (2k+1)
= 2(5k +21) (2k+21)
Therefore, the general statement, un = 2(5n1) 2n1 is true when n = k + 2.
If u n is true when n = k and n = k + 1 then it has been shown that un = 2(5n1) 2n1 is also true when n = k + 2. As u n is true
for n = 1, n = 2 and n = 3, then u n is true for all n1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
Given that un+2 = 6un+1 9un, u1 = 3, u2 = 36, prove by induction that un = (3n 2)3n.
Solution:
n = 1; u1 = (3(1) 2)(31) = (1)(3) = 3, as given.
n = 2; u2 = (3(2) 2)(32 ) = (4)(9) = 36, as given.
n = 3; u3 = (3(3) 2)(33) = (7)(27) = 189, from the general statement.
and u3 = 6u2 9u1 = 6(36) 9(3)

both uk = (3k 2)(3k )
and uk+1 = (3(k + 1) 2)(3k +1) = (3k + 1)(3k +1) are true for k Z+.

= 6 (3k + 1)(3k +1) 9 (3k 2)(3k )
( ) ( )
= 6(3k + 1)3 3( ) 9(3k 2)(3 )
1 k k
= 18(3k + 1)(3k ) 9(3k 2)(3k )
= 9(3k )[2(3k + 1) (3k 2)]
= 9(3k )[6k + 2 3k + 2]
= 9(3k )[3k + 4]
= 32 (3k )[3k + 4]
= (3k + 4)(3k+2 )
= (3(k + 2) 2)(3k +2 )
Therefore, the general statement, un = (3n 2)3n is true when n = k + 2.
If u n is true when n = k and n = k + 1 then it has been shown that un = (3n 2)3n is also true when n = k + 2. As u n is true for
n = 1, n = 2 and n = 3, then u n is true for all n1 and n Z+ by mathematical induction.
Solutionbank FP1
Exercise D, Question 1
Question:
Prove by the method of mathematical induction the following statement for n Z+.
n
(10 21) = (10 2n1 )
Solution:
1
( ) = (10 12)
n = 1; LHS = 1 2
0 1
1 2(1)
= (0 1 )
RHS = 1 2

0 1
As LHS = RHS, the matrix equation is true for n = 1.
Assume that the matrix equation is true for n = k.
k
(0 1 )
ie. 1 2 = 1 2k
0 1
With n = k + 1 the matrix equation becomes
k+1 k
( )
1 2
0 1 ( ) (10 21)
= 1 2
0 1
= 1 2k ( 1 2 )

0 1 0 1
= 1 + 0 2 + 2k .
0 + 0 0 + 1
1 2(k + 1)
=
0 1
Therefore the matrix equation is true when n = k + 1.
If the matrix equation is true for n = k, then it is shown to be true for n = k + 1. As the matrix equation is true for n = 1, it is
now also true for all n1 and n Z+ by mathematical induction.
file://C:\Users\Buba\kaz\ouba\fp1_6_d_1.html 3/18/2013
Solutionbank FP1
Question:
n
(13 41) = (2nn+ 1 2n4n+ 1)
Solution:
1
n = 1; LHS = 3 4 ( ) = (13 41)
1 1
2(1) + 1 4(1) 3 4
RHS =
1 2(1) + 1 = 1 1

( )
k
ie. 3 4
(1 1) = 2k + 1 4k .
k 2k + 1
k+1 k
(13 41) = 3 4
( ) (13 41)
1 1
= 2k + 1 4k ( 3 4 )

k 2k + 1 1 1
= 6k + 3 4k 8k 4 + 4k
3k 2k + 1 4k + 2k 1
= 2k + 3 4k 4
k + 1 2k 1
2(k + 1) + 1 4(k + 1)
=
(k + 1) 2(k + 1) + 1
If the matrix equation is true for n = k , then it is shown to be true for n = k + 1. As the matrix equation is true for n = 1, it is
Solutionbank FP1
Question:
n
n 0
(12 01) = n2
2 1 1
Solution:
1
( ) = (12 10)
n = 1; LHS = 2 0
1 1
0 = 2 0
1
(
1 1)
RHS = 2
1
2 1 1
k 0
k
(1 1)
ie. 2 0 = 2
k

2 1 1
k+1 k
(21 01) ( ) (12 10)
= 2 0
1 1
k
0 2 0
= 2 ( )
2 1 1 1 1
k
2(2k ) + 0 0 + 0
=
2(2k ) 2 + 1 0 + 1

21(2k ) 0
=
21(2k ) 1 1

+1
= 2
k
0
k +1

2 1 1
Solutionbank FP1
Question:
n
(52 83) = (4n2n+ 1 18n
4n )
Solution:
1
n = 1; LHS = 5 8( ) = (52 83)
2 3
4(1) + 1 8(1) 5 8
RHS =
2(1) 1 4(1) = 2 3

( )
k
ie. 5 8
(2 3) = 4k + 1 8k .
2k 1 4k
k+1 k
(52 83) = 5 8
( ) (52 83)
2 3
= 4k + 1 8k ( 5 8)

2k 1 4k 2 3
= 20k + 5 16k 32k 8 + 24k
10k + 2 8k 16k 3 + 12k
= 4k + 5 8k 8
2k + 2 4k 3
4(k + 1) + 1 8(k + 1)
=
2(k + 1) 1 4(k + 1)
Solutionbank FP1
Question:
n
2n 5(2n 1)
(02 15) =
0 1

Solution:
1
( ) = (02 15)
n = 1; LHS = 2 5
0 1
1 1
RHS = 2 5(2 1) = ( 2 5)
0 1 0 1
k k k
( 0 1)
ie. 2 5 = 2 5(2 1)
0 1
k +1 k
( )
2 5
0 1 ( ) (20 51)
= 2 5
0 1
k k
= 2 5(2 1) ( 2 5)
0 1 0 1
k k k
= 2(2 ) + 0 5(2 ) + 5(2 1)
0+0 0+1
1 k k k
= 2 (2 ) 5(2 ) + 5(2 ) 5
0 1
2k+1 5(21)(2k ) 5
=
0 1
2k+1 5(2k +1) 5
=
0 1
+1

= 2
k+1
5(2k
1)

0 1
Solutionbank FP1
Exercise E, Question 1
Question:
Prove by induction that 9 n 1 is divisible by 8 for n Z+.
Solution:
Let f(n) = 9 n 1, where n Z+.
f(k ) = 9 k 1 is divisible by 8 for k Z+.
f(k + 1) = 9k+1 1
= 9k .91 1
= 9(9k ) 1
f(k + 1) f(k) = [9(9k ) 1] [9k 1]

= 9(9k ) 1 9k + 1
= 8(9k )
f(k + 1) = f(k ) + 8(9 k )
divisible by 8 when n = 1, f(n) is also divisible by 8 for all n1 and n Z+ by mathematical induction.
file://C:\Users\Buba\kaz\ouba\fp1_6_e_1.html 3/18/2013
Solutionbank FP1
Question:
The matrix B is given by B = 1 0 . (0 3)

a Find B 2 and B 3.
b Hence write down a general statement for Bn, for n Z+.
c Prove, by induction that your answer to part b is correct.
Solution:
B2 = BB = 1
0 ( 03)(10 03) = (10 ++ 00 00 ++ 09) = (10 09)
B =B B = 1
3 2
0 ( 09)(10 03) = (10 ++ 00 00++270 ) = (10 270 )
1 0 3 1 0 n 1 0
b As B2 = 2 and B = 3, we suggest that B = 0 3n .
0 3 0 3
1
n = 1; LHS = 1
0 ( 03) = (10 03)
1 0
= ( 0 3)
RHS = 1 0
1
0 3
k
1 0
( 0 3)
ie. 1 0 = k
0 3
k +1 k
(10 03) ( ) (10 03)
= 1 0
0 3
1 0 1 0
= (k )
0 3 0 3
1 + 0 0+0
=
0 + 0 0 + 3(3k )
1 0
= k +1
0 3
If the matrix equation is true for n = k , then it is shown to be true for n = k + 1. As the matrix equation is true for n = 1, it is
Solutionbank FP1
Question:
n
Prove by induction that for n Z+, that
1
(3r + 4) = 2
n(3n + 11).
r=1
Solution:
1
n = 1; LHS = (3r + 4) = 7
r=1
1 1
RHS = (1)(14) = (14) = 7
2 2
k
1
ie. (3r + 4) = 2
k(3k + 11).
r=1
k +1
(3r + 4) = 7 + 10 + 13+ +(3k + 4) + (3(k + 1) + 4)
r=1
1
= k(3k + 11) + (3(k + 1) + 4)
2
1
= k(3k + 11) + (3k + 7)
2
1
= [k(3k + 11) + 2(3k + 7)]
2
1
= [3k 2 + 11k + 6k + 14]
2
1
= [3k 2 + 17k + 14]
2
1
= (k + 1)(3k + 14)
2
1
= (k + 1)[3(k + 1) + 11]
2
Solutionbank FP1
Question:
A sequence u1, u2, u3, u4 , is defined by un+1 = 5un 3(2n), u1 = 7.
a Find the first four terms of the sequence.
b Prove, by induction for n Z+, that un = 5n + 2n.
Solution:
a un + 1 = 5un 3(2n)
Given, u1 = 7.
u2 = 5u1 3(21) = 5(7) 6 = 35 6 = 29
u3 = 5u2 3(22) = 5(29) 3(4) = 145 12 = 133
u4 = 5u3 3(23) = 5(133) 3(8) = 665 24 = 641
The first four terms of the sequence are 7, 29, 133, 641.
n = 1; u1 = 51 + 21 = 5 + 2 = 7, as given.
n = 2; u2 = 52 + 22 = 25 + 4 = 29, from the general statement.
From the recurrence relation in part (a), u2 = 29.
Assume that for n = k , uk = 5k + 2k is true for k Z+.
Then uk+1 = 5uk 3(2k )

= 5(5k + 2k ) 3(2k )
= 5(5k ) + 5(2k ) 3(2k )
= 51(5k ) + 21(2k )
= 5k +1 + 2k+1
Therefore, the general statement, un = 5n + 2n is true when n = k + 1.
If u n is true when n = k , then it has been shown that un = 5n + 2n is also true when n = k + 1. As u n is true for n = 1 and n = 2,
then u n is true for all n 1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
The matrix A is given by A = (49 167).

a Prove by induction that An = 8n + 1 16n
( 4n +
) for n Z .
1 8n
The matrix B is given by B = (An)1
b Hence find B in terms of n.
Solution:
1
n = 1; LHS =(49 167) = (49 167)
8(1) + 1 16(1)
= ( 4 7 )
RHS = 9 16
4(1) 1 8(1)
k
ie. (49 167) = 8k + 1 16k .
4k 1 8k
k+1 k
(49 167) = (49 167) (49 167)
= 8k + 1 16k ( 9 16 )

4k 1 8k 4 7
= 72k + 9 64k 128k + 16 112k
36k 4 + 32k 64k 7 + 56k
= 8k + 9 16k + 16
4k 4 8k 7
8(k + 1) + 1 16(k + 1)
=
4(k + 1) 1 8(k + 1)
now also true for all n 1 and n Z+ by mathematical induction.
det(An) = (8n + 1)(1 8n) 64n 2

= 8n 64n 2 + 1 8n + 64n 2
=1
1 1 8n 16n
B = (An)1 = ( )
1 4n 8n + 1
So B = 1 8n 16n
( )
4n 8n + 1
Solutionbank FP1
Question:
The function f is defined by f(n) = 52n1 + 1, where n Z+.
a Show that f(n + 1) f(n) = (52n 1), where is an integer to be determined.
b Hence prove by induction that f(n) is divisible by 6.
Solution:
f(n + 1) = 52(n+1)1 + 1
= 52n+21 + 1
= 52n1.52 + 1
= 25(52n1) + 1
f(n + 1) f(n) = 25(52n1) + 1 [52n1 + 1]

= 25(52n1) + 1 (52n1) 1
= 24(52n1)
Therefore, = 24.
b f(n ) = 52n1 + 1, where n Z+.
f(1) = 52(1)1 + 1 = 51 + 1 = 6, which is divisible by 6.
f(k ) = 52k 1 + 1 is divisible by 6 for k Z+.
Using (a), f(k + 1) f(k ) = 24(52k 1)
f(k + 1) = f(k ) + 24(52k 1)
As both f(k) and 24(52k1) are divisible by 6 then the sum of these two terms must also be divisible by 6. Therefore f(n) is
Solutionbank FP1
Question:
Use the method of mathematical induction to prove that 7n + 4n + 1 is divisible by 6 for all n Z+.
Solution:
Let f(n) = 7n + 4n + 1, where n Z+.
f(1) = 71 + 41 + 1 = 7 + 4 + 1 = 12, which is divisible by 6.
f(k ) = 7k + 4k + 1 is divisible by 6 for k Z+.
f(k + 1) = 7k +1 + 4k +1 + 1
= 7k .71 + 4k .41 + 1
= 7(7k ) + 4(4k ) + 1
f(k + 1) f(k ) = [7(7k ) + 4(4k ) + 1] [7k + 4k + 1]

= 7(7k ) + 4(4k ) + 1 7k 4k 1
= 6(7k ) + 3(4k )
= 6(7k ) + 3(4k 1).41
= 6(7k ) + 12(4k1)
= 6[7k + 2(4)k1]
f(k + 1) = f(k ) + 6[7k + 2(4)k 1]
As both f(k) and 6[7k + 2(4)k 1] are divisible by 6 then the sum of these two terms must also be divisible by 6.
Solutionbank FP1
Question:
3un 1
A sequence u1, u2, u3, u4 , is defined by un+1 = , u1 = 2.
4
a Find the first five terms of the sequence.
n
b Prove, by induction for n Z+, that un = 4 ()3
1.
4
Solution:
3un 1
a un + 1 = .
4
Given, u1 = 2
3u1 1 3(2) 1 5
u2 = = =
4 4 4
3u 1
u3 = 2 =
3 ( )1 =
5
4
11
4
=
11
4 4 4 16
3u 1
u4 = 3 =
3 ( )1 =
11
16
17
16
=
17
4 4 4 64
3u 1
u5 = 4 =
3 ( )1 =
17
64
13
64
=
13
4 4 4 256
5 11 17 13
The first five terms of the sequence are 2, , , , .
4 16 64 256
b
1
n = 1; u1 = 4 ( ) 1 = 3 1 = 2, as given.
3
4
2
n = 2; u2 = 4 ( ) 1=
3
4
9
4
5
1 = , from
4
the general statement.
5
From the recurrence relation in part (a), u2 = .
4
k
() 1 is true for k Z+.
3
Assume that for n = k, uk = 4
4
3uk 1
Then uk +1 =
4
3 k
3 4
4
() 1 1

=
4
3 3 1
k
= 4 ()
4 4

1
4
1 k
= 4( ) ( )
3 3 3 1

4 4 4 4
k+1
= 4( )
3
1
4
n
Therefore, the general statement, un = 4 ()
3
4
1 is true when n = k + 1.
n
If u n is true when n = k, then it has been shown that un = 4
+
()3
4
1 is also true when n = k + 1. As u n is true for n = 1 and
n = 2, then u n is true for all n 1 and n Z by mathematical induction.
Solutionbank FP1
Question:
A sequence u1, u2, u3, u4 , is defined by un = 32n + 72n1.
a Show that un+1 9un = (72k 1), where is an integer to be determined.
b Hence prove by induction that u n is divisible by 8 for all positive integers n.
Solution:
un+1 = 32(n+1) + 72(n+1)1

= 32n (32 ) + 72n+21
= 32n (32 ) + 72n1(72)
= 9(32n ) + 49(72n1)
un+1 9un = [9(32n ) + 49(72n1)] 9[32n + 72n1]

= 9(32n ) + 49(72n1) 9(32n ) 9(72n1)
= 40(72n1)
Therefore, = 40.
b un = 32n + 72n1, where n Z+.
u1 = 32(1) 72(1)1 = 32 + 71 = 16, which is divisible by 8.
u n is divisible by 8 when n = 1.
uk = 32k + 72k 1 is divisible by 8 for k Z+.
Using (a), uk +1 9uk = 40(72k 1)
uk +1 = 9uk + 40(72k 1)
As both 9uk and 40(72k 1) are divisible by 8 then the sum of these two terms must also be divisible by 8. Therefore u n is
If u n is divisible by 8 when n = k, then it has been shown that u n is also divisible by 8 when n = k + 1. As u n is divisible by
8 when n = 1, u n is also divisible by 8 for all n 1 and n Z+ by mathematical induction.
Solutionbank FP1
Question:
Prove by induction, for all positive integers n, that
1
(1 5) + (2 6) + (3 7)+ +n(n + 4) = n(n + 1)(2n + 13).
6
Solution:
1
The identity (1 5) + (2 6) + (3 7)+ +n(n + 4) = n(n + 1)(2n + 13).
6
n
1
can be rewritten as r(r + 4) = 6
n(n + 1)(2n + 13).
r=1
1
n = 1; LHS = r(r + 4) = 1(5) = 5
r=1
1 1
RHS = (1)(2)(15) = (30) = 5
6 6
k
1
ie. r(r + 4) = 6
k(k + 1)(2k + 13).
r=1
k +1
r(r + 4) = 1(5) + 2(6) + 3(7)+ +k(k + 4) + (k + 1)(k + 5)
r=1
1
= k(k + 1)(2k + 13) + (k + 1)(k + 5)
6
1
= (k + 1)[k(2k + 13) + 6(k + 5)]
6
1
= (k + 1)[2k 2 + 13k + 6k + 30]
6
1
= (k + 1)[2k 2 + 19k + 30]
6
1
= (k + 1)(k + 2)(2k + 15)
6
1
= (k + 1)(k + 1 + 1)[2(k + 1) + 13]
6
If the summation formula is true for n = k , then it is shown to be true for n = k + 1. As the result is true for n = 1, it is now

FP1 Chapter 6

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

FP1 Chapter 6

Caricato da

Copyright:

Formati disponibili

Heinemann Solutionbank: Further Pure FP1 Page 1 of 1

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k.

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k.

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k.

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k .

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k.

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k .

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k.

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k.

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k.

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

As LHS = RHS, the summation formula is true for n = 1.

Assume that the summation formula is true for n = k .

With n = k + 1 terms the summation formula becomes:

Therefore, summation formula is true when n = k + 1.

Pearson Education Ltd 2008

Let f(n) = 8n 1, where n Z+.

f(1) = 81 1 = 7, which is divisible by 7.

f(n) is divisible by 7 when n = 1.

Assume that for n = k ,

f(k ) = 8k 1 is divisible by 7 for k Z+.

f(k + 1) f(k) = [8(8k ) 1] [8k 1]

f(k + 1) = f(k ) + 7(8k )

Pearson Education Ltd 2008

Let f(n) = 32n 1, where n Z+.

f(1) = 32(1) 1 = 9 1 = 8, which is divisible by 8.

f(n) is divisible by 8 when n = 1.

Assume that for n = k ,

f(k ) = 32k 1 is divisible by 8 for k Z+.