Scribd
Upload
6 views2 pages

CSF10103 Tutorial 3

Uploaded by

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

CSF10103 Tutorial 3

Uploaded by

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

CSF10103: MATHEMATICS FOR COMPUTER SCIENCE

Tutorial 3: Mathematical Induction and Recursion

SECTION A

1. Prove that
3 + 11 + ⋯ + (8𝑛 − 5) = 4𝑛2 − 𝑛 for all 𝑛 ∈ 𝑵.

2. Prove that
𝑛(𝑛+1)(2𝑛+1)
1 + 4 + 9 + ⋯ + 𝑛2 = for all 𝑛 ∈ 𝑵.
6

3. Prove that
4 + 10 + 16 + ⋯ + (6𝑛 − 2) = 𝑛(3𝑛 + 1) for all 𝑛 ∈ 𝑵.

4. Prove that
𝑘(𝑘+1)(2𝑘+1)
12 + 2 2 + ⋯ + 𝑘 2 = for all 𝑘 ∈ 𝑵.
6

5. Prove that
𝑎 𝑛+1 −1
∑𝑛𝑘=0 𝑎𝑘 = for 𝑎 ∈ 𝑹, 𝑎 ≠ 0, 𝑎 ≠ 1, and 𝑛 is non-negative integers.
𝑎−1

6. Prove that
1 1 1 1 𝑛
1∙5
+ 5∙9 + 9∙13 + ⋯ + (4𝑛−3)(4𝑛+1) = 4𝑛+1 for all 𝑛 ∈ 𝑵.

7. Prove that 𝑛5 − 𝑛 is divisible by 5 for all 𝑛 ∈ 𝑵.

8. Prove that 𝑛3 − 4𝑛 + 6 is divisible 3 for all 𝑛 is non-negative integers.

9. Prove that 52𝑛 − 6𝑛 + 8 is divisible by 9 for all 𝑛 ∈ 𝑵.

Note that 𝑵 = {1,2,3, … }


SECTION B

1. Consider the sequence given by 𝑎𝑛 = (𝑛 − 1)/(𝑛 + 1) for 𝑛 ∈ 𝑵.

a) List the first six terms of this sequence.


b) Calculate 𝑎𝑛+1 − 𝑎𝑛 for 𝑛 = 1, 2, 3.
c) Show that 𝑎𝑛+1 − 𝑎𝑛 = 2/[(𝑛 + 1)(𝑛 + 2)] for 𝑛 ∈ 𝑵.

2. Consider the sequence 5, 11, 17, 23, 29, … is defined by 𝑆𝑛 = 6𝑛 − 1. Give a


recursive definition of the sequence, which is 𝑆𝑛+1 .

3. For 𝑛 ∈ 𝑵, let 𝑆𝑛 = 𝑛2 − 𝑛.

a) Calculate 𝑆𝑛 for 𝑛 ≤ 6.
b) Show that 𝑆𝑛+1 = 𝑆𝑛 + 2𝑛 for all 𝑛 ∈ 𝑵.

4. For 𝑛 ∈ 𝑵, let 𝑆𝑆𝑄(𝑛) = ∑𝑛𝑖=1 𝑖 2

a) Calculate 𝑆𝑆𝑄(𝑛) for 𝑛 = 1,3 𝑎𝑛𝑑 5.


b) Show that 𝑆𝑆𝑄(𝑛 + 1) = 𝑆𝑆𝑄(𝑛) + (𝑛 + 1)2 for 𝑛 ≥ 1.
c) Given that 𝑆𝑆𝑄(73) = 132,349. Use this to calculate 𝑆𝑆𝑄(74) and 𝑆𝑆𝑄(72).

5. We recursively define 𝑎0 = 𝑎1 = 1 and 𝑎𝑛 = 𝑎𝑛−1 + 2𝑎𝑛−2 for 𝑛 ≥ 2. Calculate 𝑎6


recursively.

You might also like