# Fibonacci sequences in groupoids

- Jeong Soon Han
^{1}, - Hee Sik Kim
^{2}Email author and - Joseph Neggers
^{3}

**2012**:19

https://doi.org/10.1186/1687-1847-2012-19

© Han et al.; licensee Springer. 2012

**Received: **31 January 2012

**Accepted: **27 February 2012

**Published: **27 February 2012

## Abstract

In this article, we consider several properties of Fibonacci sequences in arbitrary groupoids (i.e., binary systems). Such sequences can be defined in a left-hand way and a right-hand way. Thus, it becomes a question of interest to decide when these two ways are equivalent, i.e., when they produce the same sequence for the same inputs. The problem has a simple solution when the groupoid is flexible. The Fibonacci sequences for several groupoids and for the class of groups as special cases are also discussed.

**2000 Mathematics Subject Classification**: 20N02; 11B39.

### Keywords

fibonacci sequences groupoid flexible wrapped around## 1 Introduction

In this article, we consider several properties of Fibonacci sequences in arbitrary groupoids (i.e., binary systems). Such sequences can be defined in a left-hand way and a right-hand way. Thus, it becomes a question of interest to decide when these two ways are equivalent, i.e., when they produce the same sequence for the same inputs. The problem has a simple solution when the groupoid is flexible. In order to construct sufficiently large classes of flexible groupoids to make the results interesting, the notion of a groupoid (*X*, ∗) wrapping around a groupoid (*X*, •) is employed to construct flexible groupoids (*X*, □). Among other examples this leads to solving the problem indicated for the selective groupoids associated with certain digraphs, providing many flexible groupoids and indicating that the general groupoid problem of deciding when a groupoid (*X*, ∗) is wrapped around a groupoid (*X*, •) is of independent interest as well.

Given the usual Fibonacci-sequences [1, 2] and other sequences of this type, one is naturally interested in considering what may happen in more general circumstances. Thus, one may consider what happens if one replaces the (positive) integers by the modulo an integer *n* or what happens in even more general circumstances. The most general circumstance we shall deal with is the situation where (*X*, ∗) is actually a groupoid, i.e., the product operation ∗ is a binary operation, where we assume no restrictions a priori.

## 2 Fibonacci sequences in groupoids

Given a sequence < *φ*_{0}, *φ*_{1}, ..., *φ*_{
n
}, ... > of elements of *X*, it is a *left*-∗-*Fibonacci sequence* if *φ*_{n+2}= *φ*_{n+1}∗ *φ*_{
n
}for *n* ≥ 0, and a *right*-∗-*Fibonacci sequence* if *φ*_{n+2} = *φ*_{
n
}∗ *φ*_{n+1}for *n* ≥ 0. Unless (*X*, ∗) is commutative, i.e., *x* ∗ *y* = *y* ∗ *x* for all *x, y* ∈ *X*, there is no reason to assume that left-∗-Fibonacci sequences are right-∗-Fibonacci sequences and conversely. We shall begin with a collection of examples to note what if anything can be concluded about such sequences.

**Example 2.1**. Let (*X*, ∗) be a left-zero-semigroup, i.e., *x* ∗ *y* := *x* for any *x*, *y* ∈ *X*. Then *φ*_{2} = *φ*_{1} ∗ *φ*_{0} = *φ*_{1}, *φ*_{3} = *φ*_{2} ∗ *φ*_{1} = *φ*_{2} = *φ*_{1}, *φ*_{4} = *φ*_{3} ∗ *φ*_{2} = *φ*_{3} = *φ*_{1}, ... for any *φ*_{0}, *φ*_{1} ∈ *X*. It follows that < *φ*_{
n
}>_{
L
}= < *φ*_{0}, *φ*_{1}, *φ*_{1}, ... >. Similarly, *φ*_{2} = *φ*_{0} ∗ *φ*_{1} = *φ*_{0}, *φ*_{3} = *φ*_{1} ∗ *φ*_{2} = *φ*_{1}, *φ*_{4} = *φ*_{2} ∗ *φ*_{3} = *φ*_{2} = *φ*_{0}, ... for any *φ*_{0}, *φ*_{1} ∈ *X*. It follows that < *φ*_{
n
}>_{
R
}= < *φ*_{0}, *φ*_{1}, *φ*_{0}, *φ*_{1}, *φ*_{0}, *φ*_{1}, ... >. In particular, if we let *φ*_{0} := 0, *φ*_{1} := 1, then < *φ*_{
n
}>_{
L
}= < 0, 1, 1, 1, 1, ... > and < *φ*_{
n
}>_{
R
}= < 0, 1, 0, 1, 0, 1, ... >.

