Ch.6 Proof by Mathematical Induction

Edexcel Maths FP1
Topic Questions from Papers
Proof by Induction
physicsandmathstutor.com
January 2009
Leave
blank
4.
Prove by induction that, for n Z + ,

n
r =1
1
n
=
r (r + 1)
n +1
(5)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
8
*N34694A0828*
January 2009
Leave
blank
6.
A series of positive integers u1, u2, u3, ... is defined by

u1 = 6 and un+1 = 6un 5, for n . 1.
Prove by induction that un = 5 6 n 1 + 1, for n . 1.
(5)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
12
*N34694A01228*
June 2009
Leave
blank
8.
Prove by induction that, for n ]+ ,

(a) f(n) = 5n + 8n + 3 is divisible by 4,
(7)
n
3 2 2n + 1 2n
(b)
=
1 2n
2 1 2n
(7)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
22
*M35146A02224*
January 2010
Leave
blank
3.
A sequence of numbers is defined by
u1 = 2,
un +1 = 5un 4,
n 1.
Prove by induction that, for n Z +, un = 5n1 + 1.
(4)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
*N35143A0624*
January 2010
Leave
blank
8.
(a) Prove by induction that, for any positive integer n,

n
r =1
1 2
n (n + 1) 2
4
(5)
(b) Using the formulae for
r and
r =1
(r
25
(r
r , show that
3
r =1
+ 3r + 2) =
r =1
(c) Hence evaluate
1
n(n + 2)(n 2 + 7)
4
(5)
+ 3r + 2)
r =15
(2)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
18
*N35143A01824*
7.
June 2010
Leave
blank
f ( n) = 2 n + 6 n
(a) Show that f (k + 1) = 6f (k ) 4(2 k ).
(3)
(b) Hence, or otherwise, prove by induction that, for n ' + , f (n) is divisible by 8.
(4)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
18
*N35387A01828*
June 2010
Leave
blank
9.
(a) Prove by induction that

n
r
r =1
1
= n(n + 1)(2n + 1)
6
(6)
r =1
r =1
2
Using the standard results for r and r ,
(b) show that

n
(r + 2)(r + 3) = 3 n(n
+ an + b),
r =1
where a and b are integers to be found.

(5)
(c) Hence show that
2n
(r + 2)(r + 3) = 3 n(7n
+ 27 n + 26)
r = n +1
(3)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
24
*N35387A02428*
9.
January 2011
Leave
blank
A sequence of numbers u1 , u2 , u3 , u4 , ... is defined by

un+1 = 4un + 2 , u1 = 2
Prove by induction that, for n + ,
un =
2 n
4 1
3
(5)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
26
*N35406A02632*
9.
June 2011
Leave
blank
Prove by induction, that for n ' + ,

3 0
(a)
6 1
3n
0
= n
,
3(3 1) 1
(6)
(b) f (n) = 7 2 n 1 + 5 is divisible by 12.
(6)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
28
*P38168A02832*
January 2012
Leave
blank
6.
(a) Prove by induction

n
r =1
1
= n 2 (n + 1) 2
4
(5)
(b) Using the result in part (a), show that

n
(r
2) =
r =1
1
n(n3 + 2n 2 + n 8)
4
50
(c) Calculate the exact value of
(r
(3)
2) .
r = 20
(3)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
14
*P40086A01424*
January 2012
Leave
blank
7.
A sequence can be described by the recurrence formula

un +1 = 2un + 1,
n . 1, u1 = 1
(a) Find u2 and u3 .

(2)
(b) Prove by induction that un = 2n 1
(5)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
18
*P40086A01824*
June 2012
Leave
blank
10. Prove by induction that, for n + ,

f ( n ) = 22n 1 + 32n 1 is divisible by 5.
(6)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
30
*P40688A03032*
January 2013
Leave
blank
8.
(a) Prove by induction that, for n ' + ,

n
r (r + 3) =
1
3
n(n + 1)(n + 5)
r =1
(6)
(b) A sequence of positive integers is defined by

u1 = 1,
un +1 = un + n(3n + 1),
n '+
Prove by induction that

un = n 2 (n 1) + 1 ,
n '+
(5)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
22
*P41485A02228*
June 2013
Leave
blank
9.
(a) A sequence of numbers is defined by

u1 = 8
un + 1 = 4un 9n,
n .1
Prove by induction that, for n '+,

un = 4n + 3n +1
(5)
(b) Prove by induction that, for m '+,

3 4
1 1
2m + 1 4m
=
1 2m
m
(5)
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________
28
*P43138A02832*
June 2013 R
/HDYH
EODQN

D 3URYH E\ LQGXFWLRQ WKDW IRU Q '

E +HQFH VKRZ WKDW

ZKHUH D E DQG F DUH LQWHJHUV WR EH IRXQG

BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB

$
Further Pure Mathematics FP1

Candidates sitting FP1 may also require those formulae listed under Core Mathematics C1
and C2.
Summations
n
= 16 n(n + 1)(2n + 1)
= 14 n 2 (n + 1) 2
r =1
r
r =1
Numerical solution of equations
The Newton-Raphson iteration for solving f( x) = 0 : x n +1 = x n
f( x n )
f ( x n )
Conics
Parabola
Rectangular
Hyperbola
Standard
Form
y 2 = 4ax
xy = c2
Parametric
Form
(at2, 2at)
ct,
t
Foci
(a, 0)
Not required
Directrices
x = a
Not required
Matrix transformations
cos
Anticlockwise rotation through about O:
sin
cos 2
Reflection in the line y = (tan ) x :
sin 2
sin
cos
sin 2
cos 2
In FP1, will be a multiple of 45.
Edexcel AS/A level Mathematics Formulae List: Further Pure Mathematics FP1 Issue 1 September 2009
Core Mathematics C1
Mensuration
Surface area of sphere = 4 r 2
Area of curved surface of cone = r slant height
Arithmetic series
un = a + (n 1)d
Sn =
1
1
n(a + l) = n[2a + (n 1)d]
2
2
Edexcel AS/A level Mathematics Formulae List: Core Mathematics C1 Issue 1 September 2009
Core Mathematics C2
Candidates sitting C2 may also require those formulae listed under Core Mathematics C1.
Cosine rule
a2 = b2 + c2 2bc cos A
Binomial series
n
n
n
(a + b) n = a n + a n 1b + a n 2 b 2 + K + a n r b r + K + b n
1
2
r
(n )
n
n!
where = n C r =
r! (n r )!
r
n(n 1) 2
n(n 1) K (n r + 1) r
(1 + x) n = 1 + nx +
x +K+
x + K ( x < 1, n )
1 2 K r
1 2
Logarithms and exponentials
log a x =
log b x
log b a
Geometric series
un = arn 1
Sn =
a (1 r n )
1 r
S =
a
for r < 1
1 r
Numerical integration
b
The trapezium rule: y dx

a
1
2
h{(y0 + yn) + 2(y1 + y2 + ... + yn 1)}, where h =
Edexcel AS/A level Mathematics Formulae List: Core Mathematics C2 Issue 1 September 2009
ba
n

Ch.6 Proof by Mathematical Induction

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ch.6 Proof by Mathematical Induction

Uploaded by

Copyright:

Available Formats

Edexcel Maths FP1

Topic Questions from Papers

Prove by induction that, for n Z + ,

A series of positive integers u1, u2, u3, ... is defined by

Prove by induction that, for n ]+ ,

A sequence of numbers is defined by

Prove by induction that, for n Z +, un = 5n1 + 1.

(a) Prove by induction that, for any positive integer n,

(b) Using the formulae for

(c) Hence evaluate

(a) Prove by induction that

(b) show that

where a and b are integers to be found.

A sequence of numbers u1 , u2 , u3 , u4 , ... is defined by

Prove by induction, that for n ' + ,

(a) Prove by induction

(b) Using the result in part (a), show that

(c) Calculate the exact value of

A sequence can be described by the recurrence formula

(a) Find u2 and u3 .

10. Prove by induction that, for n + ,

(a) Prove by induction that, for n ' + ,

(b) A sequence of positive integers is defined by

Prove by induction that

(a) A sequence of numbers is defined by

Prove by induction that, for n '+,

(b) Prove by induction that, for m '+,

D 3URYH E\ LQGXFWLRQ WKDW IRU Q '

ZKHUH D E DQG F DUH LQWHJHUV WR EH IRXQG

Further Pure Mathematics FP1

Numerical solution of equations

The Newton-Raphson iteration for solving f( x) = 0 : x n +1 = x n

In FP1, will be a multiple of 45.

The trapezium rule: y dx

h{(y0 + yn) + 2(y1 + y2 + ... + yn 1)}, where h =

You might also like

D 3URYH E\ LQGXFWLRQ WKDW IRU Q '

ZKHUH D E DQG F DUH LQWHJHUV WR EH IRXQG