THE DYING RABBIT PROBLEM. V. E. HOGGATT, JR., and D. A. LIIMD San Jose State College, San Jose, Calif., and University of Cambridge, England

Size: px
Start display at page:

Download "THE DYING RABBIT PROBLEM. V. E. HOGGATT, JR., and D. A. LIIMD San Jose State College, San Jose, Calif., and University of Cambridge, England"

Transcription

1 THE DYING RABBIT PROBLEM V. E. HOGGATT, JR., ad D. A. LIIMD Sa Jose State College, Sa Jose, Calif., ad Uiversity of Cambridge, Eglad 1. INTRODUCTION Fiboacci umbers origially arose i the aswer to the followig problem posed by Leoardo de Pisa i Suppose there is oe pair of rabbits i a eclosure at the 0 moth, ad that this pair breeds aother pair i each of the succeedig moths. Also suppose that pairs of rabbits breed i the secod moth followig birth, ad thereafter produce oe pair mothly. What is the umber of pairs of rabbits at the ed of the moth? It is ot diffi th cult to establish by J iductio that the aswer is F l 0 +2, where F is the Fiboacci umber. I [l] Brother Alfred asked for a solutio to this problem if, like Socrates, our rabbits are motral, say each pair dies oe year after birth. His aswer [2], however, cotaied a error. The mistake was oted by Coh [ 3], who also supplied the correct solutio. I this paper we geeralize the dyig rabbit problem to arbitrary breedig patters ad death times. 2. SOLUTION TO THE GENERALIZED DYING RABBIT PROBLEM Suppose that there is oe pair of rabbits at the 0 time poit, that this pair produces Bf pairs at the first time poit, B 2 pairs at the secod time poit, ad so forth, ad that each offsprig pair breeds i the same maer. We shall let B 0 = 0, ad put B(x) = B x 11 =0 so that B(x) is the birth polyomial associated with the birth sequece ( B j =0 The degree of B(x), deg B(x), may be fiite or ifiite. Now suppose a pair of rabbits dies at the m time poit after birth (after possible breedig), ad let D(x) = x be the associated death polyomial. If our rabbits are immortal, 482

2 Dec THE DYING RABBIT PROBLEM 483 put D(x) = 0. Clearly deg D(x) > 0 implies deg D(x) > deg B(x), uless the rabbits have strage matig habits. Let T be the total umber of live pairs of rabbits at the time poit, ad put T(x) = Tx 11 =0 where T 0 = 1. Our problem is the to determie T(x), where B(x) ad D(x) are kow. Let R be the umber of pairs of rabbits bor at the time poit assumig o deaths. With the covetio that the origial pair was bor at the 0 time poit, ad recallig that B 0 = 0, we have R 0-1, Rj := BQR^ + BJRQ, R 2 = B0R2 + B-^i + B 2 RQ ad i geeral that (1) R = B.R. ( > 1). po J "J Note that for = 0 this expressio yields the icorrect R 0 = 0. The if RW = E R x, =0 equatio (1) is equivalet to R(x) = R(x)B(x) + 1, so that

3 484 THE DYING RABBIT PROBLEM [Dec The total tota] umber T* of pairs at the give by time poit assumig o deaths is T* = Y, R., 3 ad we fid (2) (1 - x) [1 - B(x7) 1 - A k = Q *».l±±){i^) 00 / \ = E E H. x = D T x = T*(x) =0\j=0 7 =0 Hoggatt [4] used slightly differet methods to show both (1) ad (2). We must ow allow for deaths. Sice each pair dies m time poits afterbirth, the umber of deaths D at the time poit equals the umber of births R at the (-m) time poit. Therefore W =»«JV' = ^B=0 =0 Lettig the total umber of dead pairs of rabbits at the time poit be c = y\ D., -* 3 we have D(x) (1 - x) [1 ^=(lo*%fov Ho(N X " = E Cx 11 = C(x) =0

4 1969] THE DYING RABBIT PROBLEM 485 Now the total umber of live pairs of rabbits T at the time poit is T " C ' s o t h a t (3) T(x) = T*(x) - C(x) = T r ^ ^ L M _ 3. SOME PARTICULAR CASES To solve Brother Alfred f s problem, we put B(x) = x 2 + x x 12 ad D(x) = x 12 i (3) to give T(x) x x 12 X x (1 - x)(l - x 2 - x x 12 ) _ 1 - x l - x x + x 13 It follows that the sequece { T } obeys T 1-0 = T_ L T J _ T ( > 0), together with the iitial coditios T = F - for = 0, 1,, 11, ad T12 = F i3-1j which agrees with the aswer give by Coh [3]. As aother example of (3), suppose each pair produce a pair at each of the two time poits followig birth, ad the die at the m time poit after birth (m> 2). I this case, B(x) = x + x 2 ad D(x) = x. From (3), we see T(x) - -i JH l " x (1 - x)(l - x - x 2 ) Makig use of the geeratig fuctio t F +1 x, - v x - X- =0 we get