A groupoid (*X*, ∗) is said to be a *leftoid* if *x* ∗ *y* = *l*(*x*), a function of *x* in *X*, for all *x, y* ∈ *X*. We denote it by (*X*, ∗, *l*).

**Proposition 2.2**. *Let* (*X*, ∗, *l*) *be a leftoid and let* < *φ*_{
n
}> *be a left-∗-Fibonacci sequence on X. Then* < *φ*_{
n
}> = < *φ*_{0}, *φ*_{1}, *l*(*φ*_{1}), *l*^{(2)}(*φ*_{1}), ..., *l*^{(n)}(*φ*_{1}), ...>, *where l*^{(n+1)}(*x*) = *l*(*l*^{
n
}(*x*)).

**Proof**. If < *φ*_{
n
}> is a left-∗-Fibonacci sequence on *X*, then *φ*_{2} = *φ*_{1} ∗ *φ*_{0} = *l*(*φ*_{1}) and *φ*_{3} = *φ*_{2} ∗ *φ*_{1} = *l*(*φ*_{2}) = *l*^{(2)}(*φ*_{1}). It follows that *φ*_{k+1}= *φ*_{
k
}∗ *φ*_{k-1}= 1(*φ*_{
k
}) = *l*^{(k)}(*φ*_{1}). □

A groupoid (*X*, ∗) is said to be a *rightoid* if *x* ∗ *y* = *r*(*y*), a function of *y* in *X*, for all *x, y* ∈ *X*. We denote it by (*X*, ∗, *r*).

**Proposition 2.2'**. *Let* (*X*, ∗, *r*) *be a rightoid and let* < *φ*_{
n
}> *be a right-∗-Fibonacci sequence on X. Then* < *φ*_{
n
}> = < *φ*_{0}, *φ*_{1}, *r* (*φ*_{0}), r(*φ*_{0}), *r*^{(2)}(*φ*_{0}), *r*^{(2)} (*φ*_{1}), *r*^{(3)} (*φ*_{0}), *r*(3)(*φ*), ..., *r*^{(n)}(*φ*_{0}), *r*^{(n)}(*φ*_{1}), ... where *r*^{(n+1)}(*x*) = *r*(*r*^{
n
}(*x*)).

In particular, if *l* (*r*, resp.) is a constant map in Proposition 2.2 (or Proposition 2.2', resp.), say *l*(*φ*_{0}) = *l*(*φ*_{1}) = *a* for some *x* ∈ *X*, then < *φ*_{
n
}> = < *φ*_{0}, *φ*_{1}, *a, a*, ... >.

**Theorem 2.3**. *Let* < *φ*_{
n
}>_{
L
}*and* < *φ*_{
n
}>_{
R
}*be the left-∗-Fibonacci and the right-∗-Fibonacci sequences generated by φ*_{0}*and φ*_{1}. *Then* < *φ*_{
n
}>_{
L
}= < *φ*_{
n
}>_{
R
}*if and only if φ*_{
n
}∗ (*φ*_{n-1}∗ *φ*_{
n
}) = (*φ*_{
n
}∗*φ*_{n-1}) ∗ *φ*_{
n
}*for any n* ≥ 1.

