Let {Fn}n=1 = {1, 1, 2, 3, . . .} be the sequence of Fibonacci numbers. In this paper we give some sufficient conditions on a natural number k such that the equation Fn = kFm is solvable with respect to the unknowns n and m. We also show that for k > 1 the equation Fn = kFm has at most one solution (n, m).

The convolved Fibonacci numbers F (r) j are defined by (1 − x − x2)−r =

In a recent paper, Kalman [3] derives many interesting properties of generalized Fibonacci numbers. In this paper, we take a different approach and derive some other interesting properties of matrices of generalized Fibonacci numbers. As an application of such properties, we construct an efficient algorithm for computing matrices of generalized Fibonacci numbers. The topic of generalized Fibona...

The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from elementary properties of the Fibonacci numbers. 1 Preliminaries The well-known sequence of Fibonacci numbers (sequence A000045 in the On-Line Encyclopedia of Int...

Various generalizations of the Fibonacci numbers have been proposed, studied and applied over the years (see [5] for a brief list). Probably the best known are the k-generalized Fibonacci numbers F (k) n (also known as the k-fold Fibonacci, k-th order Fibonacci, k-Fibonacci or polynacci numbers), satisfying F (k) n = F (k) n−1 + F (k) n−2 + . . .+ F (k) n−k , n ≥ k , F (k) n = 0 , 0 ≤ n ≤ k − 2...

In this paper, we will firstly define a new generalization of numbers (p, q) and then derive the appropriate Binet's formula generating functions concerning (p,q)-Fibonacci numbers, (p,q)- Lucas (p,q)-Pell (p,q)-Jacobsthal numbers. Also, some useful are provided for products (p,q)-numbers with bivariate complex Fibonacci polynomials.

In this study, we define hyperbolic-type k-Fibonacci numbers and then give the relationships between k-step Fibonacci numbers. addition, study sequence modulo m periods of Hperbolic-type sequences for any k which are related m. Furthermore, extend to groups. Finally, obtain 2-Fibonacci in dihedral group D2m, (m ? 2) with respect generating pairs (x,y) (y, x).

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 ...

After defining a class of generalized Fibonacci numbers and Lucas numbers, we characterize the Fibonacci pseudoprimes of the mth kind. In virtue of the apparent paucity of the composite numbers which are Fibonacci pseudoprimes of the mth kind for distinct values o f the integral parameter m , a method, which we believe to be new, for finding large probable primes is proposed. An efficient compu...

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.