5 486 THE DYING RABBIT PROBLEM [Dec.., 1 + X + + X V^ X J T(x) = = 2^ 1 - x - x 2 3=0 1 - x - x 2 m - 1 /,. \ m-1 / \ / m - 1 \ (4) = E E F +1 x ^ = E E F k+1 )x + E E F k + 1 x 1 j=0 \ =0 X J =0 \ k=0 K + i K + / =m \ k=0 1 / m-1 = E ft (F +3 - Dx 11 - E (F +3 - F _ m+3 )x =0 =m For m = 4r it is kow [5] that F +3 F -4r+3 F 2r L -2r+3 ' where L is the Lucas umber, while for m = 4r + 2, F +3 " F -4r+l = L 2r+l F -2r+2 ' which may be used to further simplify (4). I particular, for m = 2, T(x) = 1 + 2x + E F + 2 x = E F + 2 x =0 =0 while for m = 4 we have T(x) = 1 + 2x + 4x 2 + 7x 3 + T L.x 11 ~, +1 =4 =0 ^ +l Thus for proper choices of B(x) ad D(x) we are able to get both Fiboacci ad Lucas umbers as the total populatio umbers. The secod-amed author was supported i part by the Udergraduate Research Participatio Program at the Uiversity of Sata Clara through NSF Grat GY-273.

6 ] THE DYING RABBIT PROBLEM 487 REFERENCES 1. Brother U. Alfred, "Explorig Fiboacci N u m b e r s, " Fiboacci Quarterly, 1 (1963), No. 1, Brother U. Alfred, "Dyig Rabbit P r o b l e m Revived," Fiboacci Quarterly, 1 (1963), No. 4, Joh H. E. Coh, " L e t t e r to the E d i t o r, " Fiboacci Quarterly, 2 (1964), V. E. Hoggatt, J r., " Geeralized Rabbits for Geeralized Fiboacci N u m- b e r s, " F i M a c i ^ Q u r ^ r ] ^, 6 (1968), No. 3, I. Dale Ruggles, "Some F i b o a c c i Results U s i g Fiboacci - Type Sequeces," Fiboacci Quarterly, 1 (1963), No. 2, [Cotiued from page 481. ] 3. J. H. E. Coh, "Square Fiboacci N u m b e r s, Etc., " Fiboacci Quarterly, 2 (1964), J. H. E. Coh, "O Square Fiboacci N u m b e r s, " Jour. LodoMath. Soc., 39 (1964), J. H. E. Coh, " Lucas ad Fiboacci N u m b e r s ad Some Diophatie Equatios, " El2 i^^^^im^ia^2 i' 7 (1965), Fikelstei, R. P., "O the Uits i a Quartic Field with Applicatios to MordelPs Equatio," Doctoral Dissertatio, Arizoa State Uiversity, O. H e m e r, "O the Diophatie Equatio y 2 - k = x 3, "Doctoral D i s s e r t a - tio, Uppsala, O. H e m e r, "O Some Diophatie Equatios of the Type y 2 - f 2 = x 3, " Math. Scad., 4 (1956), H. Lodo ad R. Fikelstei, "O MordelPs Equatio y 2 - k = x 3, " to appear. 10. H. Lodo ad R. Fikelstei, "O MordelPs Equatio y 2 - k = x 3 : II. The Case k < 0, " to be submitted. 11. C. Siegel, "Zum Beweise des Starksche S a t z e s, " Ivetioes Math., 5 (1968), *

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

