PART ONE

SERIES AND SIGMA NOTATION

EXAMPLE 1.1
Rewrite each series as a sum.
5 4 9
2 2
1. ∑ 4m +4 3. ∑ 5 m +4 5. ∑ 20−a2
m=1 o =1 a=4

6 4

2.
∑ 50−m 4.
∑ 100−k
n =1 k=o

SOLUTIONS:
1. = [4(1)2+4] + [4(2)2 +4] + [4(3)2 + 4] + [4(4)2 + 4) + [4(5)2 + 4]
= 8 + 20 + 40 + 68 + 104
= 240

2. = (50 – 1) + (50 – 2) + (50 – 3) + (50 – 4) + (50 – 5) + (50 – 6)

= 49 + 48 + 47 + 46 + 45 + 44
= 279

3. = [5(1)2 +4] + [5(2)2 +4] + [5(3)2 +4] + [5(4)2 +4]

= 9 + 24 + 49 + 84
= 166

4. = (100 – 0) + (100 – 1) + (100 – 2) + (100 – 3) + (100 – 4)

= 100 + 99 + 98 + 97 + 96
= 490

5. = [20 – (4)2] + [20 – (5)2] + [20 – (6)2] + [20 – (7)2] + [20 – (8)2] + [20 – (9)2]
= 4 + (-5) + (-16) + (-29) + (-44) + (-61)
= -151

EXAMPLE 1.2
Rewrite each series using sigma notation.
1. 1 + 2 + 3 + 4 3. 1 + 10 + 100 + 1000 + 10, 000
5
4 ∑ 10 n
∑n n=0
n =1
2. 3 + 9 + 27 + 81 + 243 1 2 3 4 5
5 4. + + +1 +
2 3 4 5 6
∑ 3k 5
k
k =1
∑ k +1
k =1

EXERCISE 1.1
Rewrite each series as sum.
7 6

1. ∑ k +1
k 2. ∑ 3 a2−2
k =3 a =1

5 6 2

3. ∑ (30−k 2) 4. ∑ mm+1
k =1 m=1

6 5

5. ∑ n4 6. ∑ m(m+2)
n =1 m=0

EXERCISE 1.2
Express each of these sums using sigma notation
1 1 1 1 1
1. 1 + 4 + 9 + 16 + 25 + 36 3. 1+ + + + +
2 3 4 5 6

1 1 1 1 1 1
2. 3 – 5 + 7 – 9 + 11 – 13 + 15 4. + + + + +
2 5 8 11 14 17

PART TWO
 MATHEMATICAL INDUCTION

EXAMPLE 2.1
Prove the following statement is true for all any positive integers by using mathematical induction.
1. 1 + 3 + 5 + ... + (2n – 1) = n2
n(n+1)
2. 1 + 2 + 3 + ... + n =
2
3. n3 + 2n is divisible by 3.
4. n! > 2n, for n≥ 4.
n(n+1)( 4 n−1)
5. 1 x 2 + 3 x 4 + 5 x 6 + …. + (2n – 1) (2n) =
3
SOLUTION:
1. 1 + 3 + 5 + ... + (2n – 1) = n2
P1: 2(1) – 1 = (1)2
2–1=1
1= 1
Therefore, P1 is true.
Pk: 1 + 3 + 5 + … + (2k – 1) = k2
Assuming, Pk is true.
Pk+1: 1 + 3 + 5 + … + (2k – 1) + (2(k + 1) – 1) = (k + 1)2
= 1 + 3 + 5 + … + (2k – 1) + (2k +1)
= [1 + 3 + 5 + … + (2k – 1)] + (2k +1)
= k2 + (2k +1)
= (k + 1)2
Therefore, Pn is true for all positive integers.

n(n+1)
2. 1 + 2 + 3 + ... + n =
2
1(1+ 1)
P1: 1=
2
1=1
Therefore, P1 is true.

k (k+ 1)
Pk: 1 + 2 + 3 + ... + k =
2
Assuming, Pk is true.

Pk+1: 1 + 2 + 3 + ... + k + (k + 1) = (k + 1)¿ ¿

= [1 + 2 + 3 + ... + k] + (k + 1)
 k (k+ 1)
= + (k + 1)
2
k ( k +1 ) +2(k+ 1)
=
2
2
k +k +2 k + 2
=
2
2
k +3 k +2
=
2
= (k + 1)¿ ¿

Therefore, Pn is true for all positive integers.

3. n3 + 2n is divisible by 3.
P1: 13 + 2(1)
=1+2
P1: =3
Therefore, P1 is true.
Assuming Pk = 6,
P6: 63 + 2(6)
= 216 + 12

= 228  3
P6: = 76
Therefore, P6 is true.
Assuming Pk+1 wherein Pk = 3,
P3+1: (3 + 1)3 + 2(3 + 1)
= (4)3 + 2(4)
= 64 + 8

= 72  3
P3+1: = 24
Therefore, n3 + 2n is divisible by 3, for all positive integers.

