# Welcome back

## Find a book, put up your feet, stay awhile

Sign in with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more

Download

Standard view

Full view

of .

Look up keyword

Like this

Share on social networks

3Activity

×

0 of .

Results for: No results containing your search query

P. 1

InductionRatings: (0)|Views: 60|Likes: 2

Published by abhijeetaggarwal

See more

See less

https://www.scribd.com/doc/3178980/Induction

03/22/2013

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 xdxd

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

Q

=

,0111

use the principle of mathematical inductionto prove that

Q 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

M

is defined as

M

=

011 – 2

.(a)Find

M

2,

M

3and

M

4.(3)(b)(i)State a conjecture for

M n

, i.e. express

M 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)Consider

z

5– 32 = 0.(i)Show that

z

1= 2

+

52πsini52πcos

is one of the complex roots of this equation.(ii)Find

z

12,

z

13,

z

14,

z

15, giving your answer in the modulus argumentform.(iii)Plot the points that represent

z

1,

z

12,

z

13,

z

14and

z

15, in the complexplane.(9)(Total 16 marks)9.S5-P1

2

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

© Copyright 2015 Scribd Inc.

Language

Choose the language in which you want to experience Scribd:

Sign in with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

Password Reset Email Sent

Join with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

By joining, you agree to our

read free for two weeks

Unlimited access to more than

one million books

one million books

Personalized recommendations

based on books you love

based on books you love

Syncing across all your devices

Join with Facebook

or Join with emailSorry, we are unable to log you in via Facebook at this time. Please try again later.

Already a member? Sign in.

By joining, you agree to our

to download

Unlimited access to more than

one million books

one million books

Personalized recommendations

based on books you love

based on books you love

Syncing across all your devices

Continue with Facebook

Sign inJoin with emailSorry, we are unable to log you in via Facebook at this time. Please try again later.

By joining, you agree to our

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd