Number Puzzles and Sequences

Size: px
Start display at page:

Download "Number Puzzles and Sequences"

Transcription

1 Number Puzzles and Sequences Reading: EC 1.2 Peter J. Haas INFO 150 Fall Semester 2018 Lecture 2 1/ 16

2 Overview and Examples Guess the Next Number Sequences and Sequence Notation Discovering Patterns in Sequences Sums Lecture 2 2/ 16

3 Guess the Next Number ?? ?? ?? ?? ?? Why do we care? I Training for recursive thinking in a simple setting I Used later when learning how to write proofs I Diagnosing time and space complexity of computations I At each time step each process spawns two more processes I Each sampling step removes 2/3 oftheitemsandadds10moreitems I The nth pass through the data has to process n rows of the table Lecture 2 3/ 16

4 Guess the Next Number ?? ?? ?? ?? ?? Strategy: Look for Patterns I Relate each term to previous terms (arithmetic formula) I Describe in terms of position in sequence I Recognize the set of integers from the examples Lecture 2 4/ 16

5 Patterns Example I Describe the sequence each of the three ways Solution I Relate each term to previous terms Each term is 2 were than the previous first term I I Describe in terms of position in sequence term nth term = 2h I I Recognize the set of integers from the examples Theodd numbers Istarting from D Lecture 2 5/ 16

6 . term 1st More Patterns (Exercise) Problem: For the sequence I Describe it each of the three ways (recursive indexbased recognitionbased) each term is L more than pnev. term is 4 nth term ant 2 even numbers Hati ) starting at 4 I If current term is 898 give next three terms I What is the 1000th term? (Which description is most helpful?) 2002 Lecture 2 6/ 16

7 Sequences and Sequence Notation Recursive Formula Each term is described in relation to previous terms via a recurrence relation Closed Formula Each term is described in terms of its position in the sequence Sequence Notation Sequence name is a lowercase letter (a b...)andasubscript gives position in sequence: a n =nthterminsequencea Example I a = I a 1 = 1 a 2 = 3 a 5 =9 (it s like a function; subscript = ordinal number) I Closed formula: a n =2n 1(forn 1) I Recursive formula: a 1 =1anda n = a n 1 +2(forn 2) Lecture 2 7/ 16

8 Examples For the sequence a n =2 n 1: I Write the first 5 terms: I Value of 10th term: a 10 = I 023 I Formula for (k + 1)st term: I Formula for b i = a 2i 3 Apg : For the sequence a n = a n 1 i i. : In 9= : I a Write the first 5 terms: a 1 da a = It t5 5= I Recursive formula for 80th term: a 80 t = 5 = I = Recursive formula for (k + 1)st term: Anti Ack its Ak +5 " I Recursive formula for a 2j 3 : Gj z Gaj g. t 5 Ajay is Lecture 2 8/ 16

9 . l Discovering Patterns in Sequences Give Recursive and closed formulas: in :* ?? I Papania an=p ?? 8h tninttnn 3. 1 T.it#oWFanaganbnt3=2nt3f " aebntdn.it ?? S O ) " ?? an 2am 9=2 " factorial ?? an I =1 quz.gazez.si same n I recursive inat!g: An " I ' Nan (1) look for di erences and quotients how fast do the numbers grow? (2) compare to simple series with same recurrence 1dL above diet see examples n! Ain Lecture 2 9/ 16 blind "

10 ARockstarSequence:FibonacciNumbers The Sequence The recurrence relation F 1 = F 2 =1andF n = F n 1 + F n 2 for n 3 The closed formula (Binet s formula) F n = 1 p 5 1+ p 5 2! n 1 2 p! n! 5 Applications include (see Fibonacci Quarterly): 1. Fibonacci search Fibonacci heaps 2. Biology and more (leaf/petal patterns tree branching...) Lecture 2 10/ 16

11 D it '... Sh ' Closed Formulas from Recursive Formulas (Can be Hard) Example 1 I a 1 =2anda n =3a n 1 I Compare to simpler sequence b n =3 n I Or write out terms without simplifying a eh Aj 23 93? ". TILNEY bn s anirgbn 35ns. = 2^3 Example 2 I s 1 =1ands n = s n 1 + n It 2+3 Get Si H2 = ' I tht th Sn = I t 2 t. Sme n t F i = t ( n.. t I N month Sn NY Lecture 2 11/ 16 z

