Worksheet 1. Difference

Size: px
Start display at page:

Download "Worksheet 1. Difference"

Transcription

1 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 table: n 0, n k (n + )(n + )... (n + k). Sequence u n c Difference u n n n n n k n n k c n

2 Worksheet Indefinite Sums Remember: To evaluate the sum: n u n we search for a sequence U such that 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 table: n 0, n k (n + )(n + )... (n + k). Sequence u n c Sum n u n n n n k n n k c n

3 Worksheet Definite Sums Remember the fundamental theorem of sum calculus (the method of differences): If u r U r then b+ u r U r U b+ U a ra a Evaluate the following sums using the fundamental theorem of sum calculus. When possible use the table of indefinite sums of Worksheet Hint: Define and use Pascal s rule: (r + ) r0 ra ra U r ( ) r + k c r ( r ) k ( ) r k ( ) r k r0 r0 r0 r r r k ( ) r + k

4 Worksheet 4 Sums of powers Remember, we used: r k r0 to compute the sum of squares this way: r r0 (r + r ) r0 (n + ) + (n + )k+ k + (n + ) (n + )n(n ) + (n + )n. Using this technique compute the sum of cubes: r? r0 n(n + )(n + ) 6 Hint: start writing r in terms of powers and then write r in terms of falling factorial powers.

5 Worksheet 5 Sum by parts Remember, the sum by parts formula for definite sums is: u r v r u b+ v b+ u a v a v r+ u r ra ra. Evaluate this sum by parts: r r r0

6 Worksheet 6 Linear difference equations with constant coefficients Remember: Assume u n m n and m 0. If the auxiliary equation has distinct roots α and β then the general solution is: u n Aα n + Bβ n. If the roots are the same, α, then the general solution is: u n (An + B)α n.. Find the general solution of this difference equation: u n+ 6u n+ 8u n. Solve this difference equation: u n+ 8u n+ 5u n, u 0, u 8. Find a closed formula for this constant-recursive sequence: u n+ 4u n+ 4u n, u 0, u 6 4. Solve this recurrence relation: u n+ u n+ + u n, u 0 0, u

7 Answers - 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 table: n 0, n k (n + )(n + )... (n + k). Sequence Difference u n u n c 0 n n n + n n n k kn k n n n k kn k c n c n (c )

8 Answers - Worksheet Indefinite Sums Remember, to evaluate the sum: we search for a sequence U such that u n U n. Please complete the following table: n u n Sequence u n c Sum n cn u n n n n n n k n k+ k + n Harmonic number H n the discrete version of ln(x) r, r x r dr n k n k+ k + c n c n c

9 Answers - Worksheet Definite sums Remember the fundamental theorem of sum calculus (the method of differences): If u r U r then b+ u r U r U b+ U a ra a Evaluate the following sums using the fundamental theorem of sum calculus. When possible use the table of indefinite sums of Worksheet... (r + ) r0 We need to find U r such that U r r + : U r r U r (r + ) r r + (r + ) r n+ (n + ) 0 (n + ) r0 U r 0 ra c r cr c U r cr+ c b+ c r cr c ra a cr c cr cb+ c a c. ra ( ) r k ra ( ) r U r k ( r + U r k ( ) r k ) b+ a ( r ) k ( ) ( ) r r k k ( ) ( ) b + a k k (Pascal s rule)

10 4. r0 r 5. U r r U r r n+ r r r0 0 (n + ) (n + ) r0 r 0 6. U r r U r r n+ r r r0 0 (n + ) (n + ) r0 r k 0 U r rk+ k + U r r k n+ r k rk+ k + r0 0 (n + )k+ k + (n + )k+ k + 0k+ k + 4

