ics141-lecture10-Summations

ics141-lecture10-Summations - University of Hawaii ICS141:...

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

View Full Document Right Arrow Icon
10-1 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii ICS141: Discrete Mathematics for Computer Science I Department of Information and Computer Sciences University of Hawaii Stephen Y. Itoga
Background image of page 1

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

View Full DocumentRight Arrow Icon
10-2 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii Lecture 10 Chapter 2. Basic Structures 2.4 Sequences and Summations
Background image of page 2
10-3 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii Some material in these slides were taken/adapted from the slides made by Prof. Michael P. Frank and Prof. Jonathan L. Gross which are provided through the publisher of “Discrete Mathematics and Its Applications” written by Kenneth H. Rosen. Some material is from Prof. Baek
Background image of page 3

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

View Full DocumentRight Arrow Icon
10-4 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii Summation Notation Given a sequence { a n } , an integer lower bound (or limit ) j 0 , and an integer upper bound k j , then the summation of { a n } from a j to a k is written and defined as follows: k j j k j i i a a a a + + + = + = ... 1 = = = = = k j l l k j m m k j i i a a a
Background image of page 4
10-5 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii Generalized Summations For an infinite sequence, we may write: To sum a function over all members of a set X ={ x 1 , x 2 , …} : Or, if X ={ x | P ( x )}, we may just write: + + = ) ( ) ( ) ( 2 1 x f x f x f X x + + = ) ( ) ( ) ( 2 1 ) ( x f x f x f x P + + = + = 1 j j j i i a a a
Background image of page 5

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

View Full DocumentRight Arrow Icon
10-6 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii ( 29 32 17 10 5 ) 1 16 ( ) 1 9 ( ) 1 4 ( ) 1 4 ( ) 1 3 ( ) 1 2 ( 1 2 2 2 4 2 2 = + + = + + + + + = + + + + + = + = i i Simple Summation Example = 100 1 1 i i = + + + + 100 1 4 1 3 1 2 1 1
Background image of page 6
10-7 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii More Summation Examples An infinite sequence with a finite sum: Using a predicate to define a set of elements to sum over: 87 49 25 9 4 7 5 3 2 2 2 2 2 10 ( 2 = + + + = + + + = < x x x prime) is 2 4 1 2 1 1 2 2 2 1 0 0 = + + + = + + = - = - i i
Background image of page 7

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

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 23

ics141-lecture10-Summations - University of Hawaii ICS141:...

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

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