12 Recursive Formulas from Closed Formulas (Much Easier) Example 1: Finding a recursive formula I a n =3n +5 I Compute some terms and stare at them (or try algebra) than an _ am e8 Example 2: Verifying a recursive formula I a n =3 n I Show that a n =3a n Amit 4=313 " " 14= ) I 3h 2 = An Lecture 2 12/ 16

13 Exploiting Knowledge About a Sequence Example 1 I a 1 = 11 and a n = a n 1 +5 I a 213 =1071 I What is a 214? An e =2076 Example 2 I a n =2 n 1 I Sum of first 19 terms is I What is the sum of the first 20 terms? [Hint: = ] = It I Lecture 2 13/ 16

14 Sums Notation for sums nx a k = a 1 + a a n = sum of first n terms of sequence a k=1 Extended notation for sums nx a k = a m + a m a n k=m Example: Evaluate the sums " 3X 3X I (2k 1): dg.mn?almei1t3t5 I k 2 : k=1 5=9 k=3 " 4X 3X 4 intention I 3 j 1 : 1+3+9*27481 I k(k + 1) : It son sin j=0 = ht It's 7534 k=1 Lecture 2 14/ 16

15 Aw Sums: More Examples : Notation for sums nx a k = a 1 + a 2 n + + a n = sum of first n terms of sequence a k=1 Examples :. me I Sum of first 10 numbers in sequence a k =1/k with k 1 anew I I I ( 4) + ( 1) Ah t3 Kil Lecture 2 15/ 16

16 Stability of Sequences Example Give the first 4 terms of a n =3a n 1 6with I a 1 = 2: I a 1 = 4: I a 1 = 3: Get =4 6 age I 0 az = 93 AE 3 as = =22 dye 30 04=3 aye a n a n = 0.9 a n a 1 = 1 a 1 = 30 a 1 = n Lecture 2 16/ 16

8. Sequences, Series, and Probability 8.1. SEQUENCES AND SERIES

8. Sequences, Series, and Probability 8.1. SEQUENCES AND SERIES 8. Sequences, Series, and Probability 8.1. SEQUENCES AND SERIES What You Should Learn Use sequence notation to write the terms of sequences. Use factorial notation. Use summation notation to write sums.

More information

9.1 SEQUENCES AND SERIES

9.1 SEQUENCES AND SERIES 640 Chapter 9 Sequences, Series, and Probability 9. SEQUENCES AND SERIES What you should learn Use sequence notation to write the terms of sequences. Use factorial notation. Use summation notation to write

More information

Math Circle: Recursion and Induction

Math Circle: Recursion and Induction Math Circle: Recursion and Induction Prof. Wickerhauser 1 Recursion What can we compute, using only simple formulas and rules that everyone can understand? 1. Let us use N to denote the set of counting

More information

Discrete Structures Lecture Sequences and Summations

Discrete Structures Lecture Sequences and Summations Introduction Good morning. In this section we study sequences. A sequence is an ordered list of elements. Sequences are important to computing because of the iterative nature of computer programs. The

More information

The Fibonacci Sequence

The Fibonacci Sequence Elvis Numbers Elvis the Elf skips up a flight of numbered stairs, starting at step 1 and going up one or two steps with each leap Along with an illustrious name, Elvis parents have endowed him with an

More information

Sequences and Series. College Algebra

Sequences and Series. College Algebra Sequences and Series College Algebra Sequences A sequence is a function whose domain is the set of positive integers. A finite sequence is a sequence whose domain consists of only the first n positive

More information

Quiz 3 Reminder and Midterm Results

Quiz 3 Reminder and Midterm Results Quiz 3 Reminder and Midterm Results Reminder: Quiz 3 will be in the first 15 minutes of Monday s class. You can use any resources you have during the quiz. It covers all four sections of Unit 3. It has

More information

Chapter 5: Sequences, Mathematic Induction, and Recursion

Chapter 5: Sequences, Mathematic Induction, and Recursion Chapter 5: Sequences, Mathematic Induction, and Recursion Hao Zheng Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 Email: zheng@cse.usf.edu Phone: (813)974-4757

More information

Ex. Here's another one. We want to prove that the sum of the cubes of the first n natural numbers is. n = n 2 (n+1) 2 /4.

