Fibonacci Variation: Find the Recurrence Relation

  • Thread starter Thread starter Jim01
  • Start date Start date
  • Tags Tags
    Variation
Click For Summary

Homework Help Overview

The problem involves modeling the growth of a rabbit population based on specific reproductive rules. It seeks to establish a recurrence relation for the number of rabbit pairs at the end of each month, given that the initial pair is not fertile for the first two months and produces three new pairs thereafter.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • The original poster attempts to derive a recurrence relation based on calculated values for the number of rabbit pairs over several months, but struggles to formalize it into an equation. Some participants suggest examining the calculations for specific months to identify patterns, while others hint at the significance of the number of offspring produced each month.

Discussion Status

Participants are actively exploring the relationship between the calculated values and the underlying recurrence relation. There is a focus on understanding how the growth of the population relates to the reproductive rules, with hints provided to guide the original poster's reasoning without offering direct solutions.

Contextual Notes

The original poster has drawn a genealogy chart to visualize the population growth but expresses uncertainty about deriving the recurrence relation from the observed values. There is an emphasis on the specific conditions of fertility and reproduction that influence the problem.

Jim01
Messages
36
Reaction score
0

Homework Statement



A single pair of rabbits (male and female) is born at the beginning of a year. Assume the following conditions:

(1) Rabbit pairs are not fertile during their first two months of life, but thereafter give birth to three new male/female pairs at the end of every month.

(2) No rabbits die

(a) Let Sn = the number of pairs of rabbits alive at the end of month n, for each ionterger n>=1, and let S0 = 1. Find a recurrence relation for S0, S1, S2, ...



Homework Equations



Original Fibonacci equation = Fn = Fk-1 + Fk - 2, where F0 = 1 and F1 = 1.



The Attempt at a Solution



I have drawn a genealogy chart to the 7th generation and have come up with

S0 = 1,
S1 = 1,
S2 = 1,
S3 = 4,
S4 = 7,
S5 = 10,
S6 = 22,
S7 = 43,

The problem is that I cannot figure out a way to come up with the equation which would give me the recurrence relation.

I tried doing Fn = Fk-1 + Fk - 2 + Fk - 3 +1, but that doesn't work unless n >= 3 and does not work past S4. I've tried several other combinations as well but I can't figure it out.

Is this one of those problems where you just have to "see" the answer or is there a procedure I can use to get it?
 
Physics news on Phys.org
Explain how you calculated S6 and S7. That should give you a clue as to what the recurrence relation is.
 
vela said:
Explain how you calculated S6 and S7. That should give you a clue as to what the recurrence relation is.

I didn't calculate it. I drew it out. I was hoping that if I knew what what the various numbers were it would jump out at me. I was wrong. I know there is a pattern, and I know that the previous S numbers have something to do with it, I just can't see it. I'll keep working on it.
 
The number 3 should appear in your recurrence relation somewhere because each pair produces 3 additional pairs every month.

Hint: Look at the increase from month to month and figure out how many pairs were responsible for that increase.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 15 ·
Replies
15
Views
9K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
5K