Hoggatt and King [lo] defined a complete sequence of natural numbers REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies

More information

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E. WHITNEY Lock Have State College, Lock Have, Pesylvaia Sed all couicatios cocerig Advaced Probles ad Solutios to Rayod E. Whitey, Matheatics Departet,

More information

ELEMENTARY PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS ELEMENTARY PROBLEMS AND SOLUTIONS Edited by A. P. HILLMAN Uiversity of Sata Clara, Sata Clara, Califoria Sed a l l c o m m u i c a t i o s r e g a r d i g E l e m e t a r y P r o b l e m s a d S o l u

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces

More information

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.

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. 0. Sequeces A sequece is a list of umbers writte i a defiite order: a, a,, a, a is called the first term, a is the secod term, ad i geeral eclusively with ifiite sequeces ad so each term Notatio: the sequece

More information

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

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS BROTHER ALFRED BROUSSEAU St. Mary's College, Califoria Give a secod-order liear recursio relatio (.1) T. 1 = a T + b T 1,

More information

1 Generating functions for balls in boxes

1 Generating functions for balls in boxes Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways

More information

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

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)

More information

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYIVIOWDE. WHITNEY Lock Have State College, Lock Have, Pesylvaia Sed all commuicatios cocerig Advaced Problems ad Solutios to Eaymod E D Whitey, Mathematics Departmet,

More information

Math 132, Fall 2009 Exam 2: Solutions

Math 132, Fall 2009 Exam 2: Solutions Math 3, Fall 009 Exam : Solutios () a) ( poits) Determie for which positive real umbers p, is the followig improper itegral coverget, ad for which it is diverget. Evaluate the itegral for each value of

More information

CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS

CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS J. W. LAYMAN Virgiia Polytechic Istitute State Uiversity, Blacksburg, Virgiia Numerous writers appear to have bee fasciated by the may iterestig summatio idetitites

More information

MATH 31B: MIDTERM 2 REVIEW

MATH 31B: MIDTERM 2 REVIEW MATH 3B: MIDTERM REVIEW JOE HUGHES. Evaluate x (x ) (x 3).. Partial Fractios Solutio: The umerator has degree less tha the deomiator, so we ca use partial fractios. Write x (x ) (x 3) = A x + A (x ) +

More information

ELEMENTARY PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS ELEMENTARY PROBLEMS AND SOLUTIONS Edited by A. P. H1LLMASM Uiversity of Mew Mexico, Albuquerque, New Mexico Sed all commuicatios regardig Elemetary Problems ad Solutios to Professor A. P. Hillma, Departmet

More information

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

More information

1/(1 -x n ) = \YJ k=0

1/(1 -x n ) = \YJ k=0 ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E.WHITNEY Lock Have State College, Lock Have, Pesylvaia Sed all commuicatios cocerig Advaced Problems ad Solutios to Eaymod E. Whitey, Mathematics Departmet,

More information

Fibonacci numbers and orthogonal polynomials

Fibonacci numbers and orthogonal polynomials Fiboacci umbers ad orthogoal polyomials Christia Berg April 10, 2006 Abstract We prove that the sequece (1/F +2 0 of reciprocals of the Fiboacci umbers is a momet sequece of a certai discrete probability,

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

arxiv: v1 [math.fa] 3 Apr 2016

arxiv: v1 [math.fa] 3 Apr 2016 Aticommutator Norm Formula for Proectio Operators arxiv:164.699v1 math.fa] 3 Apr 16 Sam Walters Uiversity of Norther British Columbia ABSTRACT. We prove that for ay two proectio operators f, g o Hilbert

More information

Math 2412 Review 3(answers) kt

Math 2412 Review 3(answers) kt Math 4 Review 3(aswers) kt A t A e. If the half-life of radium is 690 years, ad you have 0 grams ow, how much will be preset i 50 years (rouded to three decimal places)?. The decay of radium is modeled

More information

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

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play. Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers

More information

Send all communications regarding Elementary P r o b l e m s and Solutions to P r o f e s s o r A. P. Hillman, Mathematics Department,