11 Answers - Worksheet 4 Sums of powers Remember, we used: r k r0 to compute the sum of squares this way: r r0 (r + r ) r0 (n + ) + (n + )k+ k + (n + ) (n + )n(n ) + (n + )n. Using this technique compute the sum of cubes: r? r0 n(n + )(n + ) 6 Hint: start writing r in terms of powers and then write r in terms of falling factorial powers. r r(r )(r ) r r + r r r + r r r + (r + r ) r r r + r + r r r0 (r + r + r ) r0 (n + )4 4 + (n + ) + (n + ) (n + )n(n )(n ) (n + )n(n ) (n + )n + + ( 4 ) ( ) n n + (n + )n + 4n 4 + n + n (n + )n n (n + ) 4 5

12 Worksheet 5 Sum by parts Remember, the sum by parts formula for definite sums is: u r v r u b+ v b+ u a v a v r+ u r ra ra. Evaluate this sum by parts: r r r0 r0 We let u r r and v r r, then u r, v r r and: r r (n + ) n+ 0 0 r+ (n + ) n+ r0 r r0 (n + ) n+ ( n+ ) (n ) n+ + 6

13 Answers - Worksheet 6 Linear difference equations with constant coefficients. Find the general solution of this difference equation: u n+ 6u n+ 8u n Assuming u n m n and n 0, we get: m n+ 6m n+ 8m n m 6m (m )(m 4) 0 α, β 4 u n A n + B 4 n (Auxiliary equation) (General solution). Solve this difference equation: u n+ 8u n+ 5u n, u 0, u 8 Assuming u n m n and n 0, we get: m n+ 8m n+ 5m n m 8m (m )(m 5) 0 α, β 5 u n A n + B 5 n (Auxiliary equation) (General solution) A + B (u 0 ) A + 5B 8 (u 8) A, B u n n + 5 n. Find a closed formula for this constant-recursive sequence: u n+ 4u n+ 4u n, u 0, u 6 m 4m (Auxiliary equation) (m ) 0 α (Repeated root) u n (An + B) n (General solution) (A0 + B) 0 (u 0 ) (A + B) 6 (u 6) A, B u n (n + ) n 7

14 4. Solve this recurrence relation: u n+ u n+ + u n, u 0 0, u Assuming u n m n and n 0, we get: m n+ m n+ + m n m m + (Auxiliary equation) α + 5, β 5 (Golden ratio and its conjugate) ( ) n ( ) n u n A + B (General solution) A + B 0 (u 0 0) A B 5 A B 5 A, B 5 5 u n ( ) n + 5 ( (u ) This closed-form expression for the Fibonacci sequence is known as Binet s formula. ) n 8

1 Examples of Weak Induction

1 Examples of Weak Induction More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of

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

AQR Unit 4: Using Recursion in Models and Decision Making Sequence Notes. Name: Date: Sequences

AQR Unit 4: Using Recursion in Models and Decision Making Sequence Notes. Name: Date: Sequences Name: Date: Sequences A number sequence is a set of numbers, usually separated by commas, arranged in an order. The first term is referred to as t 1, the second term as t 2, the third term as t 3 and so

More information

MCS 256 Discrete Calculus and Probability Exam 5: Final Examination 22 May 2007

MCS 256 Discrete Calculus and Probability Exam 5: Final Examination 22 May 2007 MCS 256 Discrete Calculus and Probability SOLUTIONS Exam 5: Final Examination 22 May 2007 Instructions: This is a closed-book examination. You may, however, use one 8.5 -by-11 page of notes, your note

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

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

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

LINEAR RECURSIVE SEQUENCES. The numbers in the sequence are called its terms. The general form of a sequence is

LINEAR RECURSIVE SEQUENCES. The numbers in the sequence are called its terms. The general form of a sequence is LINEAR RECURSIVE SEQUENCES BJORN POONEN 1. Sequences A sequence is an infinite list of numbers, like 1) 1, 2, 4, 8, 16, 32,.... The numbers in the sequence are called its terms. The general form of a sequence

More information

Recurrence Relations and Recursion: MATH 180

Recurrence Relations and Recursion: MATH 180 Recurrence Relations and Recursion: MATH 180 1: Recursively Defined Sequences Example 1: The sequence a 1,a 2,a 3,... can be defined recursively as follows: (1) For all integers k 2, a k = a k 1 + 1 (2)

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