**Proof**. If < *φ*_{
n
}>_{
L
}= < *φ*_{
n
}>_{
R
}, then *φ*_{0}∗*φ*_{1} = *φ*_{2} = *φ*_{1}∗*φ*_{0} and hence (*φ*_{1}∗*φ*_{0})∗*φ*_{1} = *φ*_{2}∗*φ*_{1} = *φ*_{3} = *φ*_{1}∗*φ*_{2} = *φ*_{1}∗(*φ*_{0}∗*φ*_{1}). Similarly (*φ*_{2}∗*φ*_{1})∗*φ*_{2} = *φ*_{3}∗*φ*_{2} = *φ*_{4} = *φ*_{2}∗*φ*_{3} = *φ*_{2}∗ (*φ*_{1}∗ *φ*_{2}). By induction on *n*, we obtain *φ*_{
n
}∗ (*φ*_{n-1}∗ *φ*_{
n
}) = (*φ*_{
n
}∗ *φ*_{n-1}) ∗ *φ*_{
n
}for any *n* ≥ 1.

If we assume that *φ*_{
n
}∗ (*φ*_{n-1}∗ *φ*_{
n
}) = (*φ*_{
n
}∗ *φ*_{n-1}) ∗ *φ*_{
n
}for any *n* ≥ 1, then *φ*_{
n
}∗ *φ*_{n+1}= *φ*_{
n
}∗ (*φ*_{n-1}∗ *φ*_{
n
}) = (*φ*_{
n
}∗ *φ*_{n-1}) ∗ *φ*_{
n
}= *φ*_{n+1}∗ *φ*_{
n
}for any *n* ≥ 1. □

A groupoid (*X*, ∗) is said to be *flexible* if (*x* ∗ *y*) ∗ *x* = *x* ∗ (*y* ∗ *x*) for any *x, y* ∈ *X*.

**Proposition 2.4**. *Let X* := **R** *be the set of all real numbers and let A, B* ∈ **R**. *Then any groupoid* (*X*, ∗) *of the types x*∗*y* := *A* + *B*(*x* + *y*) *or x*∗*y* := *Bx* + (1 - *B*)*y for any x, y* ∈ *X is flexible*.

**Proof**. Define a binary operation "∗" on

*X*by

*x*∗

*y*:=

*A*+

*Bx*+

*Cy*for any

*x, y*∈

*X*, where

*A, B, C*∈

*X*. Assume that (

*X*, ∗) is flexible. Then (

*x*∗

*y*) ∗

*x*=

*x*∗ (

*y*∗

*x*) for any

*x, y*∈

*X*. It follows that

*A*+

*B*(

*x*+

*y*) +

*Cx*=

*A*+

*Bx*+

*C*(

*y*∗

*x*). It follows that

*x*∈

*X*. If we let

*x*:= 0 in (1), then we obtain

*AB*=

*AC*. If

*A*≠ 0, then

*B*=

*C*and

*x*∗

*y*=

*A*+

*B*(

*x*+

*y*). If

*A*= 0, then it follows from (1) that

*x*∈

*X*. If we let

*x*:= 1 in (2), then we obtain

*B*(

*B*- 1) =

*C*(

*C*- 1) and hence

i.e., *x* ∗ *y* = *Bx* + *By* or *x* ∗ *y* = *Bx* + (1 - *B*)*y*. This proves the proposition. □

**Proposition 2.5**. *Let* (*X*, ∗) *be a flexible groupoid. Then* (*X*, ∗) *is commutative if and only if* < *φ*_{0}, *φ*_{1}, ... >_{
L
}= < *φ*_{0}, *φ*_{1}, ... >_{
R
}*for any φ*_{0}, *φ*_{1} ∈ *X*.

**Proof**. Given

*φ*

_{0},

*φ*

_{1}∈

*X, φ*

_{0}∗

*φ*

_{1}=

*φ*

_{1}∗

*φ*

_{0}=

*φ*

_{2}since (

*X*, ∗) is commutative. Since (

*X*, ∗) is flexible, we obtain

*n*, we obtain

Hence < *φ*_{0}, *φ*_{1}, ... >_{
L
}= < *φ*_{0}, *φ*_{1}, ... >_{
R
}. The converse is trivial, we omit the proof. □