Send all communications regarding Elementary P r o b l e m s and Solutions to P r o f e s s o r A. P. Hillman, Mathematics Department, ELEMENTARY PROBLEMS AND SOLUTIONS Edited by A.P. HILLMAN Uiversity of Sata Clara, Sata Clara, Califoria Sed all commuicatios regardig Elemetary P r o b l e m s ad Solutios to P r o f e s s o r A. P. Hillma,

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

Review for Test 3 Math 1552, Integral Calculus Sections 8.8,

Review for Test 3 Math 1552, Integral Calculus Sections 8.8, Review for Test 3 Math 55, Itegral Calculus Sectios 8.8, 0.-0.5. Termiology review: complete the followig statemets. (a) A geometric series has the geeral form k=0 rk.theseriescovergeswhe r is less tha

More information

Math 128A: Homework 1 Solutions

Math 128A: Homework 1 Solutions Math 8A: Homework Solutios Due: Jue. Determie the limits of the followig sequeces as. a) a = +. lim a + = lim =. b) a = + ). c) a = si4 +6) +. lim a = lim = lim + ) [ + ) ] = [ e ] = e 6. Observe that

More information

<aj + ck) m (bj + dk) n. E E (-D m+n - j - k h)(i) j=0 k=0 \ / \ /

<aj + ck) m (bj + dk) n. E E (-D m+n - j - k h)(i) j=0 k=0 \ / \ / ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND j=. WHITNEY Loc Have State College Loc Have # Pesylvaia Sed all commuicatios cocerig Advaced Problems ad Solutios to Raymod E. Whitey, Mathematics Departmet,

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Classroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in

Classroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in Classroom I this sectio of Resoace, we ivite readers to pose questios likely to be raised i a classroom situatio. We may suggest strategies for dealig with them, or ivite resposes, or both. Classroom is

More information

AP CALCULUS BC 2014 SCORING GUIDELINES

AP CALCULUS BC 2014 SCORING GUIDELINES AP CALCULUS BC 04 SCORING GUIDELINES Questio 6 + The Taylor series for a fuctio f about x = is give by ( ) ( x ) ad coverges to f( x ) for = x < R, where R is the radius of covergece of the Taylor series.

More information

SOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1.

SOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1. SOLUTIONS TO EXAM 3 Problem Fid the sum of the followig series 2 + ( ) 5 5 2 5 3 25 2 2 This series diverges Solutio: Note that this defies two coverget geometric series with respective radii r 2/5 < ad

More information

On the number of sums of three unit fractions

On the number of sums of three unit fractions Notes o Number Theory ad Discrete Mathematics Vol. 9, 0, No., 8 O the umber of sums of three uit fractios Simo Brow School of Huma Life Scieces, Uiversity of Tasmaia, Locked Bag 0, Laucesto, Tasmaia 70,

More information

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

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6 Math 4 Activity (Due by EOC Apr. ) Graph the followig epoetial fuctios by modifyig the graph of f. Fid the rage of each fuctio.. g. g. g 4. g. g 6. g Fid a formula for the epoetial fuctio whose graph is

More information

UNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 116C. Problem Set 4. Benjamin Stahl. November 6, 2014

UNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 116C. Problem Set 4. Benjamin Stahl. November 6, 2014 UNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 6C Problem Set 4 Bejami Stahl November 6, 4 BOAS, P. 63, PROBLEM.-5 The Laguerre differetial equatio, x y + ( xy + py =, will be solved

More information

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

REVIEW 1, MATH n=1 is convergent. (b) Determine whether a n is convergent. REVIEW, MATH 00. Let a = +. a) Determie whether the sequece a ) is coverget. b) Determie whether a is coverget.. Determie whether the series is coverget or diverget. If it is coverget, fid its sum. a)

More information

Worksheet on Generating Functions