Worksheet Week 1 Review of Chapter 5, from Definition of integral to Substitution method

Worksheet Week 1 Review of Chapter 5, from Definition of integral to Substitution method Worksheet Week Review of Chapter 5, from Definition of integral to Substitution method This worksheet is for improvement of your mathematical writing skill. Writing using correct mathematical expressions

More information

{ 0! = 1 n! = n(n 1)!, n 1. n! =

{ 0! = 1 n! = n(n 1)!, n 1. n! = Summations Question? What is the sum of the first 100 positive integers? Counting Question? In how many ways may the first three horses in a 10 horse race finish? Multiplication Principle: If an event

More information

A factor times a logarithm can be re-written as the argument of the logarithm raised to the power of that factor

A factor times a logarithm can be re-written as the argument of the logarithm raised to the power of that factor In this section we will be working with Properties of Logarithms in an attempt to take equations with more than one logarithm and condense them down into just a single logarithm. Properties of Logarithms:

More information

On Continued Fractions, Fibonacci Numbers and Electrical Networks

On Continued Fractions, Fibonacci Numbers and Electrical Networks 03 Hawaii University International Conferences Education & Technology Math & Engineering Technology June 0 th to June th Ala Moana Hotel, Honolulu, Hawaii On Continued Fractions, Fibonacci Numbers Electrical

More information

CALCULUS: Math 21C, Fall 2010 Final Exam: Solutions. 1. [25 pts] Do the following series converge or diverge? State clearly which test you use.

CALCULUS: Math 21C, Fall 2010 Final Exam: Solutions. 1. [25 pts] Do the following series converge or diverge? State clearly which test you use. CALCULUS: Math 2C, Fall 200 Final Exam: Solutions. [25 pts] Do the following series converge or diverge? State clearly which test you use. (a) (d) n(n + ) ( ) cos n n= n= (e) (b) n= n= [ cos ( ) n n (c)

More information

Chapter 5: Integrals

Chapter 5: Integrals Chapter 5: Integrals Section 5.3 The Fundamental Theorem of Calculus Sec. 5.3: The Fundamental Theorem of Calculus Fundamental Theorem of Calculus: Sec. 5.3: The Fundamental Theorem of Calculus Fundamental

More information

5. Sequences & Recursion

5. Sequences & Recursion 5. Sequences & Recursion Terence Sim 1 / 42 A mathematician, like a painter or poet, is a maker of patterns. Reading Sections 5.1 5.4, 5.6 5.8 of Epp. Section 2.10 of Campbell. Godfrey Harold Hardy, 1877

More information

Applications. More Counting Problems. Complexity of Algorithms

Applications. More Counting Problems. Complexity of Algorithms Recurrences Applications More Counting Problems Complexity of Algorithms Part I Recurrences and Binomial Coefficients Paths in a Triangle P(0, 0) P(1, 0) P(1,1) P(2, 0) P(2,1) P(2, 2) P(3, 0) P(3,1) P(3,

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

ON THE SUM OF POWERS OF TWO. 1. Introduction

ON THE SUM OF POWERS OF TWO. 1. Introduction t m Mathematical Publications DOI: 0.55/tmmp-06-008 Tatra Mt. Math. Publ. 67 (06, 4 46 ON THE SUM OF POWERS OF TWO k-fibonacci NUMBERS WHICH BELONGS TO THE SEQUENCE OF k-lucas NUMBERS Pavel Trojovský ABSTRACT.

More information

Chapter 11 - Sequences and Series

Chapter 11 - Sequences and Series Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a

More information

Advanced Counting Techniques. 7.1 Recurrence Relations

Advanced Counting Techniques. 7.1 Recurrence Relations Chapter 7 Advanced Counting Techniques 71 Recurrence Relations We have seen that a recursive definition of a sequence specifies one or more initial terms and a rule for determining subsequent terms from

More information

Discrete Calculus and its Applications

Discrete Calculus and its Applications Discrete Calculus and its Applications Alexander Payne March 9, 2014 1 Introduction In these notes, we will introduce the foundations of discrete calculus (a.k.a. the calculus of finite differences) as

More information

Algorithms: Background

Algorithms: Background Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.

More information

Chapter 3. Second Order Linear PDEs

Chapter 3. Second Order Linear PDEs Chapter 3. Second Order Linear PDEs 3.1 Introduction The general class of second order linear PDEs are of the form: ax, y)u xx + bx, y)u xy + cx, y)u yy + dx, y)u x + ex, y)u y + f x, y)u = gx, y). 3.1)

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

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