4. n! > 2n, for n≥ 4.

P4: 4! ≥ 2(4)
24 ≥ 8
Therefore, P4 is true.
Assuming Pk = 6,
P7: 7! ≥ 2(7)

5040 ≥ 14
 Therefore, P7 is true.

Assuming Pk+1 wherein Pk = 9,

P9+1: (9 + 1)! ≥ 2(9)

10! ≥ 18

3,628,800 ≥ 18

Therefore, n! > 2n, for all positive integers greater than or equal to 4.

n(n+1)( 4 n−1)
5. 1 x 2 + 3 x 4 + 5 x 6 + …. + (2n – 1) x 2n =
3
1 ( 1+1 ) [4 (1)−1]
P1: [2(1) – 1] x 2(1) =
3
1 ( 2 ) (3)
(2 – 1) x 2 =
3
2=2
Therefore, P1 is true.

k (k+ 1)(4 k −1)

Pk: 1 x 2 + 3 x 4 + 5 x 6 + ... + (2k – 1) x 2k =
3
Assuming, Pk is true.

( k +1 ) [ ( k +1 ) +1 ) [4 (k +1)−1]
Pk+1: 1 x 2 + 3 x 4 + 5 x 6 + ... + (2k – 1) x 2k + [2(k + 1) – 1] x 2(k + 1) =
3
= [1 x 2 + 3 x 4 + 5 x 6 + ... + (2k – 1) x 2k] + [2(k + 1) – 1] x 2(k + 1)

k (k+ 1)(4 k −1)

= + [2(k + 1) – 1] x 2(k + 1)
3
k ( k +1 ) ( 4 k−1 ) +3 ( 2 k +1 ) (2)(k +1)
=
3
(k + 1)
= (4k2 – k + 12k + 6)
3
(k + 1)
= (4k2 + 11k + 6)
3
( k +1 ) (k + 2)( 4 k +3)
=
3
( k +1 ) [ ( k +1 ) +1 ] [4 ( k + 1 )−1]
=
3
Therefore, Pn is true for all positive integers.

EXERCISE 2.1
Prove the following statement is true for all any positive integers by using mathematical induction.
1. Pn: 11 + 19 + 17 + …+ 8n + 3 = n (4n + 7)
2. Pn: 8n – 5n is divisible by 3.
3. Pn: 6n > 4n
4. Pn: 10n + 2
4 n−1
5. Pn: 1 + 4 +42 + … + 4n-1 =
3

PART THREE
ARITHMETIC AND GEOMETRIC SEQUENCE

EXAMPLE 3.1
Find the common difference and give its recursive and explicit formula.
1. 7, 17, 27, 37, …
2. 20, 17, 14, 11, …
3. 15, 9, 3, -3, …
4. 3, -7, -17, 27, …
5. -42, -49, -56, -63, …
SOLUTION:
1. Common difference: d = 10
Explicit: an = 7 + (n – 1) (10)
Recursive: an = an-1 + 10

2. Common difference: d = -3
Explicit: an = 20 + (n – 1) (-3)
Recursive: an = an-1 – 3

3. Common difference: d = -6
Explicit: an = 15 + (n – 1) (-6)
Recursive: an = an-1 – 6

4. Common difference: d = -10

Explicit: an = 3 + (n – 1) (-10)
Recursive: an = an-1 – 10

5. Common difference: d = -7
Explicit: an = -42 + (n – 1) (-7)
Recursive: an = an-1 – 7

EXAMPLE 3.2
Find the common ratio and give its recursive and explicit formula.
 1. 1, -5, 25, -125, …
2. 3, -9, 27, -81, …
3. 4, 24, 144, 864, …
4. -3, -6, -12, -24, …
5. -4, 24, -144, 864, …
SOLUTION:
1. Common ratio: r = -5
Explicit: an = 1 (-5) n-1
Recursive: an = an-1 (-5)

2. Common ratio: r = -3
Explicit: an = 3 (-3) n-1
Recursive: an = an-1 (-3)
3. Common ratio: r=6
Explicit: an = 4 (6) n-1
Recursive: an = an-1 (6)

4. Common ratio: r = 2
Explicit: an = -3 (2) n-1
Recursive: an = an-1 (2)

5. Common ratio: r = -6
Explicit: an = -4 (-6) n-1
Recursive: an = an-1 (-6)

EXERCISE 3.1
Find the common difference and give its recursive and explicit formula.
1. -5, 95, 195, 295, …
2. 32, 41, 50, 59, …
3. -30, -130, -232, -332, …
4. -6, 20, 50, 80, …
5. 34, 27, 20, 13, …

EXERCISE 3.2
Find the common difference and give its recursive and explicit formula.
1. -3, -12, -48, -192, …
2. 7, 14, 28, 56, …
3. -2, 10, -50, 250, …
4. -4, -12, -36, -108, …
5. 4, -16, 64, -256, …