Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0

Similar documents
Math 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version]

Complete Solutions to Supplementary Exercises on Infinite Series

Generalized Fibonacci-Like Sequence and. Fibonacci Sequence

2.4 - Sequences and Series

Generating Functions and Their Applications

#A18 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART I

distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k)

Binomial transform of products

SOLUTION SET VI FOR FALL [(n + 2)(n + 1)a n+2 a n 1 ]x n = 0,

Random Models. Tusheng Zhang. February 14, 2013

Math 475, Problem Set #12: Answers

Bernoulli Polynomials Talks given at LSBU, October and November 2015 Tony Forbes

Math 2112 Solutions Assignment 5

Sequences, Sums, and Products

6.4 Binomial Coefficients

Course : Algebraic Combinatorics

Mathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis

Recurrence Relations

q-fibonacci polynomials and q-catalan numbers Johann Cigler [ ] (4) I don t know who has observed this well-known fact for the first time.

1 Generating functions for balls in boxes

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)

Benaissa Bernoussi Université Abdelmalek Essaadi, ENSAT de Tanger, B.P. 416, Tanger, Morocco

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

GAMALIEL CERDA-MORALES 1. Blanco Viel 596, Valparaíso, Chile. s: /

Abstract. 1. Introduction This note is a supplement to part I ([4]). Let. F x (1.1) x n (1.2) Then the moments L x are the Catalan numbers

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Assignment Number 3 Solutions

Zeros of Polynomials

Solution of Linear Constant-Coefficient Difference Equations

Chapter 2. Asymptotic Notation

Some remarks on the paper Some elementary inequalities of G. Bennett

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

#A51 INTEGERS 14 (2014) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES

On the Fibonacci-like Sequences of Higher Order

x !1! + 1!2!

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS

Tutorial F n F n 1

BINOMIAL COEFFICIENT HARMONIC SUM IDENTITIES ASSOCIATED TO SUPERCONGRUENCES

Generating Functions II

Bernoulli Numbers and a New Binomial Transform Identity

SOME TRIBONACCI IDENTITIES

arxiv: v2 [math.co] 27 Jun 2016

Automated Proofs for Some Stirling Number Identities

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z

Generating Functions. 1 Operations on generating functions

FACTORS OF SUMS OF POWERS OF BINOMIAL COEFFICIENTS. Dedicated to the memory of Paul Erdős. 1. Introduction. n k. f n,a =

Math 140A Elementary Analysis Homework Questions 1

CHAPTER 1 SEQUENCES AND INFINITE SERIES

Hoggatt and King [lo] defined a complete sequence of natural numbers

Discrete Mathematics: Lectures 8 and 9 Principle of Inclusion and Exclusion Instructor: Arijit Bishnu Date: August 11 and 13, 2009

Different kinds of Mathematical Induction

THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

Matrix representations of Fibonacci-like sequences

Math 155 (Lecture 3)

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Exam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False.

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

ON SOME GAUSSIAN PELL AND PELL-LUCAS NUMBERS

GENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California

MATH 304: MIDTERM EXAM SOLUTIONS

arxiv: v1 [math.fa] 3 Apr 2016

Math 203A, Solution Set 8.

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

Chapter 4. Fourier Series

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

1. By using truth tables prove that, for all statements P and Q, the statement

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

Bertrand s postulate Chapter 2

Solutions to Final Exam

Supplementary Material

GENERALIZED LEGENDRE POLYNOMIALS AND RELATED SUPERCONGRUENCES

( ) GENERATING FUNCTIONS

Sequences of Definite Integrals, Factorials and Double Factorials

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

On forward improvement iteration for stopping problems

Roger Apéry's proof that zeta(3) is irrational

Chapter 6. Advanced Counting Techniques

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca

Bernoulli Number Identities via Euler-Maclaurin Summation

Definition An infinite sequence of numbers is an ordered set of real numbers.

Regent College Maths Department. Further Pure 1. Proof by Induction

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun

SOME DOUBLE BINOMIAL SUMS RELATED WITH THE FIBONACCI, PELL AND GENERALIZED ORDER-k FIBONACCI NUMBERS

REVIEW 1, MATH n=1 is convergent. (b) Determine whether a n is convergent.

INMO-2018 problems and solutions

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

On the Jacobsthal-Lucas Numbers by Matrix Method 1

Research Article Sums of Products of Cauchy Numbers, Including Poly-Cauchy Numbers

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

On Generalized Fibonacci Numbers

ADVANCED PROBLEMS AND SOLUTIONS

MATH2007* Partial Answers to Review Exercises Fall 2004

Transcription:

GENERATING FUNCTIONS Give a ifiite sequece a 0,a,a,, its ordiary geeratig fuctio is A : a Geeratig fuctios are ofte useful for fidig a closed forula for the eleets of a sequece, fidig a recurrece forula, fidig averages or other statistical properties of a sequece, fidig asyptotic properties of a sequece, or provig idetities Proble Cosider the sequece a for N defied by the recurrece a + a + for > 0 ad the iitial coditio a 0 0 Fid a closed forula for a? Rear Oe could guess the forula ad the prove it by iductio Solutio Let A a The give recurrece relatio gives a + a + ad a + A + A a 0 a + a + A A A To fid a eplicit forula for a, we epad A as a power series; A so we coclude that a for N >0 >0, Proble Cosider the sequece a for N defied by the recurrece a + a + for > 0 ad the iitial coditio a 0 Solutio Let A a The give recurrece relatio gives A a 0 a + a + A A + A a + A + + + To fid a eplicit forula for a, we first deterie a partial fractio decopositio A + α + β + γ Sice α + β + γ +, we have : α α : γ + γ 0: + β + β 0 MATH 40 : 07 page 46 of 5

