Scribd
Upload
43 views16 pages

6-Solving Recurrence Relations I

Uploaded by

Ahmed Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
43 views16 pages

6-Solving Recurrence Relations I

Uploaded by

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

Solving Recurrence

Relations I

Ahmed Hadi Al-Taee


Department of Software 1
Closed Form
 Often an expression involving a sum of terms
can be simplified into a form that can be easily
computed with familiar operations, without
using loops, and without using recursion. Such
a form is often called a closed form.

Department of Software 2
Summation Notation Facts
 Let's start by reviewing a few important facts about
summation notation and the indexes used for
summing things. We can use summation notation to
represent a sum like a1+ a2 + … + an as follows:

Department of Software 3
Summation Notation (Review)

Department of Software 4
Summation Notation (Cont.)

Department of Software 5
Summation Notation (Cont.)

Department of Software 6
Summation’s Laws

Department of Software 7
Summation’s Laws (Cont.)

Department of Software 8
Summation’s Laws (Cont.)

Department of Software 9
Example

Department of Software 10
Example (Re-indexing)
 To compute such a sum, we should first reindex it so that
the indexing starts at 1. After that we could apply the above
theorems. Let j = i − 14. So i = j + 14. Since j = 1 when i =
15, and j = 70 when i = 84, we have

 OR

Department of Software 11
Example (Re-indexing)
 a

Department of Software 12
Example

Department of Software 13
Example

Department of Software 14
References
1. Seymour Lipschutz, and Marc Lipson, “Schaum’s
Outlines: Discrete Mathematics,” 3rd edition, McGraw-
Hill, 2007.
2. Rosen, Discrete Mathematics and Its Applications, 6th
edition, 2007.
3. Kevin Ferland, Discrete Mathematics, An Introduction
To Proofs And Combinatorics, Richard Stratton, 2009.
4. Thomas Koshy, Discrete Mathematics with Applications,
Elsevier Press, 2004.

Department of Software 15
Thank You for
Listening.

Department of Software 16

You might also like