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

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

ADVANCED PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS

CALCULATION OF FIBONACCI VECTORS

Infinite Sequences and Series

SEQUENCES AND SERIES

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.

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

1 Generating functions for balls in boxes

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

ADVANCED PROBLEMS AND SOLUTIONS

Math 132, Fall 2009 Exam 2: Solutions

CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS

MATH 31B: MIDTERM 2 REVIEW

ELEMENTARY PROBLEMS AND SOLUTIONS

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

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

Fibonacci numbers and orthogonal polynomials

Recurrence Relations

arxiv: v1 [math.fa] 3 Apr 2016

Math 2412 Review 3(answers) kt

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

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,

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

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

Math 128A: Homework 1 Solutions

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

Math 155 (Lecture 3)

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

AP CALCULUS BC 2014 SCORING GUIDELINES

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.

On the number of sums of three unit fractions

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

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

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

Worksheet on Generating Functions

ADVANCED PROBLEMS AND SOLUTIONS

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,

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

Sequences, Sums, and Products

MATH 10550, EXAM 3 SOLUTIONS

Chapter 6 Infinite Series

Math 475, Problem Set #12: Answers

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 +

Chapter 4. Fourier Series

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

2.4 - Sequences and Series

Exponential and Trigonometric Functions Lesson #1

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz

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

ADVANCED PROBLEMS AND SOLUTIONS

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

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

Chapter 6. Advanced Counting Techniques

COS 341 Discrete Mathematics. Exponential Generating Functions and Recurrence Relations

EXPONENTIAL GENERATING FUNCTIONS FOR FIBONACCI IDENTITIES

Induction: Solutions

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.

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

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

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

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

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

Complex Numbers Solutions

Seunghee Ye Ma 8: Week 5 Oct 28

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

Section 6.4: Series. Section 6.4 Series 413

(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.

Question 1: The magnetic case

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

MATH2007* Partial Answers to Review Exercises Fall 2004

The r-generalized Fibonacci Numbers and Polynomial Coefficients

The Phi Power Series

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

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

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

Solutions to quizzes Math Spring 2007

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?

(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

Generating Functions. 1 Operations on generating functions

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

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

Continued Fractions and Pell s Equation

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

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

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

GENERATING IDENTITIES FOR FIBONACCI AND LUCAS TRIPLES

On Generalized Fibonacci Numbers

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

is also known as the general term of the sequence

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

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

Definition of z-transform.

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

Mathematics 116 HWK 21 Solutions 8.2 p580

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

SEQUENCE AND SERIES NCERT

Mathematical Induction

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

Transcription:

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 1202. 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

Dec. 1969 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

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

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 3 + + x 12 ad D(x) = x 12 i (3) to give T(x) - 1 - x 12 1 - x 12 X x (1 - x)(l - x 2 - x 3 -... - x 12 ) _ 1 - x l - x x + x 13 It follows that the sequece { T } obeys T 1-0 = T_ L 1 0 + T J _ 1 - - T ( > 0), +13 +12 +11 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 +1 1 - x - X- =0 we get

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.

1 9 6 9 ] 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, 57-63. 2. Brother U. Alfred, "Dyig Rabbit P r o b l e m Revived," Fiboacci Quarterly, 1 (1963), No. 4, 53-56. 3. Joh H. E. Coh, " L e t t e r to the E d i t o r, " Fiboacci Quarterly, 2 (1964), 108. 4. 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, 105-112. 5. 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, 75-80. [Cotiued from page 481. ] 3. J. H. E. Coh, "Square Fiboacci N u m b e r s, Etc., " Fiboacci Quarterly, 2 (1964), 109-113. 4. J. H. E. Coh, "O Square Fiboacci N u m b e r s, " Jour. LodoMath. Soc., 39 (1964), 537-540. 5. 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), 24-28. 6. Fikelstei, R. P., "O the Uits i a Quartic Field with Applicatios to MordelPs Equatio," Doctoral Dissertatio, Arizoa State Uiversity, 1968. 7. 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, 1952. 8. O. H e m e r, "O Some Diophatie Equatios of the Type y 2 - f 2 = x 3, " Math. Scad., 4 (1956), 95-107. 9. 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), 180-191. *