Question 2:

a. 20
th
term =
Step 1: find common difference which is 3
Step 2: A
20
= 8 + (20 1) 3
Step 3: A
20
= 8 + (19)3
A
20
= 8 + 57
A
20
= 65

i. Sum of the 25
th
term
Step 1: S
25
= 25/2 [(2 x 8) + 25 1)3]
Step 2: S
25
= 12.5 (16 + 25 1)3
S
25
= 12.5(40 x 3)
S
25
= 12.5 x 120
S
25
= 1500






b.
equ 1
36 = 4 + (n 1) d
36 4 = (n 1) d
32 = (n 1) d

equ 2
363 = n/2 (2 x 4) + 32
363 = n/2 (8 + 32)
363 = n/2 (40)
20n = 363
n = 363/20
n = 18.15
Find the common difference
36 = 4 + (18.75 1) d
36 4 = (17.15) d
32 = 17.15 d
d = 32/17.15





Question 3.
a. First term
Since S
10
= 93
Then S
1
equal to 93 = a [(2
10
- 1) / (2 1)]
93 = a (1024 1) / (2-1)
1023a = 93
a = 93/1023
First term a = 0.0909

c. Since the 3
rd
term is 75 and the 4
th
term 375 common ratio can be found by : 375/75 = 5
Therefore common ratio is 5.
i. Since it is known that the common ratio is 5 first term can be found by:
5
2
a

= 75
25 a = 75
a = 75/25
a = 3
First term = 3






Question 4:
First set input size to n, so that on doubling it becomes 2n and on increasing it by
1 it becomes n+1.
i. n
2

Initially, the running time is n
2
. By doubling the input size, it becomes:
(2n)
2
= 4n
2

Therefore, it increases four times.
Increasing it by 1, it becomes:
(n +1)2 = n
2
+2
n
+1;
Therefore the running time increases by
2n + 1.

ii. n
3

Initially, the running time is n
3.
By doubling the input size it becomes:
(2n

)
3
= 8n
3

Therefore it increases 8 times
Increasing it by 1, it becomes:
(n + 1)
3
= n
3
+ 3n
2 +
3n + 1
Therefore the running time increases
3n
2
+ 3n + 1



iii. 100n
2

Initially, the running time is 100n
2
. By doubling input size, it becomes:
100(2n)
2
= 400n
2

Therefore it increases 4 times.
Increasing by 1, it becomes:
100(n + 1)
2
= 100(n
2
+ 2n + 1)
Therefore the running times increases by:
100(2n + 1)

Question 5.
a. Prove that 2 + 2
2
+ 2
3
+ + 2
n
= 2(2
n
1)
Base Case n = 1
2
n
= 2
n = 1
Substitute n for 1
2
1 =
2(2
1
1)
2 = 2
n = 1 Base Case proven to be true
Assume n = k
2 + 2
2
+ 2
3
+ + 2
k
= 2(2
k
1)
Prove that n = k + 1
2 + 2
2
+ 2
3
+ + 2
k
+

2
k +1
= 2(2
k+1
1)
Substitute the first part of sequence with 2(2
k
1) since it was assumed to be equivalent above
2(2
k
1) + 2
k +1
= 2(2
k+1
1)
2.2
k
2 + 2.2
k
= 2(2
k
.2 1)
2.2
k
2 + 2.2
k
= 4.2
k
2
2k(2+2) 2 = 4.2
k
2
2
k
.4 2 = 2
k
.4 2
n = k + 1Proven to be true
b. Prove using mathematical induction for all n 1
1 + 4 + 7 + + (3n 2) = n (3n-1)
Base Case n = 1
3n 2 = 1
3n = 3
n = 3/3
n = 1
Substitute n for 1
3 (1)- 2 = 1[3(1) 1)
3 2 = 1(3 -1)
2 = 2
n = 1 Base Case proven to be true

Assume n = k
1 + 4 + 7 + + (3k 2) = k (3k-1)/2
Prove that n = k + 1
1 + 4 + 7 + + (3k 2) + (3k+1) 2 = k+1[(3(k+1) 1)]
Substitute the first part of sequence k (3k-1)/2 since it was assumed to be equivalent above.
k (3k -1)/2 + (3k+1)-2 = k+1 [(3k+1) -1]/2
Common divisor
k(3k-1)/2 + 6k +6 - 4/2 = k+1 [3(k+1) -1 ]/2
(3k
2
k)/2 + (6k + 6 - 4)/2 = k + 1 (3k + 3 1] /2
(3k
2
+ 5k + 2)/2 = 3k
2 +
3k k + 3k + 3 -1
(3
k
+5k + 2)/2 = (3k
2 +
5k +2) /2
n = k + 1 Proven to be true