Ex. Here's another one. We want to prove that the sum of the cubes of the first n natural numbers is. n = n 2 (n+1) 2 /4. Lecture One type of mathematical proof that goes everywhere is mathematical induction (tb 147). Induction is essentially used to show something is true for all iterations, i, of a sequence, where i N.

More information

CMSC250 Homework 9 Due: Wednesday, December 3, Question: Total Points: Score:

CMSC250 Homework 9 Due: Wednesday, December 3, Question: Total Points: Score: Name & UID: Circle Your Section! 0101 (10am: 3120, Ladan) 0102 (11am: 3120, Ladan) 0103 (Noon: 3120, Peter) 0201 (2pm: 3120, Yi) 0202 (10am: 1121, Vikas) 0203 (11am: 1121, Vikas) 0204 (9am: 2117, Karthik)

More information

Algorithm Analysis Recurrence Relation. Chung-Ang University, Jaesung Lee

Algorithm Analysis Recurrence Relation. Chung-Ang University, Jaesung Lee Algorithm Analysis Recurrence Relation Chung-Ang University, Jaesung Lee Recursion 2 Recursion 3 Recursion in Real-world Fibonacci sequence = + Initial conditions: = 0 and = 1. = + = + = + 0, 1, 1, 2,

More information

Binomial Coefficient Identities/Complements

Binomial Coefficient Identities/Complements Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology

More information

4. Linear transformations as a vector space 17

4. Linear transformations as a vector space 17 4 Linear transformations as a vector space 17 d) 1 2 0 0 1 2 0 0 1 0 0 0 1 2 3 4 32 Let a linear transformation in R 2 be the reflection in the line = x 2 Find its matrix 33 For each linear transformation

More information

Chapter 8: Recursion. March 10, 2008

Chapter 8: Recursion. March 10, 2008 Chapter 8: Recursion March 10, 2008 Outline 1 8.1 Recursively Defined Sequences 2 8.2 Solving Recurrence Relations by Iteration 3 8.4 General Recursive Definitions Recursively Defined Sequences As mentioned

More information

