(CSC 102) Lecture 23 Discrete Structures. Previous Lecture Summery  Sequences  Alternating Sequence  Summation Notation  Product Notation  Properties.

Slides:



Advertisements
Similar presentations
Mathematical Induction
Advertisements

Chapter 4 Sequences and Mathematical Induction. 4.2 Mathematical Induction.
Sequences and Mathematical Induction
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Week 5 - Friday.  What did we talk about last time?  Sequences  Summation and production notation  Proof by induction.
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
Discrete Mathematics Lecture 4: Sequences and Mathematical Induction
1 Intro to Induction Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Kavita Hatwal Fall Sequences and Induction.
Discrete Structures Chapter 2 Part B Mathematical Induction
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
CSE115/ENGR160 Discrete Mathematics 03/22/12 Ming-Hsuan Yang UC Merced 1.
CMSC 250 Discrete Structures Summation: Sequences and Mathematical Induction.
1 Sequences and Mathematical Induction An important task of mathematics is to discover and characterize regular patterns, such as those associated with.
Chapter 5: Sequences, Mathematical Induction and Recursion
Discrete Structures Chapter 5: Sequences, Mathematical Induction, and Recursion 5.2 Mathematical Induction I [Mathematical induction is] the standard proof.
Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Mathematical Induction.
Copyright © Cengage Learning. All rights reserved.
1 Section 3.3 Mathematical Induction. 2 Technique used extensively to prove results about large variety of discrete objects Can only be used to prove.
1 Strong Mathematical Induction. Principle of Strong Mathematical Induction Let P(n) be a predicate defined for integers n; a and b be fixed integers.
Mathematical Induction
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
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.
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
Copyright © Cengage Learning. All rights reserved.
Chapter 6 Mathematical Induction
Discrete Mathematics, 1st Edition Kevin Ferland
Lecture 3.1: Mathematical Induction CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.
CSNB143 – Discrete Structure Topic 5 – Induction Part I.
1 Introduction to Abstract Mathematics Chapter 4: Sequences and Mathematical Induction Instructor: Hayk Melikya 4.1- Sequences. 4.2,
Week 5 - Wednesday.  What did we talk about last time?  Exam 1!
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
1 CMSC 250 Chapter 4, con't., Inductive Proofs. 2 CMSC 250 Description l Inductive proofs must have: –Base case: where you prove that what it is you are.
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
Sequences and Summations
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Discrete Mathematics Lecture 4 Alexander Bukharovich New York University.
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
1, Mustafa Jarrar Lecture Notes on Sequences & Mathematical Induction. Birzeit University, Palestine, 2015 mjarrar©2015 Sequences & Mathematical Induction.
CS 103 Discrete Structures Lecture 13 Induction and Recursion (1)
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,…
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
Copyright © Cengage Learning. All rights reserved. Sequences and Series.
1 2/21/2016 MATH 224 – Discrete Mathematics 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.
Chapter 5. 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.
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.
1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )
Mathematical Induction I Lecture 19 Section 4.2 Mon, Feb 14, 2005.
Mathematical Induction. The Principle of Mathematical Induction Let S n be a statement involving the positive integer n. If 1.S 1 is true, and 2.the truth.
Chapter 1 Logic and Proof.
MATH 224 – Discrete Mathematics
Advanced Algorithms Analysis and Design
Chapter 3 The Real Numbers.
Mathematical Induction Recursion
Copyright © Cengage Learning. All rights reserved.
Mathematical Induction I
Copyright © Cengage Learning. All rights reserved.
Mathematical Induction
Advanced Analysis of Algorithms
Chapter 11: Further Topics in Algebra
Copyright © Cengage Learning. All rights reserved.
Mathematical Induction
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Lecture 3.1: Mathematical Induction
Presentation transcript:

(CSC 102) Lecture 23 Discrete Structures

Previous Lecture Summery  Sequences  Alternating Sequence  Summation Notation  Product Notation  Properties of Sequences  Change of Variable  Factorial Notations

Change Of Variable Observe thet And also This equation illustrates the fact that the symbol used to represent the index of a summation can be replaced by any other symbol as long as the replacement is made in each location where the symbol occurs. As a consequence, the index of a summation is called a dummy variable. A dummy variable is a symbol that derives its entire meaning from its local context. Outside of that context (both before and after), the symbol may have another meaning entirely.

Transforming a Sum by a Change of Variable

Upper Limit Appears in the Expression to Be Summed

Cont…

Factorial Notations

Examples

Cont….

Special Factorial Cases

Example

Mathematical Induction I

Mathematical Induction  Principle of Mathematical Induction  Method of proof  Finding Terms of Sequences  Sum of Geometric Series

Introduction Any whole number of cents of at least 8c/ can be obtained using 3c and 5c coins. More formally: For all integers n ≥ 8, n cents can be obtained using 3c and 5c coins. Even more formally: For all integers n ≥ 8, P(n) is true, where P(n) is the sentence “n cents can be obtained using 3c and 5c coins.”

Cont…. The cases shown in the table provide inductive evidence to support the claim that P(n) is true for general n. Indeed, P(n) is true for all n ≥ 8 if, and only if, it is possible to continue filling in the table for arbitrarily large values of n. The k th line of the table gives information about how to obtain kc using 3c and 5c coins. To continue the table to the next row, directions must be given for how to obtain (k + 1) c using 3c and 5c coins. The secret is to observe first that if kc can be obtained using at least one 5c coin, then (k + 1) c can be obtained by replacing the 5c coin by two 3c coins,

Cont… If, on the other hand, kc is obtained without using a 5c coin, then 3c coins are used exclusively. And since the total is at least 8c, three or more 3c coins must be included. Three of the 3c coins can be replaced by two 5c coins to obtain a total of (k + 1) c. Any argument of this form is an argument by mathematical induction. In general, mathematical induction is a method for proving that a property defined for integers n is true for all values of n that are greater than or equal to some initial integer.

Principal Of Mathematical Induction

Method Of Proof

Finding Terms of Sequences Proposition: For all integers n ≥ 8, n c can be obtained using 3c and 5c coins Proof: Let the property P(n) be the sentence n c can be obtained using 3c and 5c coins. ← P(n) Show that P(8) is true: P(8) is true because 8c can be obtained using one 3c coin and one 5c coin. Show that for all integers k ≥ 8, if P(k) is true then P(k+1) is also true: Suppose that k is any integer with k ≥ 8 such that kc can be obtained using 3c and 5c coins. ← P(k) inductive hypothesis

(k + 1) c can be obtained using 3c and 5ccoins. ← P(k + 1) Case 1 (There is a 5c coin among those used to make up the kc In this case replace the 5c coin by two 3c coins; the result will be (k + 1)c Case 2 (There is not a 5c/ coin among those used to make up the kc In this case, because k ≥ 8, at least three 3c coins must have been used. So remove three 3c coins and replace them by two 5c coins; the result will be (k + 1)c. Thus in either case (k + 1)c can be obtained using 3c and 5c coins. Explicit formula

Propositions Proposition: For all integers n ≥ 1, · · ·+n = n(n + 1)/2 Proof:

Cont…

Sum of Geometric Series

Cont….

Cont…

Deducing Additional Formula

As with the formula for the sum of the first n integers, there is a way to think of the formula for the sum of the terms of a geometric sequence that makes it seem simple and intuitive. Let Equating the right-hand sides of equations and dividing by r − 1 gives Cont…

Lecture Summery  Change of Variable  Factorial Notations  Mathematical Induction  Method of proof  Finding Terms of Sequences  Sum of Geometric Series