2. Sequences+Induction - MATH 224 Discrete Mathematics...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 08/27/09 MATH 224 – Discrete Mathematics = n i i 1 = n j j ar 0 Sequences and Sums A sequence of the form ar 0 , ar 1 , ar 2 , ar 3 , ar 4 , … , ar n , is called a geometric sequence and occurs quite often in computer science applications. Another common sequence is of the form a, 2a, 3a, 4a, … , na is called an arithmetic sequence. We have seen this when examining the number of steps executed by selection sort. In our example a was equal to 1, so we just had 1, 2, 3, … . N. Often we are interested in the sum of one of these sequences as in the arithmetic sum and the geometric sum. 2 ) 1 ( n n + = r r a n - - + 1 ) 1 ( 1 = Arithmetic Sum Geometric Sum (as long as r ≠ 1) What will be the formula for the geometric sum when a = 1. Compare this to the formula on Page 155 from our text. Are they equivalent?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
08/27/09 MATH 224 – Discrete Mathematics = n i ai 1 = n i i a 0 Basic Properties of Sums = + = = = + = n k i n i k i i f i f i f 1 1 1 ) ( ) ( ) ( From this equality it follows that
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

2. Sequences+Induction - MATH 224 Discrete Mathematics...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online