Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Rabbits

by Jasper (Chaplain)
on Nov 24, 2004 at 17:22 UTC ( [id://410183]=note: print w/replies, xml ) Need Help??


in reply to Rabbits

Umm, nice ASCII art, and all, but the whole rabbits thing isn't the fibonacci sequence, is it?

If I start with two rabbits, and each pair produces two more each month, then I'll end up with 2, 4, 8, 16, 32, 64... rabbits after each month.

Won't I?

Replies are listed 'Best First'.
Re^2: Rabbits
by CloneArmyCommander (Friar) on Nov 29, 2004 at 13:55 UTC
    That's the story behind that Fibonacci sequence. I forget the exact details, but many years ago Fibonacci was given this problem, "If I have two rabbits. . . " and the solution he found was, 1,1,2,3,5,8,.... It also gave me an image to use :). Another interesting thing is that things in nature, such as flowers, seem to show numbers relating to the sequence. Almost all flowers have a number of petals that is a number in the Fibonacci sequence :) (normally, pluck a few out, and I might be wrong ;).

      Let's assume that each couple of rabbits give birth to two baby rabbits.

      Let's count the number of couple of rabbits. At the beginning, we've 1 couple of young rabbit

      F_1 = 1

      Next year, they'll be adult rabbits, but won't have children yet :

      F_2 = 1

      On the third year, they'll a two baby rabbits, that is one couple

      F_3 = 2

      On the forth year, the first parent will have two baby rabbits again, but young rabbits won't be old enough to do so

      F_3 = 2 + 1 = 3

      On the fifth year, we've got two couples that can have little rabbits and one that cannot :

      F_3 = 3 + 2 = 5

      and so on... Each year, the number of couple is :

      • the number of rabbits that lived the year before, that is F_{n-1}
      • plus the number of rabbits that were born that year, that is the number of couple old enough to proceate, that is F_{n-2}

      To conclude :

      F_n = F_{n-1} - F{n-2}

      Funny, isn't it ? Ok, that is not very realistic and very accurante, but who cares ? ;)


      --
      zejames
        That's one way of putting it :). I find it fun to play around with sequences and series, and perl is just an easy language to model them with. Thanks for the clear picture and explanation :), I understood the idea, but it is difficult for me to explain.
        Well, that's that clarified. The monthly thing was misleading me :)

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://410183]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others goofing around in the Monastery: (5)
As of 2024-04-23 17:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found