Complex Practice Exam 1

Complex Practice Exam 1 Complex Practice Exam This practice exam contains sample questions. The actual exam will have fewer questions, and may contain questions not listed here.. Be prepared to explain the following concepts,

More information

Math 141: Lecture 19

Math 141: Lecture 19 Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,

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

Exponential Functions:

Exponential Functions: Exponential Functions: An exponential function has the form f (x) = b x where b is a fixed positive number, called the base. Math 101-Calculus 1 (Sklensky) In-Class Work January 29, 2015 1 / 12 Exponential

More information

A Probabilistic View of Certain Weighted Fibonacci Sums

A Probabilistic View of Certain Weighted Fibonacci Sums Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 8-1-2003 A Probabilistic View of Certain Weighted Fibonacci Sums Arthur T. Benjamin Harvey Mudd

More information

The solutions to the two examples above are the same.

The solutions to the two examples above are the same. One-to-one correspondences A function f : A B is one-to-one if f(x) = f(y) implies that x = y. A function f : A B is onto if for any element b in B there is an element a in A such that f(a) = b. A function

More information

The Method of Frobenius

The Method of Frobenius The Method of Frobenius Department of Mathematics IIT Guwahati If either p(x) or q(x) in y + p(x)y + q(x)y = 0 is not analytic near x 0, power series solutions valid near x 0 may or may not exist. If either

More information

FROBENIUS SERIES SOLUTIONS

FROBENIUS SERIES SOLUTIONS FROBENIUS SERIES SOLUTIONS TSOGTGEREL GANTUMUR Abstract. We introduce the Frobenius series method to solve second order linear equations, and illustrate it by concrete examples. Contents. Regular singular

More information

HONORS PRE-CALCULAUS ACP Summer Math Packet

HONORS PRE-CALCULAUS ACP Summer Math Packet Name Date Section HONORS PRE-CALCULAUS ACP Summer Math Packet For all incoming Honors Pre-Calculus ACP students, the summer math packet will be on the school website. Students will need to print a cop

More information

The Method of Frobenius

The Method of Frobenius The Method of Frobenius R. C. Trinity University Partial Differential Equations April 7, 2015 Motivating example Failure of the power series method Consider the ODE 2xy +y +y = 0. In standard form this

More information

Math 0230 Calculus 2 Lectures

Math 0230 Calculus 2 Lectures Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a

More information

1 Solving Linear Recurrences

1 Solving Linear Recurrences Solving Linear Recurrences Suppose we have a sequence a n defined by the formula The first couple terms of the sequence are a n = 3a n +, a 0 =, 4, 3, 40, 2,... Can you find a general closed for expression

More information

Problem Solving in Math (Math 43900) Fall 2013

Problem Solving in Math (Math 43900) Fall 2013 Problem Solving in Math (Math 43900) Fall 203 Week six (October ) problems recurrences Instructor: David Galvin Definition of a recurrence relation We met recurrences in the induction hand-out. Sometimes

More information

cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska

cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 9a CHAPTER 2 SUMS Part 1: Introduction - Lecture 5 Part 2: Sums and Recurrences (1) - Lecture 5 Part 2: Sums and Recurrences (2)

More information

Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)

Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002) SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of

More information

Section 11.1: Sequences

Section 11.1: Sequences Section 11.1: Sequences In this section, we shall study something of which is conceptually simple mathematically, but has far reaching results in so many different areas of mathematics - sequences. 1.

More information

Fall /16/2013