**Example 2.6**. Let *X* := **R** be the set of all real numbers and let *x* ∗ *y* := -(*x* + *y*) for any *x, y* ∈ *X*. Consider aright-∗-Fibonacci sequence < *φ*_{
n
}>_{
R
}, where *φ*_{0}, *φ*_{1} ∈ *X*. Since *φ*_{2} = *φ*_{0}∗ *φ*_{1} = -(*φ*_{0} + *φ*_{1}), *φ*_{3} = *φ*_{1} ∗ *φ*_{2} = -[*φ*_{1} + *φ*_{2}] = -[*φ*_{1}-(*φ*_{0} + *φ*_{1})] = *φ*_{0}, *φ*_{4} = *φ*_{2} ∗ *φ*_{3} = *φ*_{1}, ..., we obtain < *φ*_{
n
}>_{
R
}= < *φ*_{0}, *φ*_{1}, -(*φ*_{0} + *φ*_{1}), *φ*_{0}, *φ*_{1}, -(*φ*_{0} + *φ*_{1}), *φ*_{0}, *φ*_{1}, -(*φ*_{0} + *φ*_{1}), *φ*_{0}, *φ*_{1}, ... > and *φ*_{n+3}= *φ*_{
n
}(*n* = 0, 1, 2, ...). Since (*X*, ∗) is commutative and flexible, by Proposition 2.5, < *φ*_{
n
}>_{
L
}= < *φ*_{
n
}>_{
R
}.

**Proposition 2.7**.

*Let*(

*X*, ∗)

*be a groupoid satisfying the following condition:*

*for any x, y* ∈ *X*. *Then* < *φ*_{
n
}>_{
L
}= < *φ*_{
n
}>_{
R
}*if φ*_{0} ∗ *φ*_{1} = *φ*_{1} ∗ *φ*_{0}.

**Proof**. Straightforward. □

**Proposition 2.8**. *The linear groupoid* (**R**, ∗), *with x* ∗ *y* := *A* - (*x* + *y*), ∀*x, y* ∈ **R**, *where A* ∈ **R**, *is the only linear groupoid satisfying the condition* (3).

**Proof**. By Proposition 2.4, we consider two cases:

*x*∗

*y*:=

*A*+

*B*(

*x*+

*y*) or

*x*∗

*y*:=

*Bx*+ (1-

*B*)

*y*where

*A, B*∈

**R**. Assume that

*x*∗

*y*:=

*A*+

*B*(

*x*+

*y*). Since

*y*= (

*x*∗

*y*) ∗

*x*, we have

*B*

^{2}= 1,

*B*(

*B*+ 1) = 0,

*A*(

*B*+ 1) = 0. If

*B*= 1, then 0 =

*B*(

*B*+ 1) = 2, a contradiction. If

*B*= -1, then

*A*is arbitrary. Hence

*x*∗

*y*=

*A*- (

*x*+

*y*). Assume that

*x*∗

*y*:=

*Bx*+ (1 -

*B*)

*y*. Since

*y*= (

*x*∗

*y*) ∗

*x*, we have

It follows that *B*^{2} - *B* + 1 = 0, *B*(1 - *B*) = 1 which leads to $B=\frac{1\pm \sqrt{3i}}{2}\notin R$, a contradiction.

This proves the proposition. □

## 3 Flexibility in *Bin*(*X*)

Given groupoids (*X*, ∗) and (*X*, •), we consider (*X*, ∗) to be *wrapped around* (*X*, •) if for all *x, y, z* ∈ *X*, (*x* • *y*) ∗ *z* = *z* ∗ (*y* • *x*). If (*X*, ∗) and (*X*, •) are both commutative groupoids, then (*x* • *y*) ∗ *z* = *z* ∗ (*x* • *y*) = *z* ∗ (*y* • *x*) and (*x* ∗ *y*) • *z* = *z* • (*x* ∗ *y*) for all *x, y, z* ∈ *X*, i.e., (*X*, ∗) and (*X*, •) are wrapped around each other.

