Scribd
Upload
18 views4 pages

Assignment 7

The document contains examples of recursive sequences defined by recursive formulas and their solutions. It also includes examples of matrix operations like multiplication, inverse and identity matrices.

Uploaded by

doduckien100hp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views4 pages

Assignment 7

The document contains examples of recursive sequences defined by recursive formulas and their solutions. It also includes examples of matrix operations like multiplication, inverse and identity matrices.

Uploaded by

doduckien100hp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1

a)

an = -an – 1, a0 = 5

an = (-1)an – 1

a1 = (-1)a0 = (-1).5

a2 = (-1)a1 = (-1).(-1).5

a3 = (-1)a2 = (-1).(-1).(-1).5

=> an = (-1)n.5

b)

an = an – 1 + 3, a0 = 1

a1 = a0 + 3 = 1 + 3

a2 = a1 + 3 = 1 + 3 + 3

a3 = a2 + 3 = 1 + 3 + 3 + 3

=> an = 1 + 3n

c)

an = 2nan – 1, a0 = 3

a1 = 2.1.a0 = 2.1.3

a2 = 2.2.a1 = 2.2.2.1.3

a3 = 2.3.a2 = 2.3.2.2.2.1.3

=> an = 1 +3n

a)

a0 = 1000

r = 0.9% = 0.09

=> an = an - 1 + 0.09an – 1 = 1.09an – 1

b)

an = 1.09an – 1 , a0 = 1000

a1 = 1.09a0 = (1.09).1000
a2 = 1.09a1 = (1.09).(1.09).1000

a3 = 1.09a2 = (1.09). (1.09).(1.09).1000

=> an = (1.09)n.1000

c)

n = 100

=> a100 = (1.09)100.1000

a) 3, 6, 11, 18, 27, 38, 51, 66, 83, 102

an = an - 1 + 2n + 1

=> a10 = a9 + 2.10 + 1 = 102 + 21 = 123

a11 = a10 + 2.11 + 1 = 123 + 23 = 146

a12 = a11 + 2.12 + 1 = 146 + 25 = 171

b) 7, 11, 15, 19, 23, 27, 31, 35, 39, 43

an = an - 1 + 4

=> a10 = a9 + 4 = 43 + 4 = 47

a11 = a10 + 4 = 47 + 4 = 51

a12 = a11 + 4 = 51 + 4 = 55

c) 1, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011

This is binary sequence in increase order, so:

a12 = 1100

a13 = 1101

a14 = 1110

d) 0, 2, 8, 26, 80, 242, 728, 2186, 6560, 19682

an = 3n-1 - 1
=> a10 = 39 - 1

a11 = 310 - 1

a12 = 311 - 1

e) 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1

For 1, 0, 0, 1 we can see 1, 0 are repeated but switched together

Next we have 1, 1, 0, 0, 0, 0, 1, 1; (1, 1) and (0, 0) are repeated but switched together

So for next 1, 1, 1 we will have the 3 next numbers are 0, 0, 0

f) 2, 4, 16, 256, 65536, 4294967296

an = (an-1)²

=> a6 = (a5)² = 42949672962

a7 = (a6)² = (42949672962)2

a8 = (a7)² = ((42949672962)2)2

a) 10

b) 9330

c) 21215

d) 511

a) 3

b) 78

c) 9

d) 180
6
200 2 2
200 (200+99)
∑ k3 =
4
k=99

[ ][ ][ ]
1 0 4 −1 3 5 0 3 9
−1 2 2 + 2 2 −3 = 1 0 −1
0 −2 −3 1 −3 0 1 −5 −3

a)

[ ][ ][ ]
1 0 2 0 1 −1 −1 1 0
0 −1 −1 x 1 −1 0 = 0 1 −1
−1 1 0 −1 0 1 1 −2 1

b)

[ ][ ][ ]
1 −3 0 1 −1 2 3 4 −1 −7 6
1 2 2 x =
−1 0 3 −1 −7 −5 8 5
2 1 −1 −1 −1 0 2 4 0 7 3

[ ][ ][ ]
2 3 −1 7 −8 5 1 0 0
1 2 1 x −4 5 −3 = 0 1 0
−1 −1 3 1 −1 1 0 0 1

[ ] [ ] [ ]
1 0 0 7 −8 5 2 3 −1
0 1 0 is the identity matrix so −4 5 −3 is the inverse of 1 2 1
0 0 1 1 −1 1 −1 −1 3

You might also like