Lecture 18 Section 4.1 Thu, Feb 10, 2005

Slides:



Advertisements
Similar presentations
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 1 Homework, Page 739 Find the first six terms and the 100th term.
Advertisements

TR1413: INTRO TO DISCRETE MATHEMATICS LECTURE 2: MATHEMATICAL INDUCTION.
Special Sum The First N Integers. 9/9/2013 Sum of 1st N Integers 2 Sum of the First n Natural Numbers Consider Summation Notation ∑ k=1 n k =
Induction and Recursion by: Mohsin tahir (GL) Numan-ul-haq Waqas akram Rao arslan Ali asghar.
Sequences and Series (T) Students will know the form of an Arithmetic sequence.  Arithmetic Sequence: There exists a common difference (d) between each.
GPS – Sequences and Series  MA3A9. Students will use sequences and series  a. Use and find recursive and explicit formulae for the terms of sequences.
1 © 2010 Pearson Education, Inc. All rights reserved 10.1 DEFINITION OF A SEQUENCE An infinite sequence is a function whose domain is the set of positive.
Sequences and Series By: Olivia, Jon, Jordan, and Jaymie.
Lecture 9. Arithmetic and geometric series and mathematical induction
Week 5 - Wednesday.  What did we talk about last time?  Exam 1!
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen Chapter 3 Mathematical Reasoning, Induction and Recursion.
Sequences Definition - A function whose domain is the set of all positive integers. Finite Sequence - finite number of values or elements Infinite Sequence.
Math 71B 11.1 – Sequences and Summation Notation 1.
1 1 OBJECTIVE At the end of this topic you should be able to Define sequences and series Understand finite and infinite sequence,
Notes Over 11.1 Sequences and Series A sequence is a set of consecutive integers. A finite sequence contains a last term Infinite sequences continue without.
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.
Sequence – a function whose domain is positive integers. Section 9.1 – Sequences.
Defining and Using Sequences and Series
Pg. 395/589 Homework Pg. 601#1, 3, 5, 7, 8, 21, 23, 26, 29, 33 #43x = 1#60see old notes #11, -1, 1, -1, …, -1#21, 3, 5, 7, …, 19 #32, 3/2, 4/3, 5/4, …,
Sequences & Series Section 13.1 & Sequences A sequence is an ordered list of numbers, called terms. The terms are often arranged in a pattern.
Chapter 11 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Sequences and Summation Notation.
Mathematical Induction Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Mathematical induction is a legitimate method.
From … to Induction CS 270 Math Foundations of CS Jeremy Johnson.
8.4 Mathematical Induction Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Recursively defined sequences Write the first 5.
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.
Section 5.1. Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach a particular.
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.
Patterns and Inductive Reasoning. Inductive reasoning is reasoning that is based on patterns you observe. If you observe a pattern in a sequence, you.
Mathematical Induction I Lecture 19 Section 4.2 Mon, Feb 14, 2005.
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
Lesson 1: Sequences An infinite sequence: A finite sequence:
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.
Series and Sequences An infinite sequence is an unending list of numbers that follow a pattern. The terms of the sequence are written a1, a2, a3,...,an,...
CSE15 Discrete Mathematics 03/22/17
Sequences and Series 9.1.
The sum of the infinite and finite geometric sequence
Solve the problem progression and series
Copyright © Cengage Learning. All rights reserved.
Ch. 8 – Sequences, Series, and Probability
Sequences, Induction, & Probability
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Section 11.1 Sequences and Series
2.1 Using Inductive Reasoning to Make Conjectures
Five step procedure for drawing conclusions.
DAY 30 AGENDA: Quiz Tues.
Copyright © Cengage Learning. All rights reserved.
Geometric Sequences.
Copyright © Cengage Learning. All rights reserved.
Copyright © 2014 Pearson Education, Inc.
9.1 Sequences Sequences are ordered lists generated by a
Mathematical Induction
Copyright © Cengage Learning. All rights reserved.
Logic & Reasoning.
Infinite Series One important application of infinite sequences is in representing “infinite summations.” Informally, if {an} is an infinite sequence,
Copyright © Cengage Learning. All rights reserved.
Sequences and Summation Notation
Advanced Analysis of Algorithms
Chapter 11: Further Topics in Algebra
Mathematical Induction
Mathematical Induction
Mathematical Induction
8.1 Defining and Using Sequences and Series
1×1=1 11×11= ×111= ×1111= ×11111= ×111111= × = × =
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
10.1 Sequences and Summation Notation
Mathematical Induction II
Sequences.
11.4 Mathematical Induction
Presentation transcript:

Lecture 18 Section 4.1 Thu, Feb 10, 2005 Sequences Lecture 18 Section 4.1 Thu, Feb 10, 2005

Sequences Let S be a set. A finite sequence {xk} of elements of S is an ordered finite set of values x1, x2, …, xn in S. An infinite sequence {xk} of elements of S is an ordered set of values x1, x2, x3, … in S.

Sequences An example of a non-recursive sequence ak = 1/(k(k + 1)) {ak} = 1/2, 1/6, 1/12, 1/20, … An example of a recursive sequence a1 = 2, ak = 2ak – 1 – 1 for k  2. {ak} = 2, 3, 5, 9, …

Summation Notation The finite sum x1 + … + xn is represented by the expression Σk=1..n xk. The infinite sum x1 + x2 + x3 + … is represented by the expression Σk xk.

Induction and Deduction In logic, induction means to reason from the particular to the general. That is, to draw a general principle from a number of specific cases. Deduction is to reason from the general to the particular. That is, to apply a general principle to a specific case.

Using Induction Use inductive reasoning to find the value of the finite sum sn = Σk = 1..n 1/(k(k + 1)).

Example: Induction To use induction on the previous problem, we would investigate the first several cases, looking for a general pattern If n = 1, s1 = 1/2. If n = 2, s2 = 1/2 + 1/6 = 2/3. If n = 3, s3 = 2/3 + 1/12 = 3/4. If n = 4, s3 = 3/4 + 1/20 = 4/5. If n = 5, s3 = 4/5 + 1/30 = 5/6.

Example: Induction The obvious conjecture is that sn = n/(n + 1). for all integers n  1. How do we prove that this is true?

Using Induction Use inductive reasoning to find the value of the finite sum sn = Σk = 1..n 1/2k.

Example Reconsider the red dot-blue dot problem. Use the inductive method of reasoning. What if there were only one person? What if there were only two people? What if there were three people? What if there were n people, n  1?