**Example 3.1**. Let *X* := **R** be the set of all real numbers and let *x* ∗ *y* := *x*^{2}*y*^{2}, *x* • *y* := *x*-*y* for all *x, y* ∈ *X*. Then (*x* • *y*) ∗ *z* = (*x* - *y*) ∗ *z* = (*x* - *y*)^{2}*z*^{2} = *z* ∗ (*y* • *x*) for all *x, y, z* ∈ *X*, i.e., (*X*, ∗) is wrapped around (*X*, •). On the other hand, (*x* ∗ *y*) • *z* = *x*^{2}*y*^{2} - *z* and *z* • (*y* ∗ *x*) = *z*- *y*^{2}*x*^{2} so that (*X*, •) is not wrapped around (*X*, ∗).

The notion of the semigroup (*Bin*(*X*), □) was introduced by Kim and Neggers [3]. They showed that (*Bin*(*X*), □) is a semigroup, i.e., the operation □ as defined in general is associative. Furthermore, the left-zero semigroup is an identity for this operation.

**Proposition 3.2**. *Let* (*X*, ∗) *be wrapped around* (*X*, •). *If we define* (*X*, □) := (*X*, ∗)□(*X*, •), *i.e*., *x*□*y* := (*x* ∗ *y*) • (*y* ∗ *x*) *for all x*, *y* ∈ *X, then* (*X*, □) *is flexible*.

**Proof**. Given

*x, y, z*∈

*X*, since (

*X*, ∗) is wrapped around (

*X*, •), we obtain (

*X*, ∗) be wrapped around (

*X*, •)

proving the proposition. □

**Example 3.3**. Note that in the situation of Example 3.1, we have *x*□*y* = (*x* ∗ *y*) • (*y* ∗ *x*) = *x*^{2}*y*^{2} - *y*^{2}*x*^{2} = 0 for all *x*, *y* ∈ *X*, i.e., (*X*, □) = (*X*, ∗)□(*X*, •) is a trivial groupoid (*X*, □, *t*) where *t* = 0 and *x*□*y* = 0 for all *x*, *y* ∈ *X*.

**Example 3.4**. In Example 3.1, if we define (*X*, ∇) := (*X*, •)□(*X*, ∗), i.e., *x*∇*y* := (*x* • *y*) ∗ (*y* • *x*) for all *x, y* ∈ *X*, then *x*∇*y* = (*x - y*)^{4} and hence (*x*∇*y*)Δ*x* = ((*x* - *y*)^{4} - *x*)^{4} = (*x* - (*y* - *x*)^{4})^{4} = *x*∇(*y*∇*x*). Hence (*X*, ∇) is a flexible groupoid. Note that (*X*, ∇) is not a semigroup, since 0∇(0∇*z*) = *z*^{16} ≠ *z*^{4} = (0∇0)∇*z*. Obviously, *x*∇*y* = *y*∇*x* for all *x, y* ∈ *X*. By applying Proposition 2.5, we obtain < *φ*_{0}, *φ*_{1}, ... >_{
L
}= < *φ*_{0}, *φ*_{1}, ... >_{
R
}for any *φ*_{0}, *φ*_{1} ∈ (*X*, ∇).

We obtain a Fibonacci-∇-sequence in the groupoid (*X*, ∇) discussed in Example 3.4 as follows:

**Example 3.5**. Consider a groupoid (*X*, ∇) in Example 3.4. Since *x*∇*y* = (*x* - *y*)^{4}, given *φ*_{0}, *φ*_{1} ∈ *X*, we have *φ*_{2} = *φ*_{0} ∇ *φ*_{1} = *φ*_{1}∇*φ*_{0} = (*φ*_{1} - *φ*_{0})^{4}, and *φ*_{3} = *φ*_{2}∇*φ*_{1} = (*φ*_{2} - *φ*_{1})^{4} = [(*φ*_{1} - *φ*_{0})^{4} - *φ*_{1}]^{4}. In this fashion, we have *φ*_{4} = [[(*φ*_{1} - *φ*_{0})^{4} - *φ*_{1}]^{4} - (*φ*_{1} - *φ*_{0})^{4}]^{4}. In particular, if we let *φ*_{0} = *φ*_{1} = 1, then *φ*_{2} = 0, *φ*_{3} = *φ*_{4} = 1, *φ*_{5} = 0, *φ*_{6} = *φ*_{7} = 1, *φ*_{8} = 0, .... Hence < 1, 1, 0, 1, 1, 0, 1, 1, 0, ... > is a Fibonacci-∇-sequence in (*X*, ∇).

