Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
Induction

Induction

Ratings:

4.0

(1)
|Views: 40 |Likes:
Published by abhijeetaggarwal

More info:

Categories:Types, School Work
Published by: abhijeetaggarwal on May 31, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

06/16/2009

pdf

text

original

 
Y2-HLWORKSHEET: MATHEMATICAL INDUCTION
1.M99-P1Using mathematical induction, prove that the number 22n– 3
n
– 1 isdivisible by 9, for 
n
= 1, 2, ..... .2.N99-P2a) Evaluate (1 + i)2, where i =
1
.(2)(b)Prove, by mathematical induction, that (1 + i)4
n
= (–4)
n
, where
n
*.(6)(c)Hence or otherwise, find (1 + i)32.(2)(Total 10 marks)3.M00-P2Prove by mathematical induction that
 x
dd
(
 x n
)
= nx n
 –1
,
for all positive integer valuesof 
n.
(Total 10 marks)4.M01-P2Using mathematical induction, prove that
,2cos)(cos
     +=
π  
n x xdx
nn
for all positiveinteger values of 
n
.(Total 7 marks)5.N01-P2Consider the sequence {
an
} = {1, 1, 2, 3, 5, 8, 13, ...} where
a
1=
a
2= 1 and
a
n+1=
a
n+
a
n–1for all integers
n
2.Given the matrix
=
,0111
      
use the principle of mathematical inductionto prove that
n
=
      
+
1 – 1
nnnn
aaaa
for all integers
n
2.(Total 7 marks)6.M02-P2(a)Prove using mathematical induction that
      =      
101 – 22 1012
nn
, for all positive integer values of 
n
.
1
 
Y2-HLWORKSHEET: MATHEMATICAL INDUCTION
(5)(b)Determine whether or not this result is true for 
n
= –1.(2)(Total 7 marks)7.N01-P2The matrix
is defined as
=
      
011 – 2
.(a)Find
2,
3and
4.(3)(b)(i)State a conjecture fo
n
, i.e. express
n
in terms of 
n
, where
n
 +.(ii)Prove this conjecture using mathematical induction.(7)(Total 10 marks)8.N03-P2a) Use mathematical induction to prove De Moivre’s theorem(cos + i sin)
n
= cos(
n
) + i sin(
n
),
n
 +.(7)(b)Conside
5– 32 = 0.(i)Show that
1= 2
           +     
5sini5cos
is one of the complex roots of this equation.(ii)Find
12,
13,
14,
15, giving your answer in the modulus argumentform.(iii)Plot the points that represent
1,
12,
13,
14and
15, in the complexplane.(9)(Total 16 marks)9.S5-P1
2

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->