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.

Slides:

Advertisements

Similar presentations

Chapter 8 Vocabulary. Section 8.1 Vocabulary Sequences An infinite sequence is a function whose domain is the set of positive integers. The function.

Advertisements

A sequence is a set of numbers arranged in a definite order

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.

Summation Notation. Terminology The Greek letter, , indicates a sum and is referred to as a summation operation. k is referred to as the index of summation.

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.

Geometric Sequences and Series

Geometric Sequences and Series A sequence is geometric if the ratios of consecutive terms are the same. 2, 8, 32, 128, 512,... Definition of Geometric.

Functions, Sequences, and Sums

1 Sequences and Summations CS/APMA 202 Rosen section 3.2 Aaron Bloomfield.

Introduction to sequences and series A sequence is a listing of numbers. For example, 2, 4, 6, 8,... or 1, 3, 5,... are the sequences of even positive.

MSU/CSE 260 Fall Sequences and Summations.

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.

Sequences and Summations

February 12, 2015Applied Discrete Mathematics Week 2: Functions and Sequences 1Exercises Question 1: Given a set A = {x, y, z} and a set B = {1, 2, 3,

2.4 Sequences and Summations

Section 8.1 Sequences & Series. Sequences & Series Definition of Sequence: An infinite sequence is a function whose domain is the set of positive integers.

Factorial Notation For any positive integer n, n! means: n (n – 1) (n – 2)... (3) (2) (1) 0! will be defined as equal to one. Examples: 4! = =

Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.

Copyright © 2011 Pearson Education, Inc. Slide Sequences A sequence is a function that has a set of natural numbers (positive integers) as.

1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen Chapter 3 Mathematical Reasoning, Induction and Recursion.

Introduction to sequences and series

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.

13.6 Sigma Notation. Objectives : 1. Expand sequences from Sigma Notation 2. Express using Sigma Notation 3. Evaluate sums using Sigma Notation Vocabulary.

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.

Arithmetic and Geometric Series: Lesson 43. LESSON OBJECTIVE: 1.Find sums of arithmetic and geometric series. 2.Use Sigma Notation. 3.Find specific terms.

Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.

Module #12: Summations Rosen 5 th ed., §3.2 Based on our knowledge on sequence, we can move on to summations easily.

Sequences and Summations

Review Write an explicit formula for the following sequences.

Sequences and Summations Section 2.4. Section Summary Sequences. – Examples: Geometric Progression, Arithmetic Progression Recurrence Relations – Example:

Chapter 11 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Sequences and Summation Notation.

MATHPOWER TM 12, WESTERN EDITION Chapter 6 Sequences and Series.

9.1 Sequences and Series. Definition of Sequence  An ordered list of numbers  An infinite sequence is a function whose domain is the set of positive.

Copyright © 2011 Pearson, Inc. 9.5 Series Goals: Use sigma notation to find the finite sums of terms in arithmetic and geometric sequences. Find sums of.

SEQUENCES OBJECTIVES: Write the first several terms of a sequence Write the terms of a sequence defined by a Recursive Formula Use Summation Notation Find.

Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 Basic Structure : Sets, Functions, Sequences, and Sums Sequences and Summations.

Chapter 2 1. Chapter Summary Sets The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions and sequences.

Ch. 10 – Infinite Series 9.1 – Sequences. Sequences Infinite sequence = a function whose domain is the set of positive integers a 1, a 2, …, a n are the.

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.

Arithmetic Sequences and Series Section Objectives Use sequence notation to find terms of any sequence Use summation notation to write sums Use.

Fall 2002CMSC Discrete Structures1 Chapter 3 Sequences Mathematical Induction Recursion Recursion.

Essential Question: How do you find the nth term and the sum of an arithmetic sequence? Students will write a summary describing the steps to find the.

Arithmetic Sequences and Series

Applied Discrete Mathematics Week 2: Functions and Sequences

The sum of the infinite and finite geometric sequence

Sequences and Summations

Sect.R10 Geometric Sequences and Series

The symbol for summation is the Greek letter Sigma, S.

Sequences and Summations

Sequences and Series College Algebra

Mathematical Induction Recursion

CS100: Discrete structures

Finite Differences.

Copyright © 2014, 2010, 2007 Pearson Education, Inc.

Section 9.1 Sequences and Series.

Sequences and Series 4.7 & 8 Standard: MM2A3d Students will explore arithmetic sequences and various ways of computing their sums. Standard: MM2A3e Students.

ICS 253: Discrete Structures I

CMSC Discrete Structures

SUMMATION or SIGMA NOTATION

Properties of Functions

Sequences and Summation Notation

Geometric Sequences and Series

Copyright © 2014, 2010, 2007 Pearson Education, Inc.

10.1 Sequences and Summation Notation

Presentation transcript:

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 of N to a set S. We use the notation a n to denote the image of the integer n. We call a n a term of the sequence. Example: subset of N: … S: …

3/16/20163 Sequences We use the notation {a n } to describe a sequence. Important: Do not confuse this with the {} used in set notation. It is convenient to describe a sequence with a formula. For example, the sequence on the previous slide can be specified as {a n }, where a n = 2n.

3/16/20164 The Formula Game 1, 3, 5, 7, 9, … a n = 2n , 1, -1, 1, -1, … a n = (-1) n 2, 5, 10, 17, 26, … a n = n , 0.5, 0.75, 1, 1.25 … a n = 0.25n 3, 9, 27, 81, 243, … a n = 3 n What are the formulas that describe the following sequences a 1, a 2, a 3, … ?

3/16/20165 Strings Finite sequences are also called strings, denoted by a 1 a 2 a 3 …a n. The length of a string S is the number of terms that it consists of. The empty string contains no terms at all. It has length zero.

3/16/20166 Summations It represents the sum a m + a m+1 + a m+2 + … + a n. The variable j is called the index of summation, running from its lower limit m to its upper limit n. We could as well have used any other letter to denote this index. What does stand for?

3/16/20167 Summations It is = 21. We write it as. What is the value of ? It is so much work to calculate this… What is the value of ? How can we express the sum of the first 1000 terms of the sequence {a n } with a n =n 2 for n = 1, 2, 3, … ?

3/16/20168 Summations It is said that Friedrich Gauss came up with the following formula: When you have such a formula, the result of any summation can be calculated much more easily, for example:

3/16/20169 Arithemetic Series How does: Observe that: …+ n/2 + (n/2 + 1) +…+ (n - 2) + (n - 1) + n ??? = [1 + n] + [2 + (n - 1)] + [3 + (n - 2)] +…+ [n/2 + (n/2 + 1)] = (n + 1) + (n + 1) + (n + 1) + … + (n + 1) (with n/2 terms) = (n + 1) + (n + 1) + (n + 1) + … + (n + 1) (with n/2 terms) = n(n + 1)/2. = n(n + 1)/2.

3/16/ Geometric Series How does: Observe that: S = 1 + a + a 2 + a 3 + … + a n ??? aS = a + a 2 + a 3 + … + a n + a (n+1) so, (aS - S) = (a - 1)S = a (n+1) - 1 Therefore, 1 + a + a 2 + … + a n = (a (n+1) - 1) / (a - 1). For example: … = 2047.

3/16/ Useful Series

3/16/ Double Summations Corresponding to nested loops in C or Java, there is also double (or triple etc.) summation: Example: