Discrete Math (2) Haiming Chen Associate Professor, PhD

Slides:



Advertisements
Similar presentations
Week #10 – 28/30 October and 1 November 2002 Prof. Marie desJardins
Advertisements

CSE115/ENGR160 Discrete Mathematics 04/19/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 04/21/11 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 02/21/12
Recursion.
Chapter 7 Review. Simplify, no negative exponents.
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.
Geometric Sequences Section
Applied Discrete Mathematics Week 9: Relations
GPS – Sequences and Series  MA3A9. Students will use sequences and series  a. Use and find recursive and explicit formulae for the terms of sequences.
Sequences and Summations
13.2 Recursive Definitions Objective 1) Provide the recursive definition for sequences; 2) Identify the type of a sequence from a recursive definition.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Copyright © 2011 Pearson Education, Inc. Slide
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
Lecture#16 Discrete Mathematics. Recursion Now, 1 is an odd positive integer by the definition base. With k = 1, = 3, so 3 is an odd positive integer.
CSE 2813 Discrete Structures Recurrence Relations Section 6.1.
Sequences and Summations
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Today in Precalculus Notes: Sequences Homework Go over quiz.
Notes 9.4 – Sequences and Series. I. Sequences A.) A progression of numbers in a pattern. 1.) FINITE – A set number of terms 2.) INFINITE – Continues.
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,...
Review of Sequences and Series.  Find the explicit and recursive formulas for the sequence:  -4, 1, 6, 11, 16, ….
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
CompSci 102 Discrete Math for Computer Science January 31, 2012 Prof. Rodger Slides modified from Rosen AB a b c d x y z.
Sequences and Summations Section 2.4. Section Summary Sequences. – Examples: Geometric Progression, Arithmetic Progression Recurrence Relations – Example:
Functions Section 2.3. Section Summary Definition of a Function. – Domain, Cdomain – Image, Preimage Injection, Surjection, Bijection Inverse Function.
Algebra II Chapter : Use Recursive Rules with Sequences and Functions HW: p (4, 10, 14, 18, 20, 34)
22C:19 Discrete Math Advanced Counting Fall 2010 Sukumar Ghosh.
ADVANCED ALGORITHMS REVIEW OF ANALYSIS TECHNIQUES (UNIT-1)
Discrete Mathematics Lecture # 22 Recursion.  First of all instead of giving the definition of Recursion we give you an example, you already know the.
4.2B Geometric Explicit and Recursive Sequences
4.2A Arithmetic Explicit and Recursive Sequences
Review of Sequences and Series
Sequences and the Binomial Theorem Sequences Arithmetic Sequences Geometric Sequences & Series Binomial Theorem.
Sequences and Series Adaped from teacherweb.com. Introduction to Sequences and Series  Sequence – 1) an ordered list of numbers. 2) a function whose.
Section 2.4. Section Summary  Sequences. o Examples: Geometric Progression, Arithmetic Progression  Recurrence Relations o Example: Fibonacci Sequence.
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.
Lecture # 20 Sequence & Series
CSE15 Discrete Mathematics 03/01/17
CMSC Discrete Structures
Arithmetic and Geometric sequence and series
Applied Discrete Mathematics Week 11: Relations
Discrete Mathematics Lecture#14.
Patterns & Sequences Algebra I, 9/13/17.
Use mathematical induction to prove that the formula is true for all natural numbers m. {image} Choose the first step of the proof from the following:
Sequences and Summations
CS100: Discrete structures
7-8 Notes for Algebra 1 Recursive Formulas.
Sequences & Series.
ICS 253: Discrete Structures I
Discrete Math (2) Haiming Chen Associate Professor, PhD
Notes Over 11.5 Recursive Rules
Sets, Sequences, and Summations
CMSC Discrete Structures
Chapter 11: Further Topics in Algebra
Applied Discrete Mathematics Week 7: Computation
Chapter 11: Further Topics in Algebra
CMSC Discrete Structures
Geometric Sequences A geometric sequence is a list of numbers with a common ratio symbolized as r. This means that you can multiply by the same amount.
Recurrence Relations Discrete Structures.
Module 3 Arithmetic and Geometric Sequences
Mathematical Induction
Chapter 7 Advanced Counting Techniques
Recurrence Relations.
ICS 253: Discrete Structures I
Chapter 4 (Part 2): Mathematical Reasoning, Induction & Recursion
13.3 Arithmetic & Geometric Series
Presentation transcript:

Discrete Math (2) Haiming Chen Associate Professor, PhD Department of Computer Science, Ningbo University http://www.chenhaiming.cn

Data Structure & Algorithm Content Part I Logic and proofs Boolean Algebra Part II Sets, Functions, Sequences, and Matrices Relations Trees Graphs Algorithms Induction and Recursion Modeling Computation Part III Number Theory Discrete Probability Counting Advanced Counting Techniques Data Structure & Algorithm

Sequences A sequence is a function from a subset of the set of integers (usually either the set {0, 1, 2, . . .} or the set {1, 2, 3, . . .}) to a set S. We use the notation an to denote the image of the integer n. We call an a term of the sequence.

Geometric progression A geometric progression is a sequence of the form a, ar, ar2, . . . , arn, . . ., where the initial term a and the common ratio r are real numbers.

Examples {bn} with bn = (−1)n, {cn} with cn = 2 ・ 5n, {dn} with dn = 6 ・ (1/3)n

Arithmetic progression An arithmetic progression is a sequence of the form a, a + d, a + 2d, . . . , a + nd, . . .,where the initial term a and the common difference d are real numbers.

Examples {sn} with sn = −1 + 4n {tn} with tn = 7 − 3n

Recurrence Relations one or more initial terms a rule for determining subsequent terms from those that precede them Let {an} be a sequence that satisfies the recurrence relation an = an−1 − an−2 for n = 2, 3, 4, . . . , and suppose that a0 = 3 and a1 = 5.

Fibonacci sequence The Fibonacci sequence, f0, f1, f2, . . . , is defined by the initial conditions f0 = 0, f1 = 1, and the recurrence relation fn = fn−1 + fn−2, for n = 2, 3, 4, . . . . we find an explicit formula, called a closed formula, for the terms of the sequence. an = nan−1 is the sequence of integers defined by an = n!,

Recurrence Relations Compound Interest Suppose that a person deposits $10,000 in a savings account at a bank yielding 11% per year with interest compounded annually. How much will be in the account after 30 years? let Pn denote the amount in the account after n years Pn = Pn−1 + 0.11Pn−1 = (1.11)Pn−1 Pn = (1.11)Pn−1 = (1.11)nP0 closed formula

Special Integer Sequences Find formulae for the sequences with the following first five terms: (a) 1, 1/2, 1/4, 1/8, 1/16 (b) 1, 3, 5, 7, 9 (c) 1, −1, 1, −1, 1. How can we produce the terms of a sequence if the first 10 terms are 1, 2, 2, 3, 3, 3, 4, 4, 4, 4? Conjecture a simple formula for an if the first 10 terms of the sequence {an} are 1, 7, 25, 79, 241, 727, 2185, 6559, 19681, 59047

Summations Summation notation

Example

Final Exam On Jan.2, 2018 (Tuesday) From 15:00-17:00