Fall /16/2013 MA 37 - Calculus I for the Life Sciences FINAL EXAM Fall 3 /6/3 Name: Sect. #: Answer all of the following questions. Use the backs of the question papers for scratch paper. No books or notes may be used.

More information

Logic and Discrete Mathematics. Section 6.7 Recurrence Relations and Their Solution

Logic and Discrete Mathematics. Section 6.7 Recurrence Relations and Their Solution Logic and Discrete Mathematics Section 6.7 Recurrence Relations and Their Solution Slides version: January 2015 Definition A recurrence relation for a sequence a 0, a 1, a 2,... is a formula giving a n

More information

1 Recursive Algorithms

1 Recursive Algorithms 400 lecture note #8 [ 5.6-5.8] Recurrence Relations 1 Recursive Algorithms A recursive algorithm is an algorithm which invokes itself. A recursive algorithm looks at a problem backward -- the solution

More information

A DIFFERENCE EQUATION INVOLVING FIBONACCI NUMBERS. Ezio Marchi. IMA Preprint Series #2471. (March 2016)

A DIFFERENCE EQUATION INVOLVING FIBONACCI NUMBERS. Ezio Marchi. IMA Preprint Series #2471. (March 2016) A DIFFERENCE EQUATION INVOLVING FIBONACCI NUMBERS By Ezio Marchi IMA Preprint Series #2471 (March 2016) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS UNIVERSITY OF MINNESOTA 400 Lind Hall 207 Church Street

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

Introduction Derivation General formula List of series Convergence Applications Test SERIES 4 INU0114/514 (MATHS 1)

Introduction Derivation General formula List of series Convergence Applications Test SERIES 4 INU0114/514 (MATHS 1) MACLAURIN SERIES SERIES 4 INU0114/514 (MATHS 1) Dr Adrian Jannetta MIMA CMath FRAS Maclaurin Series 1/ 21 Adrian Jannetta Recap: Binomial Series Recall that some functions can be rewritten as a power series

More information

Analysis of Algorithm Efficiency. Dr. Yingwu Zhu

Analysis of Algorithm Efficiency. Dr. Yingwu Zhu Analysis of Algorithm Efficiency Dr. Yingwu Zhu Measure Algorithm Efficiency Time efficiency How fast the algorithm runs; amount of time required to accomplish the task Our focus! Space efficiency Amount

More information

6.2 SOLVING EASY RECURRENCES

6.2 SOLVING EASY RECURRENCES Section 6.2 Solving Easy Recurrences 6.2.1 6.2 SOLVING EASY RECURRENCES We identify a type of recurrence that can be solved by special methods. def: A recurrence relation a n = f(a 0,..., a n 1 ) has degree

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

Sequences and the Binomial Theorem

Sequences and the Binomial Theorem Chapter 9 Sequences and the Binomial Theorem 9. Sequences When we first introduced a function as a special type of relation in Section.3, we did not put any restrictions on the domain of the function.

More information

Supplemental Worksheet Problems To Accompany: The Algebra 2 Tutor Section 13 Fractional Exponents

Supplemental Worksheet Problems To Accompany: The Algebra 2 Tutor Section 13 Fractional Exponents Section Fractional Eponents Supplemental Worksheet Problems To Accompany: The Algebra 2 Tutor Section Fractional Eponents Please watch Section of this DVD before working these problems. The DVD is located

More information

A Library of Functions

A Library of Functions LibraryofFunctions.nb 1 A Library of Functions Any study of calculus must start with the study of functions. Functions are fundamental to mathematics. In its everyday use the word function conveys to us

More information

Troy High School AP Calculus Summer Packet

Troy High School AP Calculus Summer Packet Troy High School AP Calculus Summer Packet As instructors of AP Calculus, we have etremely high epectations of students taking our courses. We epect a certain level of independence to be demonstrated by

More information

Fibonacci and k Lucas Sequences as Series of Fractions

Fibonacci and k Lucas Sequences as Series of Fractions DOI: 0.545/mjis.06.4009 Fibonacci and k Lucas Sequences as Series of Fractions A. D. GODASE AND M. B. DHAKNE V. P. College, Vaijapur, Maharashtra, India Dr. B. A. M. University, Aurangabad, Maharashtra,

