FACTOID # 99: Thinking of becoming a teacher? Head to Switzerland. Teaching salaries there start at $US 33,000.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

FACTS & STATISTICS    Simple view

  1. Select countries to view: (hold down Control key and click to select several)

     

     

    Compare:

     

     

  1. Select fact or statistic: (* = graphable)

     

     

     

  2. (OPTIONAL) Compare to statistic: (both need to be graphable)

     

     

     

  3. View result as:

     

       
(OR) SEARCH ALL encyclopedia, stats & forums:   

Encyclopedia > Fibonacci word

The Fibonacci word is a specific infinite sequence of binary digits (or symbols from any two-letter alphabet). Infinity is a term with very distinct, separate meanings which arise in theology, philosophy, mathematics and everyday life. ... In mathematics and computer science, the binary (base_two) numeral system is a representation for numbers that uses only zeroes and ones as digits. ... An alphabet is a complete standardized set of letters — basic written symbols — each of which roughly represents a phoneme of a spoken language, either as it exists now or as it may have been in the past. ...


Definition

Let S0 be "0" and S1 be "01". Now Sn = Sn − 1Sn − 2 (the concatenation of the previous sequence and the one before that). The Fibonacci word is the limit .


The sequence

We have:


S2 0, 1, 0


S3 0, 1, 0, 0, 1


S4 0, 1, 0, 0, 1, 0, 1, 0


S5 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1


...


The first few elements of the sequence are:


0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, ...


Discussion

The word is related to the famous sequence of the same name (the Fibonacci sequence) in the sense that addition of integers in the inductive definition is replaced with string concatenation. This causes the length of Sn to be Fn+2, the (n+2)th Fibonacci number. Also the number of 1s in Sn is Fn+1 and the number of 0s in Sn is Fn. In mathematics, the Fibonacci numbers form a sequence defined recursively by: In words: you start with 0 and 1, and then produce the next Fibonacci number by adding the two previous Fibonacci numbers. ... A recursive definition is a one which defines a word in terms of itself, albeit in a useful way. ...


Another way of going from Sn to Sn+1 is to replace each 0 with 0, 1 and each 1 with 0.


The Fibonacci word is a famous example of a Sturmian word. In mathematics, a Sturmian word is a certain kind of infinite word. ...


  Results from FactBites:
 
Fibonacci word - Wikipedia, the free encyclopedia (147 words)
The Fibonacci word is a specific infinite sequence of binary digits (or symbols from any two-letter alphabet).
The word is related to the famous sequence of the same name (the Fibonacci sequence) in the sense that addition of integers in the inductive definition is replaced with string concatenation.
The Fibonacci word is a famous example of a Sturmian word.
  More results at FactBites »


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.