## 4 Limits of ∗-Fibonacci sequences

In this section, we discuss the limit of left(right)-∗-Fibonacci sequences in a real groupoid (**R**, ∗).

**Proposition 4.1**. *Define a binary operation* ∗ *on* **R** *by*$x*y:=\frac{1}{2}\left(x+y\right)$*for any x, y* ∈ **R**. *If* < *φ*_{
n
}> *is a* ∗-*Fibonacci sequence on* (**R**, ∗), *then*$\underset{n\to \infty}{\text{lim}}{\phi}_{n}=\frac{1}{3}\left({\phi}_{0}+2{\phi}_{1}\right)$.

**Proof**. Since $x*y=\frac{1}{2}\left(x+y\right)=y*x$ for any *x, y* ∈ **R**, < *φ*_{
n
}>_{
L
}= < *φ*_{
n
}>_{
R
}for any *φ*_{0}, *φ*_{1} ∈ **R**.

*A*

_{ k }is < 1, 3, 5, 11, 21, 43, 85, ... > = < A

_{3}, A

_{4}, A

_{5}, ... > and the evolution for

*B*

_{ k }is < 3, 5, 11, 21, 43, 85, ... > so that

*B*

_{ k }=

*A*

_{k+1}. If we wish to solve explicitly for

*A*

_{ k }, we note that the corresponding characteristic equation is

*r*

^{2}-

*r*- 2 = 0 with roots

*r*= 2 or

*r*= -1, i.e.,

*A*

_{k+3}=

*α*2

^{ k }+

*β*(-1)

^{ k },

*α*+

*β*= 1 when

*k*= 0, and 2

*α*-

*β*= 3 when

*k*= 1 so that $\alpha =\frac{4}{3},\beta =-\frac{1}{3}$. Hence ${A}_{k+3}=\frac{1}{3}\left[{2}^{k+2}+{\left(-1\right)}^{k+1}\right]$ and ${B}_{k+3}={A}_{k+4}=\frac{1}{3}\left[{2}^{k+3}+{\left(-1\right)}^{k+2}\right]$. It follows that

This shows that $\underset{n\to \infty}{\text{lim}}{\phi}_{n}=\frac{1}{3}\left({\phi}_{0}+2{\phi}_{1}\right)$, proving the proposition.

**Proposition 4.2**. *Define a binary operation* ∗ *on* **R** *by x* ∗ *y* := *Ax* + (1 - *A*)*y*, 0 < *A* < 1, *for any x, y* ∈ **R**. *If* < *φ*_{
n
}>_{
L
}*is a left-∗-Fibonacci sequence on* (**R**, ∗), *then*$\underset{n\to \infty}{\text{lim}}{\phi}_{n}=\frac{1}{2-A}\left[\left(1-A\right){\phi}_{0}+{\phi}_{1}\right]$.

**Proof**. Given

*φ*

_{0},

*φ*

_{1}∈

**R**, we consider <

*φ*

_{ n }>

_{ L }. Since

*φ*

_{2}=

*φ*

_{1}∗

*φ*

_{0}=

*Aφ*

_{1}+ (1 -

*A*)

*φ*

_{0}and

*φ*

_{3}=

*φ*

_{2}∗

*φ*

_{1}= (

*A*

^{2}-

*A*+ 1)

*φ*

_{1}+

*A*(1-

*A*)

*φ*

_{0}, ..., if we assume that

*φ*

_{ n }:=

*A*

_{ n }

*φ*

_{1}+

*B*

_{ n }

*φ*

_{0}(

*n*≥ 2), then

