Negafibonacci

Negafibonacci

Definition

In mathematics, negaFibonacci numbers are the negatively indexed elements of the Fibonacci sequence.

The negaFibonacci numbers are defined inductively by the recurrence relation:
*F-1 = 1,
*F-2 = -1,
*Fn = F(n+2)−F(n+1).

They may be defined by the formula F−n = (−1)n+1Fn.

The first 10 negaFibonacci numbers are F-1 = 1, F-2 = -1, F-3 = 2, F-4 = -3, F-5 = 5, F-6 = -8, F-7 = 13, F-8 = -21, F-9 = 34, F-10 = -55.

Integer representation

Any integer can be uniquely represented Fact|date=September 2007 as a sum of negaFibonacci numbers in which no two consecutive negaFibonacci numbers are used. For example:

* -11 = F-4 + F-6 = (-3) + (-8)
* 12 = F-2 + F-7 = (-1) + 13
* 24 = F-1 + F-4 + F-6 + F-9 = 1 + (-3) + (-8) + 34
* -43 = F-2 + F-7 + F-10 = (-1) + 13 + (-55)
* 0 is represented by the empty sum.

Note that 0 = F-1 + F-2, for example, so the uniqueness of the representation does depend on the condition that no two consecutive negafibonacci numbers are used.

This gives a system of coding integers, similar to the representation of Zeckendorf's theorem for coding numbers using a binary representation. In the string representing the integer "x", the "n"th digit is 1 if Fn appears in the sum that represents "x"; that digit is 0 otherwise. For example, 24 may be represented by the string 100101001, which has the digit 1 in places 9, 6, 4, and 1, because 24 = F-1 + F-4 + F-6 + F-9. The integer "x" is represented by a string of odd length if and only if x>0.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • NegaFibonacci coding — Numeral systems by culture Hindu Arabic numerals Western Arabic (Hindu numerals) Eastern Arabic Indian family Tamil Burmese Khmer Lao Mongolian Thai East Asian numerals Chinese Japanese Suzhou Korean Vietnamese …   Wikipedia

  • Fibonacci number — A tiling with squares whose sides are successive Fibonacci numbers in length …   Wikipedia

  • Fibonacci — Infobox Scientist box width = 300px name = Leonardo of Pisa (Fibonacci) image width = 150px caption = Leonardo of Pisa, Fibonacci birth date = c. 1170 birth place = Pisa, Italy death date = c. 1250 death place = Pisa, Italy residence = Italy… …   Wikipedia

  • List of mathematics articles (N) — NOTOC N N body problem N category N category number N connected space N dimensional sequential move puzzles N dimensional space N huge cardinal N jet N Mahlo cardinal N monoid N player game N set N skeleton N sphere N! conjecture Nabla symbol… …   Wikipedia

  • Generalizations of Fibonacci numbers — In mathematics, the Fibonacci numbers form a sequence defined recursively by:: F (0) = 0: F (1) = 1: F ( n ) = F ( n 1) + F ( n 2), for integer n > 1.That is, after two starting values, each number is the sum of the two preceding numbers.The… …   Wikipedia

  • Fibonacci-Folge — Ein Kachelmuster aus Quadraten, deren Kantenlänge der Fibonacci Folge entspricht Die Fibonacci Folge ist eine unendliche Folge von Zahlen (den Fibonacci Zahlen), bei der sich die jeweils folgende Zahl durch Addition ihrer beiden vorherigen Zahlen …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”