Fibonacci numbers and difference equations show up in many counting problems. Zeckendorf showed how to represent natural numbers in “binary” Fibonacci bases. Capocelli counted the number of 0 bits and 1 bits in such representation. Here we use the theory of difference equations to try to provide proofs for Capocelli’s claims. We also investigate generalization of the Fibonacci difference equati...

The m-th Cullen number Cm is a number of the form m2 m + 1 and the m-th Woodall number Wm has the form m2 m − 1. In 2003, Luca and Stănică proved that the largest Fibonacci number in the Cullen sequence is F4 = 3 and that F1 = F2 = 1 are the largest Fibonacci numbers in the Woodall sequence. A generalization of these sequences is defined by Cm,s = ms m+1 and Wm,s = ms m−1, for s > 1. In this pa...

We introduce a natural partial order ≤ in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers‘ triangular array are then calculated and the explicit formula for them is provided. Next in the second construction we endow the set sums of pr...

We investigate some arithmetic properties of the q-Fibonacci numbers and the q-Pell numbers.

We introduce a natural partial order ≤ in structurally natural finite subsets the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers' triangular array-are then calculated and the explicit formula for them is provided. Next-in the second construction-we endow the set sums of prefa...

The famous series of Fibonacci numbers is defined by a recursive equation saying that each number is the sum of its two predecessors, with the initial condition that the first two numbers are equal to unity. Here, we show that the numbers of fatty acids (straight-chain aliphatic monocarboxylic acids) with n carbon atoms is exactly given by the Fibonacci numbers. Thus, by investing one more carb...

In this paper, we define the notion of almost repdigit as a positive integer whose digits are all equal except for at most one digit, and search terms k-generalized Fibonacci sequence which repdigits. particular, find numbers powers 10 special case second part by using roots characteristic polynomial sequence, introduce tiny golden angles show feasibility new type in application to magnetic res...

A permutation π ∈ Sn is said to avoid a permutation σ ∈ Sk whenever π contains no subsequence with all of the same pairwise comparisons as σ. In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 123, 132, and 213 is the Fibonacci number Fn+1. In this paper we generalize this result in two ways. We first show that the number of permutations which avoid 132, 213, an...

In this study, by using Fibonacci Q-matrix and Lucas Q^'-matrix we define bicomplex Q^'-matrix. After that matrix representation, give some identities.