Definition: A sequence is a function from a subset of the integers (usually either the set

Definition: A sequence is a function from a subset of the integers (usually either the set Math 3336 Section 2.4 Sequences and Summations Sequences Geometric Progression Arithmetic Progression Recurrence Relation Fibonacci Sequence Summations Definition: A sequence is a function from a subset

More information

Discrete Mathematics. Spring 2017

Discrete Mathematics. Spring 2017 Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: Rule of Inference Mathematical Induction: Conjecturing and Proving Mathematical Induction:

More information

Lecture 10: Powers of Matrices, Difference Equations

Lecture 10: Powers of Matrices, Difference Equations Lecture 10: Powers of Matrices, Difference Equations Difference Equations A difference equation, also sometimes called a recurrence equation is an equation that defines a sequence recursively, i.e. each

More information

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

1.1.1 Algebraic Operations

1.1.1 Algebraic Operations 1.1.1 Algebraic Operations We need to learn how our basic algebraic operations interact. When confronted with many operations, we follow the order of operations: Parentheses Exponentials Multiplication

More information

Playing with Numbers. introduction. numbers in general FOrM. remarks (i) The number ab does not mean a b. (ii) The number abc does not mean a b c.

Playing with Numbers. introduction. numbers in general FOrM. remarks (i) The number ab does not mean a b. (ii) The number abc does not mean a b c. 5 Playing with Numbers introduction In earlier classes, you have learnt about natural numbers, whole numbers, integers and their properties. In this chapter, we shall understand 2-digit and 3-digit numbers

More information

Section 4.1: Sequences and Series

Section 4.1: Sequences and Series Section 4.1: Sequences and Series In this section, we shall introduce the idea of sequences and series as a necessary tool to develop the proof technique called mathematical induction. Most of the material

More information

3.3 Accumulation Sequences

3.3 Accumulation Sequences 3.3. ACCUMULATION SEQUENCES 25 3.3 Accumulation Sequences Overview. One of the most important mathematical ideas in calculus is that of an accumulation of change for physical quantities. As we have been

More information

z-transforms 21.1 The z-transform Basics of z-transform Theory z-transforms and Difference Equations 36

z-transforms 21.1 The z-transform Basics of z-transform Theory z-transforms and Difference Equations 36 Contents 21 z-transforms 21.1 The z-transform 2 21.2 Basics of z-transform Theory 12 21.3 z-transforms and Difference Equations 36 21.4 Engineering Applications of z-transforms 64 21.5 Sampled Functions

More information

Chapter12. Relations, Functions, and Induction

Chapter12. Relations, Functions, and Induction . Relations. Functions. Seuences.4 Mathematical Induction.5 Recurrence Relations Chapter Review Chapter Relations, Functions, and Induction In this chapter we introduce the concepts of a relation and a

More information

Lecture 17: Trees and Merge Sort 10:00 AM, Oct 15, 2018

Lecture 17: Trees and Merge Sort 10:00 AM, Oct 15, 2018 CS17 Integrated Introduction to Computer Science Klein Contents Lecture 17: Trees and Merge Sort 10:00 AM, Oct 15, 2018 1 Tree definitions 1 2 Analysis of mergesort using a binary tree 1 3 Analysis of

More information

Power series and Taylor series

Power series and Taylor series Power series and Taylor series D. DeTurck University of Pennsylvania March 29, 2018 D. DeTurck Math 104 002 2018A: Series 1 / 42 Series First... a review of what we have done so far: 1 We examined series

More information

CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction. Linda Shapiro Spring 2016

CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction. Linda Shapiro Spring 2016 CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction Linda Shapiro Spring 2016 Background on Induction Type of mathematical proof Typically used to establish a given statement for all natural

More information

The Euclidean Algorithm and Multiplicative Inverses

The Euclidean Algorithm and Multiplicative Inverses 1 The Euclidean Algorithm and Multiplicative Inverses Lecture notes for Access 2009 The Euclidean Algorithm is a set of instructions for finding the greatest common divisor of any two positive integers.

More information

21.3. z-transforms and Difference Equations. Introduction. Prerequisites. Learning Outcomes

21.3. z-transforms and Difference Equations. Introduction. Prerequisites. Learning Outcomes -Transforms and Difference Equations 1.3 Introduction In this we apply -transforms to the solution of certain types of difference equation. We shall see that this is done by turning the difference equation

More information

Conjectures and proof. Book page 24-30

Conjectures and proof. Book page 24-30 Conjectures and proof Book page 24-30 What is a conjecture? A conjecture is used to describe a pattern in mathematical terms When a conjecture has been proved, it becomes a theorem There are many types

More information

Recurrence Relations

Recurrence Relations Recurrence Relations Recurrence Relations Reading (Epp s textbook) 5.6 5.8 1 Recurrence Relations A recurrence relation for a sequence aa 0, aa 1, aa 2, ({a n }) is a formula that relates each term a k

More information

Ex 12A The Inverse matrix

Ex 12A The Inverse matrix Chapter 12: Matrices II TOPIC The Inverse Matrix TEXT: Essential Further Mathematics DATE SET PAGE(S) WORK 421 Exercise 12A: Q1 4 Applying the Inverse Matrix: Solving Simultaneous Equations 428 Exercise

More information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 1028 M: Discrete Mathematics for Engineers EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 16 Sequences and

More information

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION One of the most important tasks of mathematics is to discover and characterize regular patterns, such as those associated with processes that

More information

Section Summary. Sequences. Recurrence Relations. Summations Special Integer Sequences (optional)

Section Summary. Sequences. Recurrence Relations. Summations Special Integer Sequences (optional) Section 2.4 Section Summary Sequences. o Examples: Geometric Progression, Arithmetic Progression Recurrence Relations o Example: Fibonacci Sequence Summations Special Integer Sequences (optional) Sequences

More information

Worksheet 1. Difference

Worksheet 1. Difference Worksheet Differences Remember: The difference of a sequence u n is: u n u n+ u n The falling factorial (power), n to the k falling, when k > 0, is: n k n(n )... (n k + ), Please complete the following

More information

Fall 2017 Test II review problems

Fall 2017 Test II review problems Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and

More information

7.2 Rational Exponents

7.2 Rational Exponents Section 7.2 Rational Exponents 49 7.2 Rational Exponents S Understand the Meaning of a /n. 2 Understand the Meaning of a m/n. 3 Understand the Meaning of a -m/n. 4 Use Rules for Exponents to Simplify Expressions

More information

Lecture 8 : Structural Induction DRAFT

Lecture 8 : Structural Induction DRAFT CS/Math 240: Introduction to Discrete Mathematics 2/15/2011 Lecture 8 : Structural Induction Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last week we discussed proofs by induction. We

More information

Functional Programming Laboratory 3

Functional Programming Laboratory 3 Functional Programming Laboratory 3 Define new functions, Recursion Isabela Drămnesc March 12, 2014 1 Concepts Bound and free variables Recursive functions Simple and double recursion 2 Questions from

More information

MAS221 Analysis Semester Chapter 2 problems

MAS221 Analysis Semester Chapter 2 problems MAS221 Analysis Semester 1 2018-19 Chapter 2 problems 20. Consider the sequence (a n ), with general term a n = 1 + 3. Can you n guess the limit l of this sequence? (a) Verify that your guess is plausible

More information

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/ SECTION 5.6 Defining Sequences Recursively Copyright Cengage Learning. All rights reserved.

More information

Examples of Finite Sequences (finite terms) Examples of Infinite Sequences (infinite terms)

Examples of Finite Sequences (finite terms) Examples of Infinite Sequences (infinite terms) Math 120 Intermediate Algebra Sec 10.1: Sequences Defn A sequence is a function whose domain is the set of positive integers. The formula for the nth term of a sequence is called the general term. Examples

More information

CmSc 250 Intro to Algorithms. Mathematical Review. 1. Basic Algebra. (a + b) 2 = a 2 + 2ab + b 2 (a - b) 2 = a 2-2ab + b 2 a 2 - b 2 = (a + b)(a - b)

CmSc 250 Intro to Algorithms. Mathematical Review. 1. Basic Algebra. (a + b) 2 = a 2 + 2ab + b 2 (a - b) 2 = a 2-2ab + b 2 a 2 - b 2 = (a + b)(a - b) CmSc 250 Intro to Algorithms Mathematical Review 1. Basic Algebra (a + b) 2 = a 2 + 2ab + b 2 (a - b) 2 = a 2-2ab + b 2 a 2 - b 2 = (a + b)(a - b) a/x + b/y = (ay + bx)/xy 2. Exponents X n = XXX..X, n

More information

CSCE 222 Discrete Structures for Computing. Review for Exam 2. Dr. Hyunyoung Lee !!!

CSCE 222 Discrete Structures for Computing. Review for Exam 2. Dr. Hyunyoung Lee !!! CSCE 222 Discrete Structures for Computing Review for Exam 2 Dr. Hyunyoung Lee 1 Strategy for Exam Preparation - Start studying now (unless have already started) - Study class notes (lecture slides and

More information

CHAPTER 4 SOME METHODS OF PROOF

CHAPTER 4 SOME METHODS OF PROOF CHAPTER 4 SOME METHODS OF PROOF In all sciences, general theories usually arise from a number of observations. In the experimental sciences, the validity of the theories can only be tested by carefully

More information

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

Section Summary. Sequences. Recurrence Relations. Summations. Examples: Geometric Progression, Arithmetic Progression. Example: Fibonacci Sequence Section 2.4 Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations Introduction Sequences are ordered lists of elements.

More information

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24 Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using

More information

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers. MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

PUTNAM TRAINING MATHEMATICAL INDUCTION. Exercises

PUTNAM TRAINING MATHEMATICAL INDUCTION. Exercises PUTNAM TRAINING MATHEMATICAL INDUCTION (Last updated: December 11, 017) Remark. This is a list of exercises on mathematical induction. Miguel A. Lerma 1. Prove that n! > n for all n 4. Exercises. Prove

More information

Sequences of Real Numbers

Sequences of Real Numbers Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next

More information

Chapter 8. Sequences, Series, and Probability. Selected Applications

Chapter 8. Sequences, Series, and Probability. Selected Applications Chapter 8 Sequences, Series, and Probability 8. Sequences and Series 8.2 Arithmetic Sequences and Partial Sums 8.3 Geometric Sequences and Series 8.4 Mathematical Induction 8.5 The Binomial Theorem 8.6

More information

Fibonacci and Lucas Identities the Golden Way

Fibonacci and Lucas Identities the Golden Way Fibonacci Lucas Identities the Golden Way Kunle Adegoe adegoe00@gmail.com arxiv:1810.12115v1 [math.nt] 25 Oct 2018 Department of Physics Engineering Physics, Obafemi Awolowo University, 220005 Ile-Ife,

More information

Problem Set 5 Solutions

Problem Set 5 Solutions Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true

More information

DIFFERENTIATION RULES

DIFFERENTIATION RULES 3 DIFFERENTIATION RULES DIFFERENTIATION RULES 3. The Product and Quotient Rules In this section, we will learn about: Formulas that enable us to differentiate new functions formed from old functions by

More information

Example. The sequence defined by the function. a : Z 0 Ñ Q defined by n fiñ 1{n

Example. The sequence defined by the function. a : Z 0 Ñ Q defined by n fiñ 1{n Sequences A sequence is a function a from a subset of the set of integers (usually Z 0 or Z 0 )toasets, a : Z 0 Ñ S or a : Z 0 Ñ S. We write a n apnq, andcalla n the nth term of the sequence. Example The

More information

Page references correspond to locations of Extra Examples icons in the textbook.

Page references correspond to locations of Extra Examples icons in the textbook. Rosen, Discrete Mathematics and Its Applications, 7th edition Extra Examples Section 8. Recurrence Relations Page references correspond to locations of Extra Examples icons in the textbook. p.50, icon

More information

Part III, Sequences and Series CS131 Mathematics for Computer Scientists II Note 16 RECURRENCES

Part III, Sequences and Series CS131 Mathematics for Computer Scientists II Note 16 RECURRENCES CS131 Part III, Sequences and Series CS131 Mathematics for Computer Scientists II Note 16 RECURRENCES A recurrence is a rule which defines each term of a sequence using the preceding terms. The Fibonacci

More information

Every subset of {1, 2,...,n 1} can be extended to a subset of {1, 2, 3,...,n} by either adding or not adding the element n.

Every subset of {1, 2,...,n 1} can be extended to a subset of {1, 2, 3,...,n} by either adding or not adding the element n. 11 Recurrences A recurrence equation or recurrence counts things using recursion. 11.1 Recurrence Equations We start with an example. Example 11.1. Find a recurrence for S(n), the number of subsets of

More information

Outline. We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction

Outline. We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction Outline We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction Induction P(1) ( n 2)[P(n 1) P(n)] ( n 1)[P(n)] Why Does This Work? I P(1) ( n 2)[P(n

More information

On the generating matrices of the k-fibonacci numbers

On the generating matrices of the k-fibonacci numbers Proyecciones Journal of Mathematics Vol. 3, N o 4, pp. 347-357, December 013. Universidad Católica del Norte Antofagasta - Chile On the generating matrices of the k-fibonacci numbers Sergio Falcon Universidad

More information

Recurrences COMP 215

Recurrences COMP 215 Recurrences COMP 215 Analysis of Iterative Algorithms //return the location of the item matching x, or 0 if //no such item is found. index SequentialSearch(keytype[] S, in, keytype x) { index location

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS

More information

An Arithmetic Sequence can be defined recursively as. a 1 is the first term and d is the common difference where a 1 and d are real numbers.

An Arithmetic Sequence can be defined recursively as. a 1 is the first term and d is the common difference where a 1 and d are real numbers. Section 12 2A: Arithmetic Sequences An arithmetic sequence is a sequence that has a constant ( labeled d ) added to the first term to get the second term and that same constant is then added to the second

More information

2.3 Solving Equations Containing Fractions and Decimals

2.3 Solving Equations Containing Fractions and Decimals 2. Solving Equations Containing Fractions and Decimals Objectives In this section, you will learn to: To successfully complete this section, you need to understand: Solve equations containing fractions

More information

MA441: Algebraic Structures I. Lecture 18

MA441: Algebraic Structures I. Lecture 18 MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :

More information

2.3.6 Exercises NS-3. Q 1.1: What condition(s) must hold for p and q such that a, b, and c are always positive 10 and nonzero?

2.3.6 Exercises NS-3. Q 1.1: What condition(s) must hold for p and q such that a, b, and c are always positive 10 and nonzero? .3. LECTURE 4: (WEEK 3) APPLICATIONS OF PRIME NUMBER 67.3.6 Exercises NS-3 Topic of this homework: Pythagorean triples, Pell s equation, Fibonacci sequence Deliverable: Answers to problems 5 Pythagorean

More information

The given pattern continues. Write down the nth term of the sequence {an} suggested by the pattern. 3) 4, 10, 16, 22, 28,... 3)

The given pattern continues. Write down the nth term of the sequence {an} suggested by the pattern. 3) 4, 10, 16, 22, 28,... 3) M60(Precalculus) Evaluate the factorial expression. 9! ) 7!! ch practice test ) Write out the first five terms of the sequence. ) {sn} = (-)n - n + n - ) The given pattern continues. Write down the nth