Worksheet on Generating Functions Worksheet o Geeratig Fuctios October 26, 205 This worksheet is adapted from otes/exercises by Nat Thiem. Derivatives of Geeratig Fuctios. If the sequece a 0, a, a 2,... has ordiary geeratig fuctio A(x,

More information

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E.WHITNEY Lock Have State College, Lock Have, Pesylvaia Sed all commuicatios cocerig Advaced Problems ad Solutios to Raymod E. Whitey, Mathematics Departmet,

More information

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016 Lecture 3 Digital Sigal Processig Chapter 3 z-trasforms Mikael Swartlig Nedelko Grbic Begt Madersso rev. 06 Departmet of Electrical ad Iformatio Techology Lud Uiversity z-trasforms We defie the z-trasform

More information

Sequences, Sums, and Products

Sequences, Sums, and Products CSCE 222 Discrete Structures for Computig Sequeces, Sums, ad Products Dr. Philip C. Ritchey Sequeces A sequece is a fuctio from a subset of the itegers to a set S. A discrete structure used to represet

More information

MATH 10550, EXAM 3 SOLUTIONS

MATH 10550, EXAM 3 SOLUTIONS MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Math 475, Problem Set #12: Answers

Math 475, Problem Set #12: Answers Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe

More information

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 +

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 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

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

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

2.4 - Sequences and Series

2.4 - Sequences and Series 2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,

More information

Exponential and Trigonometric Functions Lesson #1

Exponential and Trigonometric Functions Lesson #1 Epoetial ad Trigoometric Fuctios Lesso # Itroductio To Epoetial Fuctios Cosider a populatio of 00 mice which is growig uder plague coditios. If the mouse populatio doubles each week we ca costruct a table

More information

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz Edited by Staley Rabiowitz Please submit all ew problem proposals ad correspodig solutios to the Problems Editor, DR. RUSS EULER, Departmet of Mathematics ad Statistics, Missouri State Uiversity, 800 Uiversity

More information

1 Lecture 2: Sequence, Series and power series (8/14/2012)

1 Lecture 2: Sequence, Series and power series (8/14/2012) Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim

More information

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS ADVANCED PROBLEMS AND SOLUTIONS EDITED BY VERNER E, HOGGATT 9 JR 0, SAN JOSE STATE COLLEGE Sed all commuicatios cocerig Advaced P r o b l e m s ad Solutios to Verer E. Hoggatt, J r., Mathematics Departmet,

More information

CORE MATHEMATICS PI Page 1 of 18 HILTON COLLEGE TRIAL EXAMINATION AUGUST 2014 CORE MATHEMATICS PAPER I GENERAL INSTRUCTIONS

CORE MATHEMATICS PI Page 1 of 18 HILTON COLLEGE TRIAL EXAMINATION AUGUST 2014 CORE MATHEMATICS PAPER I GENERAL INSTRUCTIONS CORE MATHEMATICS PI Page of 8 HILTON COLLEGE TRIAL EXAMINATION AUGUST 04 Time: hours CORE MATHEMATICS PAPER I GENERAL INSTRUCTIONS 50 marks PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY.. This questio

More information

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad

More information

Chapter 6. Advanced Counting Techniques

Chapter 6. Advanced Counting Techniques Chapter 6 Advaced Coutig Techiques 6.: Recurrece Relatios Defiitio: A recurrece relatio for the sequece {a } is a equatio expressig a i terms of oe or more of the previous terms of the sequece: a,a2,a3,,a

More information

COS 341 Discrete Mathematics. Exponential Generating Functions and Recurrence Relations

COS 341 Discrete Mathematics. Exponential Generating Functions and Recurrence Relations COS 341 Discrete Mathematics Epoetial Geeratig Fuctios ad Recurrece Relatios 1 Tetbook? 1 studets said they eeded the tetbook, but oly oe studet bought the tet from Triagle. If you do t have the book,

More information

EXPONENTIAL GENERATING FUNCTIONS FOR FIBONACCI IDENTITIES

EXPONENTIAL GENERATING FUNCTIONS FOR FIBONACCI IDENTITIES EXPONENTIAL GENERATING FUNCTIONS FOR FIBONACCI IDENTITIES C A CHURCH Uiversity of North Carolia, Greesboro, North Carolia ad MARJORIE BICKNELL A. C. Wilco High Schl, Sata Clara, Califoria 1. INTRODUCTION

More information

Induction: Solutions

Induction: Solutions Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For

More information

1, if k = 0. . (1 _ qn) (1 _ qn-1) (1 _ qn+1-k) ... _: =----_...:... q--->1 (1- q) (1 - q 2 ) (1- qk) - -- n! k!(n- k)! n """"' n. k.

1, if k = 0. . (1 _ qn) (1 _ qn-1) (1 _ qn+1-k) ... _: =----_...:... q--->1 (1- q) (1 - q 2 ) (1- qk) - -- n! k!(n- k)! n ' n. k. Abstract. We prove the ifiite q-biomial theorem as a cosequece of the fiite q-biomial theorem. 1. THE FINITE q-binomial THEOREM Let x ad q be complex umbers, (they ca be thought of as real umbers if the

More information

Find quadratic function which pass through the following points (0,1),(1,1),(2, 3)... 11

Find quadratic function which pass through the following points (0,1),(1,1),(2, 3)... 11 Adrew Powuk - http://www.powuk.com- Math 49 (Numerical Aalysis) Iterpolatio... 4. Polyomial iterpolatio (system of equatio)... 4.. Lier iterpolatio... 5... Fid a lie which pass through (,) (,)... 8...

More information

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1 . Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely

More information

ELEMENTARY PROBLEMS AND SOLUTIONS Edited by A.P. HILLMAN University of Santa Clara, Santa Clara, California

ELEMENTARY PROBLEMS AND SOLUTIONS Edited by A.P. HILLMAN University of Santa Clara, Santa Clara, California ELEMENTARY PROBLEMS AND SOLUTIONS Edited by A.P. HILLMAN Uiversity of Sata Clara, Sata Clara, Califoria ' Sed all commuicatios regardig E l e m e t a r y P r o b l e m s ad Solutios to Professor A. P.

More information

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

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture) CSI 101 Discrete Structures Witer 01 Prof. Lucia Moura Uiversity of Ottawa Homework Assigmet #4 (100 poits, weight %) Due: Thursday, April, at 1:00pm (i lecture) Program verificatio, Recurrece Relatios

More information

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

SOME DOUBLE BINOMIAL SUMS RELATED WITH THE FIBONACCI, PELL AND GENERALIZED ORDER-k FIBONACCI NUMBERS ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 43 Number 3 013 SOME DOUBLE BINOMIAL SUMS RELATED WITH THE FIBONACCI PELL AND GENERALIZED ORDER-k FIBONACCI NUMBERS EMRAH KILIÇ AND HELMUT PRODINGER ABSTRACT

More information

Complex Numbers Solutions

Complex Numbers Solutions Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

GENERALIZED RABBITS FOR GENERALIZED FIBONACCI NUMBERS. V.E.Hoggatt^Jro. San Jose State College, San Jose, Calif e 1. INTRODUCTION

GENERALIZED RABBITS FOR GENERALIZED FIBONACCI NUMBERS. V.E.Hoggatt^Jro. San Jose State College, San Jose, Calif e 1. INTRODUCTION GENERALIZED RABBITS FOR GENERALIZED FIBONACCI NUMBERS V.E.Hoggatt^ro San ose State College, San ose, Calif e 1. INTRODUCTION The original Fibonacci number sequence arose from an academic rabbit production

More information

Section 6.4: Series. Section 6.4 Series 413

Section 6.4: Series. Section 6.4 Series 413 ectio 64 eries 4 ectio 64: eries A couple decides to start a college fud for their daughter They pla to ivest $50 i the fud each moth The fud pays 6% aual iterest, compouded mothly How much moey will they

More information

(2) F j+2 = F J+1 + F., F ^ = 0, F Q = 1 (j = -1, 0, 1, 2, ). Editorial notes This is not our standard Fibonacci sequence.

(2) F j+2 = F J+1 + F., F ^ = 0, F Q = 1 (j = -1, 0, 1, 2, ). Editorial notes This is not our standard Fibonacci sequence. ON THE LENGTH OF THE EUCLIDEAN ALGORITHM E. P. IV1ERKES ad DAVSD MEYERS Uiversity of Ciciati, Ciciati, Ohio Throughout this article let a ad b be itegers, a > b >. The Euclidea algorithm geerates fiite

More information

Question 1: The magnetic case

Question 1: The magnetic case September 6, 018 Corell Uiversity, Departmet of Physics PHYS 337, Advace E&M, HW # 4, due: 9/19/018, 11:15 AM Questio 1: The magetic case I class, we skipped over some details, so here you are asked to

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

MATH2007* Partial Answers to Review Exercises Fall 2004

MATH2007* Partial Answers to Review Exercises Fall 2004 MATH27* Partial Aswers to Review Eercises Fall 24 Evaluate each of the followig itegrals:. Let u cos. The du si ad Hece si ( cos 2 )(si ) (u 2 ) du. si u 2 cos 7 u 7 du Please fiish this. 2. We use itegratio

More information

The r-generalized Fibonacci Numbers and Polynomial Coefficients

The r-generalized Fibonacci Numbers and Polynomial Coefficients It. J. Cotemp. Math. Scieces, Vol. 3, 2008, o. 24, 1157-1163 The r-geeralized Fiboacci Numbers ad Polyomial Coefficiets Matthias Schork Camillo-Sitte-Weg 25 60488 Frakfurt, Germay mschork@member.ams.org,

More information

The Phi Power Series

The Phi Power Series The Phi Power Series I did this work i about 0 years while poderig the relatioship betwee the golde mea ad the Madelbrot set. I have fially decided to make it available from my blog at http://semresearch.wordpress.com/.

More information

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS EDUARD KONTOROVICH Abstract. I this work we uify ad geeralize some results about chaos ad sesitivity. Date: March 1, 005. 1 1. Symbolic Dyamics Defiitio

More information

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION ANOTHER GENERALIZED FIBONACCI SEQUENCE MARCELLUS E. WADDILL A N D LOUIS SACKS Wake Forest College, Wisto Salem, N. C., ad Uiversity of ittsburgh, ittsburgh, a. 1. INTRODUCTION Recet issues of umerous periodicals

More information

Plant Spirals and Fibonacci Numbers: A Mathematical Gold Mine. Irving Adler* North Bennington, Vt

Plant Spirals and Fibonacci Numbers: A Mathematical Gold Mine. Irving Adler* North Bennington, Vt Plat Spirals ad Fiboacci Numbers: A Mathematical Gold Mie rvig Adler* North Beigto, Vt. 5257 Coutig the spirals o a pieapple, pie coe, or suflower opes the door to the fasciatig Fiboacci umbers ad a host

More information

E. Incorrect! Plug n = 1, 2, 3, & 4 into the general term formula. n =, then the first four terms are found by

E. Incorrect! Plug n = 1, 2, 3, & 4 into the general term formula. n =, then the first four terms are found by Calculus II - Problem Solvig Drill 8: Sequeces, Series, ad Covergece Questio No. of 0. Fid the first four terms of the sequece whose geeral term is give by a ( ) : Questio #0 (A) (B) (C) (D) (E) 8,,, 4

More information

Solutions to quizzes Math Spring 2007

Solutions to quizzes Math Spring 2007 to quizzes Math 4- Sprig 7 Name: Sectio:. Quiz a) x + x dx b) l x dx a) x + dx x x / + x / dx (/3)x 3/ + x / + c. b) Set u l x, dv dx. The du /x ad v x. By Itegratio by Parts, x(/x)dx x l x x + c. l x

More information

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Generating Functions. 1 Operations on generating functions

Generating Functions. 1 Operations on generating functions Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example

More information

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163

More information

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim Math 3, Sectio 2. (25 poits) Why we defie f(x) dx as we do. (a) Show that the improper itegral diverges. Hece the improper itegral x 2 + x 2 + b also diverges. Solutio: We compute x 2 + = lim b x 2 + =

More information

Continued Fractions and Pell s Equation

Continued Fractions and Pell s Equation Max Lah Joatha Spiegel May, 06 Abstract Cotiued fractios provide a useful, ad arguably more atural, way to uderstad ad represet real umbers as a alterative to decimal expasios I this paper, we eumerate

More information

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

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES Publ. Math. Debrece 8504, o. 3-4, 85 95. ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES QING-HU HOU*, ZHI-WEI SUN** AND HAOMIN WEN Abstract. We cofirm Su s cojecture that F / F 4 is strictly decreasig

More information

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

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0, Math Activity 9( Due with Fial Eam) Usig first ad secod Taylor polyomials with remaider, show that for, 8 Usig a secod Taylor polyomial with remaider, fid the best costat C so that for, C 9 The th Derivative

More information

GENERATING IDENTITIES FOR FIBONACCI AND LUCAS TRIPLES

GENERATING IDENTITIES FOR FIBONACCI AND LUCAS TRIPLES GENERATING IDENTITIES FOR FIBONACCI AND UCAS TRIPES RODNEY T. HANSEN Motaa State Uiversity, Bozema, Motaa Usig the geeratig fuctios of {F A f ad { x f, + m + m where F ^ _ deotes the ( + m) Fiboacci umber

More information

On Generalized Fibonacci Numbers

On Generalized Fibonacci Numbers Applied Mathematical Scieces, Vol. 9, 215, o. 73, 3611-3622 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.215.5299 O Geeralized Fiboacci Numbers Jerico B. Bacai ad Julius Fergy T. Rabago Departmet

More information

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book. THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: Jauary 2009 Aalysis I Time Allowed:.5 hours Read carefully the istructios o the aswer book ad make sure that the particulars required are etered o each

More information

is also known as the general term of the sequence

is also known as the general term of the sequence Lesso : Sequeces ad Series Outlie Objectives: I ca determie whether a sequece has a patter. I ca determie whether a sequece ca be geeralized to fid a formula for the geeral term i the sequece. I ca determie

More information

Precalculus MATH Sections 3.1, 3.2, 3.3. Exponential, Logistic and Logarithmic Functions

Precalculus MATH Sections 3.1, 3.2, 3.3. Exponential, Logistic and Logarithmic Functions Precalculus MATH 2412 Sectios 3.1, 3.2, 3.3 Epoetial, Logistic ad Logarithmic Fuctios Epoetial fuctios are used i umerous applicatios coverig may fields of study. They are probably the most importat group

More information

A METHOD TO SOLVE THE DIOPHANTINE EQUATION ax 2 by 2 c 0

A METHOD TO SOLVE THE DIOPHANTINE EQUATION ax 2 by 2 c 0 A METHOD TO SOLVE THE DIOPHANTINE EQUATION ax by c Floreti Smaradache, Ph D Associate Professor Chair of Departmet of Math & Scieces Uiversity of New Mexico College Road Gallup, NM 87, USA E-mail:smarad@um.edu

More information

Definition of z-transform.

Definition of z-transform. - Trasforms Frequecy domai represetatios of discretetime sigals ad LTI discrete-time systems are made possible with the use of DTFT. However ot all discrete-time sigals e.g. uit step sequece are guarateed

More information

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007 UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Roud For all Colorado Studets Grades 7- November, 7 The positive itegers are,,, 4, 5, 6, 7, 8, 9,,,,. The Pythagorea Theorem says that a + b =

More information

Mathematics 116 HWK 21 Solutions 8.2 p580

Mathematics 116 HWK 21 Solutions 8.2 p580 Mathematics 6 HWK Solutios 8. p580 A abbreviatio: iff is a abbreviatio for if ad oly if. Geometric Series: Several of these problems use what we worked out i class cocerig the geometric series, which I

More information

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet

More information

SEQUENCE AND SERIES NCERT

SEQUENCE AND SERIES NCERT 9. Overview By a sequece, we mea a arragemet of umbers i a defiite order accordig to some rule. We deote the terms of a sequece by a, a,..., etc., the subscript deotes the positio of the term. I view of

More information

Mathematical Induction

Mathematical Induction Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a

More information

T O r - B O N A C C I P O L Y N O M I A L S. M.N.S.SWAMY Sir George Williams University, Montreal, P.O., Canada. n-1

T O r - B O N A C C I P O L Y N O M I A L S. M.N.S.SWAMY Sir George Williams University, Montreal, P.O., Canada. n-1 A FORMULA FOR F k (x)y " k T O r - B O N A C C I P O L Y N O M I A L S AND ITS GENERALIZATION M.N.S.SWAMY Sir George Williams Uiversity, Motreal, P.O., Caada. INTRODUCTION Some years ago, Carlitz [] had

More information