We continue our study of the class of Fibonacci-automatic words. These are infinite words whose nth term is defined in terms of a finite-state function of the Fibonacci representation of n. In this paper, we show how enumeration questions (such as counting the number of squares of length n in the Fibonacci word) can be decided purely mechanically, using a decision procedure. We reprove some kno...

In lipid biochemistry, a fundamental question is how the potential number of fatty acids increases with their chain length. Here, we show that it grows according to the famous Fibonacci numbers when cis/trans isomerism is neglected. Since the ratio of two consecutive Fibonacci numbers tends to the Golden section, 1.618, organisms can increase fatty acid variability approximately by that factor ...

In this study, the Fibonacci collocation method based on the Fibonacci polynomials are presented to solve for the fractional diffusion equations with variable coefficients. The fractional derivatives are described in the Caputo sense. This method is derived by expanding the approximate solution with Fibonacci polynomials. Using this method of the fractional derivative this equation can be reduc...

The band structure and bandgaps of one-dimensional Fibonacci quasicrystals composed of epsilon-negative materials and mu-negative materials are studied. We show that an omnidirectional bandgap (OBG) exists in the Fibonacci structure. In contrast to the Bragg gaps, such an OBG is insensitive to the incident angle and the polarization of light, and the width and location of the OBG cease to chang...

The Fibonacci numbers are terms of the sequence defined in a quite simple recursive fashion. However, despite its simplicity, they have some curious properties which are worth attention. In this set of notes, we will look at some of the important features of these numbers. In the first half of the notes, our attention shall be paid to the relationship of the Fibonacci numbers and the Euclidean ...

It is well-known that properties (1) and (2) are satisfied if n is prime. If (1) is satisfied for some composite n, then n is called a Fibonacci pseudoprime (or FPP). If (2) is satisfied for some composite n, then n is called a Lucas pseudoprime (or LPP). Let U and V denote the sets of FPP's and LPP's, respectively. It must be remarked that, the above terminology is different from that used by ...

In this article, a class of convergent series based on Fibonacci sequence is introduced for which there is a golden ratio (i.e. $frac{1+sqrt 5}{2}),$ with respect to convergence analysis. A class of sequences are at first built using two consecutive numbers of Fibonacci sequence and, therefore,  new sequences have been used in order  to introduce a  new class of series. All properties of the se...

On the 800th anniversary of the publication of Liber Abaci, I wish to draw the attention of the reader to some of my favorite facts about Fibonacci numbers concerning squares, multiples of squares and powerful numbers amongst the Fibonacci numbers.