More information

Sequences and Series. Copyright Cengage Learning. All rights reserved.

Sequences and Series. Copyright Cengage Learning. All rights reserved. Sequences and Series Copyright Cengage Learning. All rights reserved. 12.1 Sequences and Summation Notation Copyright Cengage Learning. All rights reserved. Objectives Sequences Recursively Defined Sequences

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

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

MAS114: Exercises. October 26, 2018

MAS114: Exercises. October 26, 2018 MAS114: Exercises October 26, 2018 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.

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

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

On Some Combinations of Non-Consecutive Terms of a Recurrence Sequence

On Some Combinations of Non-Consecutive Terms of a Recurrence Sequence 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.3.5 On Some Combinations of Non-Consecutive Terms of a Recurrence Sequence Eva Trojovská Department of Mathematics Faculty of Science

More information

Infinite Series Summary

Infinite Series Summary Infinite Series Summary () Special series to remember: Geometric series ar n Here a is the first term and r is the common ratio. When r

More information

Mathematical Fundamentals

Mathematical Fundamentals Mathematical Fundamentals Sets Factorials, Logarithms Recursion Summations, Recurrences Proof Techniques: By Contradiction, Induction Estimation Techniques Data Structures 1 Mathematical Fundamentals Sets

More information

cse547, math547 DISCRETE MATHEMATICS Short Review for Final

cse547, math547 DISCRETE MATHEMATICS Short Review for Final cse547, math547 DISCRETE MATHEMATICS Short Review for Final Professor Anita Wasilewska Spring 2017 CHAPTER 2 PART 5: INFINITE SUMS (SERIES) Infinite Series D Must Know STATEMENTS- do not need Theorems

More information

Extended Binet s formula for the class of generalized Fibonacci sequences

Extended Binet s formula for the class of generalized Fibonacci sequences [VNSGU JOURNAL OF SCIENCE AND TECHNOLOGY] Vol4 No 1, July, 2015 205-210,ISSN : 0975-5446 Extended Binet s formula for the class of generalized Fibonacci sequences DIWAN Daksha M Department of Mathematics,

More information

Computational Complexity - Pseudocode and Recursions

Computational Complexity - Pseudocode and Recursions Computational Complexity - Pseudocode and Recursions Nicholas Mainardi 1 Dipartimento di Elettronica e Informazione Politecnico di Milano nicholas.mainardi@polimi.it June 6, 2018 1 Partly Based on Alessandro

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

Generating functions What were they again?

Generating functions What were they again? Generating functions What were they again? Maarten Pennings 007 May 0 bstract Two decades ago, I followed some courses on discrete mathematics. One of the topics that has always intriged me was generating

More information

Spring /11/2009

Spring /11/2009 MA 123 Elementary Calculus SECOND MIDTERM Spring 2009 03/11/2009 Name: Sec.: Do not remove this answer page you will return the whole exam. You will be allowed two hours to complete this test. No books

More information

ASSIGNMENT 12 PROBLEM 4

ASSIGNMENT 12 PROBLEM 4 ASSIGNMENT PROBLEM 4 Generate a Fibonnaci sequence in the first column using f 0 =, f 0 =, = f n f n a. Construct the ratio of each pair of adjacent terms in the Fibonnaci sequence. What happens as n increases?

More information

AP Calculus Chapter 9: Infinite Series

AP Calculus Chapter 9: Infinite Series AP Calculus Chapter 9: Infinite Series 9. Sequences a, a 2, a 3, a 4, a 5,... Sequence: A function whose domain is the set of positive integers n = 2 3 4 a n = a a 2 a 3 a 4 terms of the sequence Begin

More information

On arithmetic functions of balancing and Lucas-balancing numbers

On arithmetic functions of balancing and Lucas-balancing numbers MATHEMATICAL COMMUNICATIONS 77 Math. Commun. 24(2019), 77 1 On arithmetic functions of balancing and Lucas-balancing numbers Utkal Keshari Dutta and Prasanta Kumar Ray Department of Mathematics, Sambalpur

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