Hence we obtain the characteristic equation *r*^{2} - *Ar* - (1 - *A*) = 0 with roots *r* = 1 or *r* = *A* - 1. Thus *A*_{n+2}= *α*(*A* - 1)^{n+2}+ *β* for some *α, β* ∈ **R**. Since *A* = *A*_{2} = *α*(*A* - 1)^{2} + *β* and *A*^{2} - *A* + 1 = *A*_{3} = *α*(*A* - 1)^{3} + *β*, we obtain $\alpha =\frac{1}{A-2}$ and $\beta =\frac{1}{2-A}$ so that ${A}_{n+2}=\frac{{\left(A-1\right)}^{n+2}}{A-2}$. For *B*_{n+2}we obtain the same characteristic equation *r*^{2} - *Ar* - (1 - *A*) = 0 with roots *r* = 1 or *r* = *A* - 1. Hence *B*_{n+2}= *γ*(*A* - 1)^{n+2}+ *δ* for some *γ, δ* ∈ **R**. Since 1 - *A* = *B*_{2} = *γ*(*A* - 1)^{2} + *β, A*(1 - *A*) = *B*_{3} = *γ*(*A* - 1)^{3} + *δ*, we obtain $\gamma -\frac{1}{2-A},\delta =\frac{1-A}{2-A}$ so that ${B}_{n+2}=\frac{1}{2-A}\left[{\left(A-1\right)}^{n+2}+\left(1-A\right)\right]$. Since 0 < *A* < 1, lim_{n→∞}(*A* - 1)^{n+2}= 0. It follows that $\underset{n\to \infty}{\text{lim}}{\phi}_{n+2}=\underset{n\to \infty}{\text{lim}}\left({A}_{n+2}{\phi}_{1}+{B}_{n+2}{\phi}_{0}\right)=\left(\underset{n\to \infty}{\text{lim}}{A}_{n+2}\right){\phi}_{1}+\left(\underset{n\to \infty}{\text{lim}}{B}_{n+2}\right){\phi}_{0}=\frac{1}{2-A}\left[{\phi}_{1}+\left(1-A\right){\phi}_{0}\right]$, proving the proposition. □

Note that if $A=\frac{1}{2}$ in Proposition 4.2, then $\underset{n\to \infty}{\text{lim}}{\phi}_{n}=\frac{1}{3}\left({\phi}_{0}+2{\phi}_{1}\right)$ as in Proposition 4.1. Note that (**R**, ∗) in Proposition 4.2 is neither a semigroup nor commutative and we may consider a right-∗-Fibonacci sequence < *φ*_{
n
}>_{
R
}on (**R**, ∗).

## 5 Fibonacci sequences in a group

In this section, we discuss ∗-Fibonacci sequence in groups.

**Example 5.1**. Suppose that *X* = *S*_{4} is a symmetric group of order 4 and suppose that *φ*_{0} = (13), *φ*_{1} = (12). We wish to determine < *φ*_{
n
}>_{L}. Since *φ*_{2} = *φ*_{1}*φ*_{0} = (12)(13) = (123), *φ*_{3} = *φ*_{2}*φ*_{1} = (123)(13) = (12), *φ*_{4} = *φ*_{3}*φ*_{2} = (12)(123), ..., we obtain < *φ*_{
n
}>_{
L
}= < (13), (12), **(123)**, (**12**), (**13**), (**132**), (**23**), (**13**), (123), (12), (13), ... >, i.e., it is periodic of period 6.

**Proposition 5.2**. *Let* (*X*, •, e) *be a group and let φ*_{0}, *φ*_{1}*be elements of X such that φ*_{0}•*φ*_{1} = *φ*_{1} • *φ*_{0}. *If* <*φ*_{
n
}>_{
L
}*is a left-*•-*Fibonacci sequence in* (*X*, •, *e*) *generated by φ*_{0}*and φ*_{1}, *then*${\phi}_{k+2}={\phi}_{1}^{{F}_{k+2}}{\phi}_{0}^{{F}_{k+1}}$. *In particular, if φ*_{0} = *φ*_{1}, *then*${\phi}_{k+2}={\phi}_{1}^{{F}_{k+3}}$*where F*_{
k
}is the *k*^{th}*Fibonacci number*.