More information

MATH10212 Linear Algebra B Homework Week 5

MATH10212 Linear Algebra B Homework Week 5 MATH Linear Algebra B Homework Week 5 Students are strongly advised to acquire a copy of the Textbook: D C Lay Linear Algebra its Applications Pearson 6 (or other editions) Normally homework assignments

More information

CSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee

CSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee CSCE 222 Discrete Structures for Computing Sequences and Summations Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sequences 2 Sequences A sequence is a function from a subset of the set of

More information

CHAPTER 3. Sequences. 1. Basic Properties

CHAPTER 3. Sequences. 1. Basic Properties CHAPTER 3 Sequences We begin our study of analysis with sequences. There are several reasons for starting here. First, sequences are the simplest way to introduce limits, the central idea of calculus.

More information

Sequences. 1. Number sequences. 2. Arithmetic sequences. Consider the illustrated pattern of circles:

Sequences. 1. Number sequences. 2. Arithmetic sequences. Consider the illustrated pattern of circles: Sequences 1. Number sequences Consider the illustrated pattern of circles: The first layer has just one blue ball. The second layer has three pink balls. The third layer has five black balls. The fourth

More information

8.4 PATTERNS, GUESSES, AND FORMULAS

8.4 PATTERNS, GUESSES, AND FORMULAS 8.4 Patterns, Guesses, and Formulas 46 Exercises 65 68 Express as a quotient of two integers in reduced form. 65. (a).4, (b).4 66. (a).45, (b).45 67. (a).5, (b).5 68. (a).7, (b).7 69. Evaluate the sum

