Week 5 - Wednesday.  What did we talk about last time?  Exam 1!

Slides:



Advertisements
Similar presentations
Week 6 - Wednesday CS322.
Advertisements

Sequences and Mathematical Induction
Chapter 1: Sequences and Sets 1.1 Sequences. Sequences What number comes next? 1, 2, 3, 4, 5, ____ 2, 6, 10, 14, 18, ____ 1, 2, 4, 8, 16, ____
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.
Induction and recursion
Discrete Mathematics Lecture 4: Sequences and Mathematical Induction
Discrete Mathematics Lecture 4 Harper Langston New York University.
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.
Kavita Hatwal Fall Sequences and 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.
1 Sequences and Mathematical Induction An important task of mathematics is to discover and characterize regular patterns, such as those associated with.
Discrete Structures Chapter 5: Sequences, Mathematical Induction, and Recursion 5.2 Mathematical Induction I [Mathematical induction is] the standard proof.
Copyright © 2007 Pearson Education, Inc. Slide 8-1 Warm-Up Find the next term in the sequence: 1, 1, 2, 6, 24, 120,…
Lecture 4 Discrete Mathematics Harper Langston. Algorithms Algorithm is step-by-step method for performing some action Cost of statements execution –Simple.
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 © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Mathematical Maxims and Minims, 1988
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 Informally, a sequence is a set of elements written in a row. – This concept is represented in CS using one- dimensional arrays The goal of mathematics.
Sequences and Series By: Olivia, Jon, Jordan, and Jaymie.
Lecture 9. Arithmetic and geometric series and mathematical induction
Induction and recursion
Discrete Mathematics, 1st Edition Kevin Ferland
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
1 Introduction to Abstract Mathematics Chapter 4: Sequences and Mathematical Induction Instructor: Hayk Melikya 4.1- Sequences. 4.2,
Chapter 6 Sequences And Series Look at these number sequences carefully can you guess the next 2 numbers? What about guess the rule?
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Math Review Data Structures & File Management Computer Science Dept Va Tech July 2000 ©2000 McQuain WD 1 Summation Formulas Let N > 0, let A, B, and C.
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.
9.4 Mathematical Induction
CHAPTER 1 INDUCTIVE AND DEDUCTIVE REASONING. 1.1 – MAKING CONJECTURES A conjecture is a testable expression that is based on available evidence, but is.
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)
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, …,
Discrete Mathematics Lecture 4 Alexander Bukharovich New York University.
11.1 Sequences and Series. Sequences What number comes next? 1, 2, 3, 4, 5, ____ 2, 6, 10, 14, 18, ____ 1, 2, 4, 8, 16, ____
Sequences and Series (Section 9.4 in Textbook).
Section 3.3: Mathematical Induction Mathematical induction is a proof technique that can be used to prove theorems of the form:  n  Z +,P(n) We have.
(CSC 102) Lecture 23 Discrete Structures. Previous Lecture Summery  Sequences  Alternating Sequence  Summation Notation  Product Notation  Properties.
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)
Mathematical Induction 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.
CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction Linda Shapiro Winter 2015.
Copyright © Cengage Learning. All rights reserved. Sequences and Series.
CompSci 102 Discrete Math for Computer Science March 13, 2012 Prof. Rodger Slides modified from Rosen.
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.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Mathematical Induction
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Pre-Calculus Section 8.1A Sequences and Series. Chapter 8: Sequences, Series, and Probability Sequences and series describe algebraic patterns. We will.
Fall 2002CMSC Discrete Structures1 Chapter 3 Sequences Mathematical Induction Recursion Recursion.
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
Discrete Mathematics Lecture 6
Advanced Algorithms Analysis and Design
Induction and recursion
Mathematical Induction Recursion
CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction
Induction and recursion
Lecture 18 Section 4.1 Thu, Feb 10, 2005
Advanced Analysis of Algorithms
Copyright © Cengage Learning. All rights reserved.
Mathematical Induction
8.1 Defining and Using Sequences and Series
Agenda Proofs (Konsep Pembuktian) Direct Proofs & Counterexamples
Presentation transcript:

Week 5 - Wednesday

 What did we talk about last time?  Exam 1!

 People with assorted eye colors live on an island. They are all perfect logicians: If a conclusion can be logically deduced, they will do it instantly. No one knows their eye color. Every night at midnight, a ferry stops at the island. Any islanders who have figured out the color of their own eyes must leave the island, and the rest stay. Everyone can see everyone else at all times and keeps a count of the number of people they see with each eye color (excluding themselves), but they cannot otherwise communicate. Everyone on the island knows these rules.  On this island there are 100 blue-eyed people, 100 brown-eyed people, and the Guru (she happens to have green eyes). So any given blue-eyed person can see 100 people with brown eyes and 99 people with blue eyes (and one with green), but that does not tell him his own eye color; as far as he knows the totals could be 101 brown and 99 blue. Or 100 brown, 99 blue, and he could have red eyes.  The Guru is allowed to speak once, at noon, on one day in all their endless years on the island. Standing before the islanders, she says the following: "I can see someone who has blue eyes."  Who leaves the island, and on what night?

 Mathematicians love patterns  Perhaps the best example of that is sequences  A sequence is a set of elements, usually numbers, written in order  Each element is called a term  We can number each term, calling that number the subscript or index  Sequences can be finite or infinite

 What's the next term in each sequence?  1, 2, 3, 4, …  1, 4, 9, 16, …  1, 1, 2, 3, 5, …  1, 2, …  Wrong! The next term is 720!. Yes, that's actually factorial. What's the term after that?

 It is often possible to use a formula to describe the relationship between the value of a subscript and the value of the corresponding term  Let term a k = k/(k + 1), for integers k  1  Let term b i = (i – 1)/i, for integers i  2  What are the first few terms of each?

 It's important to note that not all sequences are monotonic  Give an explicit formula for 1, -3, 5, -7, 9, …

 Summation notation is used to describe a summation of some part of a series  Expanded form is the summation written without the sigma  Compute the following:

 1/n + 2/(n+1) + 3/(n+2) + … + (n+1)/(2n)  1/2 + 1/(2∙3) + 1/(3∙4) + … + 1/(n∙(n+1))

 Product notation is used to describe a product of some part of a series  Expanded form is the product written without the pi  Compute the following:

 n factorial is written n!  n! = n∙(n-1) ∙… ∙3 ∙2 ∙1  We define 0! to be 1, for reasons that will become clear later  Factorial grows fast, even faster than 2 n  The growth rate of factorial is roughly 2 nlog n  Write factorial using product notation

 Be careful about moving things in and out of products and sums  The following are allowed:

 Changing from one dummy variable to another is always allowed, provided that all occurrences are changed  Changing the bounds of a variable is allowed, provided that the summation is suitably adjusted  Example:

 General induction is moving from a specific set of facts to a general conclusion  Example:  There are no tigers here.  I have a rock in my pocket.  Conclusion: My rock keeps tigers away.  Induction can lead you to invalid conclusions  So far in this class, we have only used deduction, which reasons from general truths to a specific conclusion

 Mathematical induction is special  First, we need a property P(n) that's defined for integers n  Then, we need to know that it's true for some specific P(a)  Then, we try to show that for all integers k  a, if P(k) is true, it must be the case that P(k+1) is true  If we do that, P(n) is true for all integers n  a  Why?

 To prove a statement of the following form:   n  Z, where n  a, property P(n) is true  Use the following steps: 1. Basis Step: Show that the property is true for P(a) 2. Induction Step: ▪ Suppose that the property is true for some n = k, where k  Z, k  a ▪ Now, show that, with that assumption, the property is also true for k + 1

 Prove that, for all integers n  8, n = 3a + 5b, where a,b are integers greater than or equal to zero  Hint: Use induction and cases  This is the example given in the book  Another way to write it is that any amount of change above 8 cents can be made using only 3 cent and 5 cent coins

 Prove that, for all integers n  1  Hint: Use induction

 Prove that, for all integers n  0  Hint: Use induction

 Geometric series  Strong induction  Examples

 Homework 3 is due next Monday  Keep reading Chapter 5