Solutions to Exercises 4

Solutions to Exercises 4 Discrete Mathematics Lent 29 MA2 Solutions to Eercises 4 () Define sequence (b n ) n by b n ( n n..., where we use n ) for > n. Verify that b, b 2 2, and that, for every n 3, we have b n b n b n 2. Solution.

More information

Solving Recurrence Relations 1. Guess and Math Induction Example: Find the solution for a n = 2a n 1 + 1, a 0 = 0 We can try finding each a n : a 0 =

Solving Recurrence Relations 1. Guess and Math Induction Example: Find the solution for a n = 2a n 1 + 1, a 0 = 0 We can try finding each a n : a 0 = Solving Recurrence Relations 1. Guess and Math Induction Example: Find the solution for a n = 2a n 1 + 1, a 0 = 0 We can try finding each a n : a 0 = 0 a 1 = 2 0 + 1 = 1 a 2 = 2 1 + 1 = 3 a 3 = 2 3 + 1

More information

Pre-Calculus Notes Section 12.2 Evaluating Limits DAY ONE: Lets look at finding the following limits using the calculator and algebraically.

Pre-Calculus Notes Section 12.2 Evaluating Limits DAY ONE: Lets look at finding the following limits using the calculator and algebraically. Pre-Calculus Notes Name Section. Evaluating Limits DAY ONE: Lets look at finding the following its using the calculator and algebraicall. 4 E. ) 4 QUESTION: As the values get closer to 4, what are the

More information

16. . Proceeding similarly, we get a 2 = 52 1 = , a 3 = 53 1 = and a 4 = 54 1 = 125

16. . Proceeding similarly, we get a 2 = 52 1 = , a 3 = 53 1 = and a 4 = 54 1 = 125 . Sequences When we first introduced a function as a special type of relation in Section.3, we did not put any restrictions on the domain of the function. All we said was that the set of x-coordinates

More information

Partition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example

Partition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x

More information

Recursion. Algorithms and Data Structures. (c) Marcin Sydow. Introduction. Linear 2nd-order Equations. Important 3 Cases. Quicksort Average Complexity

Recursion. Algorithms and Data Structures. (c) Marcin Sydow. Introduction. Linear 2nd-order Equations. Important 3 Cases. Quicksort Average Complexity Recursion Topics covered by this lecture: Recursion: Fibonacci numbers, Hanoi Towers,... cases of recursive equations (with proofs) QuickSort (Proof) Recursion e.g.: n! = (n 1)!n Mathematics: recurrent

More information

McGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60

McGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60 McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction

More information

Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006

Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006 Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18

More information

Calculus of Finite Differences. Andreas Klappenecker

Calculus of Finite Differences. Andreas Klappenecker Calculus of Finite Differences Andreas Klappenecker Motivation When we analyze the runtime of algorithms, we simply count the number of operations. For example, the following loop for k = 1 to n do square(k);

More information

M152: Calculus II Midterm Exam Review

M152: Calculus II Midterm Exam Review M52: Calculus II Midterm Exam Review Chapter 4. 4.2 : Mean Value Theorem. - Know the statement and idea of Mean Value Theorem. - Know how to find values of c making the theorem true. - Realize the importance

More information

The Fibonacci Quilt Sequence

