Katalog Plus
Bibliothek der Frankfurt UAS
Bald neuer Katalog: sichern Sie sich schon vorab Ihre persönlichen Merklisten im Nutzerkonto: Anleitung.
Dieses Ergebnis aus BASE kann Gästen nicht angezeigt werden.  Login für vollen Zugriff.

1 Solving Recurrences 1.1 Fun with Fibonacci numbers

Title: 1 Solving Recurrences 1.1 Fun with Fibonacci numbers
Authors: Spring Semester
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: http://www.cs.iit.edu/~cs330/mar12-26.pdf.
Collection: CiteSeerX
Description: Consider the reproductive cycle of bees. Each male bee has a mother but no father; each female bee has both a mother and a father. If we examine the generations we see the following family tree: We easily see that the number of ancestors in each generation is the sum of the two numbers before it. For example, our male bee has three great-grandparents, two grandparents, and one parent, and 3 = 2 + 1. The number of ancestors a bee has in generation n is defined by the Fibonacci sequence; we can also see this by applying the rule of sum. As a second example, consider light entering two adjacent planes of glass: At any meeting surface (between the two panes of glass, or between the glass and air), the light may either reflect or continue straight through (refract). For example, here is the light bouncing seven times before it leaves the glass.
Document Type: text
File Description: application/pdf
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.7024
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.7024; http://www.cs.iit.edu/~cs330/mar12-26.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number: edsbas.2CD38FDA
Database: BASE