More information

THE SUMMATION NOTATION Ʃ

THE SUMMATION NOTATION Ʃ THE SUMMATION NOTATION Ʃ Single Subscript Notation Most of the calculations we perform in statistics are repetitive operations on lists of numbers. For example, we compute the sum of a set of numbers,

More information

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer? Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

More information

FACTORIZATION AND THE PRIMES

FACTORIZATION AND THE PRIMES I FACTORIZATION AND THE PRIMES 1. The laws of arithmetic The object of the higher arithmetic is to discover and to establish general propositions concerning the natural numbers 1, 2, 3,... of ordinary

More information

Exercises. Template for Proofs by Mathematical Induction

Exercises. Template for Proofs by Mathematical Induction 5. Mathematical Induction 329 Template for Proofs by Mathematical Induction. Express the statement that is to be proved in the form for all n b, P (n) forafixed integer b. 2. Write out the words Basis

More information

2.3 Differentiation Formulas. Copyright Cengage Learning. All rights reserved.

2.3 Differentiation Formulas. Copyright Cengage Learning. All rights reserved. 2.3 Differentiation Formulas Copyright Cengage Learning. All rights reserved. Differentiation Formulas Let s start with the simplest of all functions, the constant function f (x) = c. The graph of this

More information

Chapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms

Chapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 1 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 2 Section 5.1 3 Section Summary Mathematical Induction Examples of

