Fibonacci Variation: Find the Recurrence Relation

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

The discussion focuses on deriving a recurrence relation for the number of rabbit pairs, denoted as Sn, based on specific reproductive conditions. The initial values are S0 = 1, S1 = 1, S2 = 1, S3 = 4, S4 = 7, S5 = 10, S6 = 22, and S7 = 43. The key insight is that each mature pair produces three new pairs each month after their first two months, leading to the conclusion that the recurrence relation involves the previous three months' values. The correct recurrence relation is established as Sn = Sn-1 + Sn-2 + Sn-3 + 3(Sn-2) for n ≥ 3.

PREREQUISITES
  • Understanding of Fibonacci sequences and recurrence relations
  • Basic knowledge of mathematical induction
  • Familiarity with generating functions
  • Ability to analyze sequences and patterns in numbers
NEXT STEPS
  • Research how to derive recurrence relations in combinatorial problems
  • Study the application of generating functions in solving recurrence relations
  • Explore advanced Fibonacci sequence variations and their properties
  • Learn about mathematical induction techniques for proving recurrence relations
USEFUL FOR

Mathematicians, students studying combinatorics, and anyone interested in solving recurrence relations in mathematical modeling.

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
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 15 ·
Replies
15
Views
9K
  • · Replies 7 ·
Replies
7
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K