Hece, epadig A as a power series produces A + + so we coclude that a + for N + + +, Propositio Fiboacci Geeratig Fuctio If F deotes the th Fiboacci uber, for N, ad F : F, the we have F Proof The Fiboacci recurrece relatio, with the iitial coditios F 0 0 ad F, give F F 0 F F + F + + F F F 0 + F F F F Proble Usig ordiary geeratig series, fid a closed forula for the Fiboacci ubers Solutio We first deterie a partial fractio decopositio for the Fiboacci geeratig fuctio By settig ϕ ± : ± 5, it follows that ϕ + ϕ ad F Sice α ϕ + β ϕ +, we have ϕ + : α ϕ ϕ+ ϕ : β α ϕ + + β ϕ ϕ + α ϕ + ϕ+ ϕ + ϕ 5, ϕ + ϕ ϕ β ϕ ϕ ϕ ϕ + 5 Hece, epadig A as a power series produces F 5 ϕ + 5 ϕ ϕ + ϕ 5 ϕ+ ϕ so we coclude that F + 5 5 + 5 5 for N Proble If F is the th Fiboacci uber, the show that F 0 + F + F + + F F + Solutio Sice F F, the left side of the equatio is F 0 + F + F + + F F, ad the right side is F + F F 0 F MATH 40 : 07 page 47 of 5

IDENTITIES FROM GENERATING SERIES Proble For N, prove that F + F 3 + F 5 + + F + F + Solutio Recall that F F Sice we have F F F F F + + F +, the geeratig fuctio for the left side is F + F 3 + + F + + + F F + + + + + + + Siilarly, we have F + F fuctio for the right side is F + + + + F + F + + + + F + F F, so the geeratig + + + + + By etractig the coefficiets of or +, we establish the idetity o Fiboacci ubers Alterative Proof Sice we have F + F + + 3 3 + 4 3 + 4 + 3 + 4, etractig eve ad odd powers shows F Hece, the geeratig fuctio for the left side is 3 + ad F + F + F 3 + + F + 3 + 3 +, 3 + ad the geeratig fuctio for the right side is F + 3 + 3 + Proble* For N, prove that F + F 4 + F 5 + + F F + MATH 40 : 07 page 48 of 5

Solutio The geeratig fuctio for the left side is F 0 + F + + F 3 +, ad the geeratig fuctio for the right side is F + 3 + + 3 3 + 3 + Propositio Catala Geeratig Fuctio If C deotes the th Catala uber, for N, ad C : C, the we have C 4 Proof Sice C 0 ad the Catala Recurrece is C + C C 0 0 C C, we obtai C + C C C 0 C ± 4 C + 0 C Sice 4 +, we have + 4 + + + 4 + +, so C 4 Corollary We have C! +! +! + + Proof Sice the geeralized bioial theore ad the absorptio idetity establish that 4 4 / 4 + 4 + + 4! + + 4! + 4 3 we obtai C 4!! + + + MATH 40 : 07 page 49 of 5

GENERATING FUNCTION WITH TWO VARIABLES Propositio Bioial Geeratig Fuctio For all N, we have + N Proof For N, set P : N The bioial coefficiets could be defied by the additive forula + for all > 0 ad all > 0, ad the iitial coditios 0 ad 0 0 for > 0 Hece, for > 0, we obtai [ ] P 0 >0 + P + P >0 0 P + P, ad P 0 It follows that P + for all N Proble Absorptio Forula Prove that usig ordiary geeratig fuctios Solutio Etractig the coefficiet of fro both sides of the equatio + + N + N N establishes the absorptio idetity Proble Trioial Revisio Reprove the idetity Solutio Etractig the coefficiet of y fro both sides of the equatio y N + y + + y + + y N + + y + y N y N N proves the trioial revisio idetity + Proble Upper Su For N, reprove the idetity 0 + + Solutio Differetig the geoetric series ties gives +, ad ultiplyig are reideig the su yields + Hece, the geeratig fuctio for the left side is 0 + ad the geeratig + + + 0 fuctio for the right side is + + + + MATH 40 : 07 page 50 of 5

Proble Parallel Su Reprove the idetity Solutio Sice the equatio 0 + + establishes the parallel su idetity + + + + 0, etractig the coefficiet of fro both sides of + + Propositio Multichoose Geeratig Fuctio For all N, we have ++ + ++, N Proof For N, set M : N The ultichoose coefficiets could be defied by the additive forula + for all > 0 ad all > 0, ad the iitial coditios 0 ad 0 0 for > 0 Hece, for > 0, we obtai M N + M + M N M M, ad M 0 It follows that M for all N + Proble Relatio to Bioial Coefficiets Reprove the idetity + Solutio Etract the coefficiets of fro + Proble Absorptio Reprove the idetity Solutio Etract the coefficiet of fro both sides of the equatio + N + N + Proble Parallel Su Reprove the idetity 0 Solutio Etract the coefficiet of fro both sides of the equatio + + N N + N 0 +, MATH 40 : 07 page 5 of 5