More information

ABSTRACT 1. INTRODUCTION

ABSTRACT 1. INTRODUCTION THE FIBONACCI NUMBER OF GENERALIZED PETERSEN GRAPHS Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria e-mail: wagner@finanz.math.tu-graz.ac.at

More information

CSC 344 Algorithms and Complexity. Proof by Mathematical Induction

CSC 344 Algorithms and Complexity. Proof by Mathematical Induction CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results

More information

Seunghee Ye Ma 8: Week 2 Oct 6

Seunghee Ye Ma 8: Week 2 Oct 6 Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means

More information

COM S 330 Lecture Notes Week of Feb 9 13

COM S 330 Lecture Notes Week of Feb 9 13 Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...

More information

Math 475, Problem Set #8: Answers

Math 475, Problem Set #8: Answers Math 475, Problem Set #8: Answers A. Brualdi, problem, parts (a), (b), and (d). (a): As n goes from to 6, the sum (call it h n ) takes on the values,, 8, 2, 55, and 44; we recognize these as Fibonacci

More information

Introduction to Induction (LAMC, 10/14/07)

Introduction to Induction (LAMC, 10/14/07) Introduction to Induction (LAMC, 10/14/07) Olga Radko October 1, 007 1 Definitions The Method of Mathematical Induction (MMI) is usually stated as one of the axioms of the natural numbers (so-called Peano

More information

Induction and Recursion

Induction and Recursion . All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Induction and Recursion

More information

Appendix G: Mathematical Induction

Appendix G: Mathematical Induction Appendix G: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

More information

Chapter 8 Sequences, Series, and Probability

Chapter 8 Sequences, Series, and Probability Chapter 8 Sequences, Series, and Probability Overview 8.1 Sequences and Series 8.2 Arithmetic Sequences and Partial Sums 8.3 Geometric Sequences and Partial Sums 8.5 The Binomial Theorem 8.6 Counting Principles

More information

Lecture 7: Indeterminate forms; L Hôpitals rule; Relative rates of growth. If we try to simply substitute x = 1 into the expression, we get

Lecture 7: Indeterminate forms; L Hôpitals rule; Relative rates of growth. If we try to simply substitute x = 1 into the expression, we get Lecture 7: Indeterminate forms; L Hôpitals rule; Relative rates of growth 1. Indeterminate Forms. Eample 1: Consider the it 1 1 1. If we try to simply substitute = 1 into the epression, we get. This is

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,

More information

Work sheet / Things to know. Chapter 3

Work sheet / Things to know. Chapter 3 MATH 251 Work sheet / Things to know 1. Second order linear differential equation Standard form: Chapter 3 What makes it homogeneous? We will, for the most part, work with equations with constant coefficients

More information

12 Sequences and Recurrences

12 Sequences and Recurrences 12 Sequences and Recurrences A sequence is just what you think it is. It is often given by a formula known as a recurrence equation. 12.1 Arithmetic and Geometric Progressions An arithmetic progression

More information

Learning Objectives

Learning Objectives Learning Objectives Learn about recurrence relations Learn the relationship between sequences and recurrence relations Explore how to solve recurrence relations by iteration Learn about linear homogeneous

More information

Chapter 3 ALGEBRA. Overview. Algebra. 3.1 Linear Equations and Applications 3.2 More Linear Equations 3.3 Equations with Exponents. Section 3.

Chapter 3 ALGEBRA. Overview. Algebra. 3.1 Linear Equations and Applications 3.2 More Linear Equations 3.3 Equations with Exponents. Section 3. 4 Chapter 3 ALGEBRA Overview Algebra 3.1 Linear Equations and Applications 3.2 More Linear Equations 3.3 Equations with Exponents 5 LinearEquations 3+ what = 7? If you have come through arithmetic, the

More information

Use mathematical induction in Exercises 3 17 to prove summation formulae. Be sure to identify where you use the inductive hypothesis.

Use mathematical induction in Exercises 3 17 to prove summation formulae. Be sure to identify where you use the inductive hypothesis. Exercises Exercises 1. There are infinitely many stations on a train route. Suppose that the train stops at the first station and suppose that if the train stops at a station, then it stops at the next

More information

Induction. Announcements. Overview. Defining Functions. Sum of Squares. Closed-form expression for SQ(n) There have been some corrections to A1

Induction. Announcements. Overview. Defining Functions. Sum of Squares. Closed-form expression for SQ(n) There have been some corrections to A1 Induction There have been some corrections to A1 Check the website and the newsgroup Announcements Upcoming topic: Recursion Lecture 3 CS 211 Fall 2005 Overview Recursion a programming strategy that solves

More information

Least Mean Squares Regression

Least Mean Squares Regression Least Mean Squares Regression Machine Learning Spring 2018 The slides are mainly from Vivek Srikumar 1 Lecture Overview Linear classifiers What functions do linear classifiers express? Least Squares Method

More information

After linear functions, the next simplest functions are polynomials. Examples are

After linear functions, the next simplest functions are polynomials. Examples are Mathematics 10 Fall 1999 Polynomials After linear functions, the next simplest functions are polynomials. Examples are 1+x, x +3x +, x 3. Here x is a variable. Recall that we have defined a function to

More information

DIFFERENTIATION RULES

DIFFERENTIATION RULES 3 DIFFERENTIATION RULES DIFFERENTIATION RULES 3.2 The Product and Quotient Rules In this section, we will learn about: Formulas that enable us to differentiate new functions formed from old functions by

More information

Lesson 5: Modeling from a Sequence

Lesson 5: Modeling from a Sequence Student Outcomes Students recognize when a table of values represents an arithmetic or geometric sequence. Patterns are present in tables of values. They choose and define the parameter values for a function

More information