**Proof**. Let *φ*_{0}, *φ*_{1} be elements of *X* such that *φ*_{0} • *φ*_{1} = *φ*_{1}• *φ*_{0}. Since < *φ*_{
n
}>_{
L
}is a left-•-Fibonacci sequence in (*X*, •, *e*) generated by *φ*_{0} and *φ*_{1}, we have ${\phi}_{3}={\phi}_{1}^{2}{\phi}_{0},{\phi}_{4}={\phi}_{1}^{3}{\phi}_{0}^{2},{\phi}_{5}={\phi}_{1}^{5}{\phi}_{0}^{5}={\phi}_{1}^{{F}_{3}}{\phi}_{0}^{{F}_{4}},{\phi}_{6}={\phi}_{1}^{8}{\phi}_{0}^{5}={\phi}_{1}^{{F}_{6}}{\phi}_{0}^{{F}_{4}}$ and ${\phi}_{7}={\phi}_{1}^{{F}_{7}}{\phi}_{0}^{{F}_{6}}$. If we assume that ${\phi}_{k}={\phi}_{1}^{{F}_{k}}{\phi}_{0}^{{F}_{k-1}}$ and ${\phi}_{k+1}={\phi}_{1}^{{F}_{k+1}}{\phi}_{0}^{{F}_{k}}$, then ${\phi}_{k+2}={\phi}_{k+1}{\phi}_{k}={\phi}_{1}^{k+1}{\phi}_{0}^{{F}_{k}}{\phi}_{1}^{{F}_{k}}{\phi}_{0}^{{F}_{k-1}}={\phi}_{1}^{{F}_{k+2}}{\phi}_{0}^{{F}_{k+1}}$. In particular, if *φ*_{0} = *φ*_{1}, then ${\phi}_{k+2}={\phi}_{1}^{{F}_{k+2}}{\phi}_{0}^{{F}_{k+1}}={\phi}_{1}^{{F}_{k+3}}$. □

**Proposition 5.3**. *Let* (*X*, •, *e*) *be a group and let φ*_{0}, *φ*_{1}*be elements of X such that φ*_{0}•*φ*_{1} = *φ*_{1} • *φ*_{0}. *If* < *φ*_{
n
}>_{
L
}*is a full left-*•-*Fibonacci sequence in* (*X*, •, *e*) *generated by φ*_{0}*and φ*_{
1
}, *then*${\phi}_{-\left(2k\right)}={\phi}_{0}^{{F}_{k+1}}{\phi}_{1}^{-{F}_{2k}}$*and*${\phi}_{-\left(2k+1\right)}={\phi}_{0}^{-{F}_{2\left(k+1\right)}}{\phi}_{1}^{{F}_{2k+1}}$.

**Proof**. Since

*φ*

_{1}=

*φ*

_{0}

*φ*

_{-1}, we have ${\phi}_{-1}={\phi}_{0}^{-1}{\phi}_{1}$. It follows from

*φ*

_{0}=

*φ*

_{-1}

*φ*

_{-2}that ${\phi}_{-2}={\phi}_{0}^{2}{\phi}_{1}^{-1}$. In this fashion, since

*φ*

_{0}•

*φ*

_{1}=

*φ*

_{1}•

*φ*

_{0}, we obtain ${\phi}_{-3}={\phi}_{0}^{-{F}_{4}}{\phi}_{1}^{{F}_{3}}$ and ${\phi}_{-4}={\phi}_{0}^{{F}_{5}}{\phi}_{1}^{-{F}_{4}}$. By induction, assume that ${\phi}_{-\left(2k\right)}={\phi}_{0}^{{F}_{k+1}}{\phi}_{1}^{-{F}_{2k}}$ and ${\phi}_{-\left(2k+1\right)}={\phi}_{0}^{-{F}_{2\left(k+1\right)}}{\phi}_{1}^{{F}_{2k+1}}$. Then we obtain

proving the proposition. □

## Declarations

## Authors’ Affiliations

## References

- Atanassov K, Atanassova V, Shannon A, Turner J:
*New Visual Perspectives on Fibonacci Numbers.*World Scientific, New Jersey; 2002.Google Scholar - Dunlap RA:
*The Golden Ratio and Fibonacci Numbers.*World Scientific, New Jersey; 1997.Google Scholar - Kim HS, Neggers J: The semigroups of binary systems and some perspectives.
*Bull Korean Math Soc*2008, 45: 651–661.MathSciNetView ArticleGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.