Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c)2001-2004 Michael P. Frank Modified by (c) 2004-2005 Haluk Bingöl 1/18 Module.

Slides:



Advertisements
Similar presentations
1 Sequences Rosen 6 th ed., §2.4 2 Sequences A sequence represents an ordered list of elements.A sequence represents an ordered list of elements. e.g.,
Advertisements

22C:19 Discrete Math Sequence and Sums Fall 2011 Sukumar Ghosh.
CSE115/ENGR160 Discrete Mathematics 02/22/11 Ming-Hsuan Yang UC Merced 1.
Chapter 4 Mathematical Induction Used to verify a property of a sequence 2,4,6,8,… for i >= 1 a i = 2i –infinite sequence with infinite distinct values.
CSE115/ENGR160 Discrete Mathematics 02/21/12
Sequences & Summations Section 2.4 of Rosen Fall 2008 CSCE 235 Introduction to Discrete Structures Course web-page: cse.unl.edu/~cse235 Questions:
1 Section 3.2 Sequences and Summations. 2 Sequence Function from a subset of Z (usually the set beginning with 1 or 0) to a set S a n denotes the image.
CMSC 250 Discrete Structures Summation: Sequences and Mathematical Induction.
Copyright © 2007 Pearson Education, Inc. Slide 8-1 Warm-Up Find the next term in the sequence: 1, 1, 2, 6, 24, 120,…
Geometric Sequences and Series
MATH 224 – Discrete Mathematics
Sequences & Summations CS 1050 Rosen 3.2. Sequence A sequence is a discrete structure used to represent an ordered list. A sequence is a function from.
Lecture 9. Arithmetic and geometric series and mathematical induction
Sequences and Summations
2015 년 봄학기 강원대학교 컴퓨터과학전공 문양세 이산수학 (Discrete Mathematics) 수열과 합 (Sequences and Summations)
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Copyright © 2011 Pearson Education, Inc. Slide
Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module.
SEQUENCES AND SERIES Arithmetic. Definition A series is an indicated sum of the terms of a sequence.  Finite Sequence: 2, 6, 10, 14  Finite Series:2.
Sequences and Summations
Fall 2002CMSC Discrete Structures1 … and now for… Sequences.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
1 Sequences Rosen 6 th ed., §2.4 2 Sequences A sequence represents an ordered list of elements.A sequence represents an ordered list of elements. Formally:
Discrete math Bijections 2 A function f is a one-to-one correspondence, or a bijection or reversible, or invertible, iff it is both one-to-one and onto.
By Sheldon, Megan, Jimmy, and Grant..  Sequence- list of numbers that usually form a pattern.  Each number in the list is called a term.  Finite sequence.
Aim: Summation Notation Course: Alg. 2 & Trig. Do Now: Aim: What is this symbol It’s Greek to me! Find the sum of the geometric series.
Aim: What is the summation notation?
4.7 Define & Use Sequences & Series. Vocabulary  A sequence is a function whose domain is a set of consecutive integers. If not specified, the domain.
Lesson 8.1 Page #1-25(EOO), 33, 37, (ODD), 69-77(EOO), (ODD), 99, (ODD)
Module #12: Summations Rosen 5 th ed., §3.2 Based on our knowledge on sequence, we can move on to summations easily.
강원대학교 컴퓨터과학전공 문양세 이산수학 (Discrete Mathematics) 수열과 합 (Sequences and Summations)
Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/21 Module.
Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module.
Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module.
12 INFINITE SEQUENCES AND SERIES. In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series.
2014 년 봄학기 강원대학교 컴퓨터과학전공 문양세 이산수학 (Discrete Mathematics) 수열과 합 (Sequences and Summations)
CS 285- Discrete Mathematics
1 CMSC 250 Chapter 4, Summations and Products. 2 CMSC 250 Induction l Induction is a proof technique used to verify a property of a sequence –2,4,6,8,…
Lecture#15 Discrete Mathematics. Summation Computing Summation Let a 0 = 2, a 1 = 3, a 2 = -2, a 3 = 1 and a 4 = 0. Compute each of the summations: =
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 Basic Structure : Sets, Functions, Sequences, and Sums Sequences and Summations.
3/16/20161 … and now for… Sequences. 3/16/20162 Sequences Sequences represent ordered lists of elements. A sequence is defined as a function from a subset.
8.1 CompSci 102© Michael Frank Today’s topics Integers & Number TheoryIntegers & Number Theory – –Sequences – –Summations Reading: Sections 3.2Reading:
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module.
Lecture # 20 Sequence & Series
8.1 – Sequences and Series. Sequences Infinite sequence = a function whose domain is the set of positive integers a 1, a 2, …, a n are the terms of the.
8.1 CompSci 102© Michael Frank Today’s topics Integers & Number TheoryIntegers & Number Theory – –More proof techniques – –Sequences – –Summations Reading:
22C:19 Discrete Structures Sequence and Sums Fall 2014 Sukumar Ghosh.
INFINITE SEQUENCES AND SERIES In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series and.
CS 2210 (22C:19) Discrete Structures Sequence and Sums
The sum of the infinite and finite geometric sequence
Sect.R10 Geometric Sequences and Series
CS 2210:0001 Discrete Structures Sequence and Sums
Mathematical Induction Recursion
VCU, Department of Computer Science CMSC 302 Sequences and Summations Vojislav Kecman 9/19/2018.
Rosen 5th ed., §3.2 ~19 slides, ~1 lecture
Rosen 5th ed., §3.2 ~19 slides, ~1 lecture
Rosen 5th ed., §3.2 ~9 slides, ~½ lecture
Finite Differences.
ICS 253: Discrete Structures I
CS 2210:0001 Discrete Structures Sequence and Sums
Sets, Sequences, and Summations
SUMMATION or SIGMA NOTATION
Rosen 5th ed., §3.2 ~9 slides, ~½ lecture
Discrete Mathematics and its Applications
Discrete Mathematics CS 2610
Sequences and Summation Notation
Discrete Mathematics and its Applications
Geometric Sequences and Series
Presentation transcript:

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module #13 - Summations Bogazici University Department of Computer Engineering CmpE 220 Discrete Mathematics 13. Summations Haluk Bingöl

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 2/18 Module #13 - Summations Module #13: Summations Rosen 5 th ed., §3.2 ~19 slides, ~1 lecture

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 3/20 Module #13 - Summations Summation Notation Def. Given a series {a n }, an integer lower bound (or limit) j  0, and an integer upper bound k  j, then the summation of {a n } from j to k is written and defined as follows: Here, i is called the index of summation.

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 4/20 Module #13 - Summations Generalized Summations Notation. For an infinite series, 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:

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 5/20 Module #13 - Summations Simple Summation Example

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 6/20 Module #13 - Summations More Summation Examples An infinite series with a finite sum: Using a predicate to define a set of elements to sum over:

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 7/20 Module #13 - Summations Summation Manipulations Some handy identities for summations: (Distributive law.) (An application of commutativity.) (Index shifting.)

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 8/20 Module #13 - Summations More Summation Manipulations Other identities that are sometimes useful: (Grouping.) ? (Order reversal.) (Series splitting.)

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 9/20 Module #13 - Summations Example: Impress Your Friends Boast, “I’m so smart; give me any 2-digit number n, and I’ll add all the numbers from 1 to n in my head in just a few seconds.” I.e., Evaluate the summation: There is a simple closed-form formula for the result, discovered by Euler at age 12! And frequently rediscovered by many… Leonhard Euler ( )

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 10/20 Module #13 - Summations Euler’s Trick, Illustrated Consider the sum: 1+2+…+(n/2)+((n/2)+1)+…+(n-1)+n We have n/2 pairs of elements, each pair summing to n+1, for a total of (n/2)(n+1). … n+1

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 11/20 Module #13 - Summations Symbolic Derivation of Trick For case where n is even…

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 12/20 Module #13 - Summations Concluding Euler’s Derivation So, you only have to do 1 easy multiplication in your head, then cut in half. Also works for odd n (prove this at home).

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 13/20 Module #13 - Summations Geometric Progression Def. A geometric progression is a series of the form a, ar, ar 2, ar 3, …, ar k, where a,r  ℝ. The sum of such a series is given by: We can reduce this to closed form via clever manipulation of summations...

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 14/20 Module #13 - Summations Here we go... Geometric Sum Derivation

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 15/20 Module #13 - Summations Geometric Sum Derivation...

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 16/20 Module #13 - Summations Geometric Sum Derivation...

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 17/20 Module #13 - Summations Nested Summations These have the meaning you’d expect. Note issues of free vs. bound variables, just like in quantified expressions, integrals, etc.

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 18/20 Module #13 - Summations Some Shortcut Expressions Geometric series. Euler’s trick. Quadratic series. Cubic series.

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 19/20 Module #13 - Summations Using the Shortcuts Example: Evaluate. Use series splitting. Solve for desired summation. Apply quadratic series rule. Evaluate.

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 20/20 Module #13 - Summations Summations: Conclusion You need to know: How to read, write & evaluate summation expressions like: Summation manipulation laws we covered. Shortcut closed-form formulas, & how to use them.

Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 21/20 Module #13 - Summations References Rosen Discrete Mathematics and its Applications, 5e Mc GrawHill, 2003Rosen Discrete Mathematics and its Applications, 5e Mc GrawHill, 2003