The Fibonacci Quilt Sequence The Sequence Minerva Catral, Pari Ford*, Pamela Harris, Steven J. Miller, Dawn Nelson AMS Section Meeting Georgetown University March 7, 2015 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 Fibonacci sequence Theorem (

More information

Some Interesting Properties and Extended Binet Formula for the Generalized Lucas Sequence

Some Interesting Properties and Extended Binet Formula for the Generalized Lucas Sequence Some Interesting Properties and Extended Binet Formula for the Generalized ucas Sequence Daksha Diwan, Devbhadra V Shah 2 Assistant Professor, Department of Mathematics, Government Engineering College,

More information

Unit Combinatorics State pigeonhole principle. If k pigeons are assigned to n pigeonholes and n < k then there is at least one pigeonhole containing more than one pigeons. Find the recurrence relation

More information

Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!

Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Steven J Miller, Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller CANT 2010, CUNY, May 29, 2010 Summary

More information

MCR3U Unit 7 Lesson Notes

MCR3U Unit 7 Lesson Notes 7.1 Arithmetic Sequences Sequence: An ordered list of numbers identified by a pattern or rule that may stop at some number or continue indefinitely. Ex. 1, 2, 4, 8,... Ex. 3, 7, 11, 15 Term (of a sequence):

More information

Data Structure Lecture#4: Mathematical Preliminaries U Kang Seoul National University

Data Structure Lecture#4: Mathematical Preliminaries U Kang Seoul National University Data Structure Lecture#4: Mathematical Preliminaries U Kang Seoul National University U Kang 1 In This Lecture Set concepts and notation Logarithms Summations Recurrence Relations Recursion Induction Proofs

More information

APPENDIX B GRAM-SCHMIDT PROCEDURE OF ORTHOGONALIZATION. Let V be a finite dimensional inner product space spanned by basis vector functions

APPENDIX B GRAM-SCHMIDT PROCEDURE OF ORTHOGONALIZATION. Let V be a finite dimensional inner product space spanned by basis vector functions 301 APPENDIX B GRAM-SCHMIDT PROCEDURE OF ORTHOGONALIZATION Let V be a finite dimensional inner product space spanned by basis vector functions {w 1, w 2,, w n }. According to the Gram-Schmidt Process an

More information

L Hopital s Rule. We will use our knowledge of derivatives in order to evaluate limits that produce indeterminate forms.

L Hopital s Rule. We will use our knowledge of derivatives in order to evaluate limits that produce indeterminate forms. L Hopital s Rule We will use our knowledge of derivatives in order to evaluate its that produce indeterminate forms. Main Idea x c f x g x If, when taking the it as x c, you get an INDETERMINATE FORM..

More information

ON AN EXTENSION OF FIBONACCI SEQUENCE

ON AN EXTENSION OF FIBONACCI SEQUENCE Bulletin of the Marathwada Mathematical Society Vol.7, No., June 06, Pages 8. ON AN EXTENSION OF FIBONACCI SEQUENCE S. Arolkar Department of Mathematics, D.M. s College and Research Centre, Assagao, Bardez,

More information

F.3 Special Factoring and a General Strategy of Factoring

F.3 Special Factoring and a General Strategy of Factoring F.3 Special Factoring and a General Strategy of Factoring Difference of Squares section F4 233 Recall that in Section P2, we considered formulas that provide a shortcut for finding special products, such

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

MATH 6B Spring 2017 Vector Calculus II Study Guide Final Exam Chapters 8, 9, and Sections 11.1, 11.2, 11.7, 12.2, 12.3.

MATH 6B Spring 2017 Vector Calculus II Study Guide Final Exam Chapters 8, 9, and Sections 11.1, 11.2, 11.7, 12.2, 12.3. MATH 6B pring 2017 Vector Calculus II tudy Guide Final Exam Chapters 8, 9, and ections 11.1, 11.2, 11.7, 12.2, 12.3. Before starting with the summary of the main concepts covered in the quarter, here there

More information

Several Generating Functions for Second-Order Recurrence Sequences

Several Generating Functions for Second-Order Recurrence Sequences 47 6 Journal of Integer Sequences, Vol. 009), Article 09..7 Several Generating Functions for Second-Order Recurrence Sequences István Mező Institute of Mathematics University of Debrecen Hungary imezo@math.lte.hu

More information

L Hopital s Rule. We will use our knowledge of derivatives in order to evaluate limits that produce indeterminate forms.

L Hopital s Rule. We will use our knowledge of derivatives in order to evaluate limits that produce indeterminate forms. L Hopital s Rule We will use our knowledge of derivatives in order to evaluate its that produce indeterminate forms. Indeterminate Limits Main Idea x c f x g x If, when taking the it as x c, you get an

More information