Results 41 to 50 of about 29,133 (216)
Karakteristik Graf Dengan Sisi Bilangan Fibonacci
Let be a finite subset of Fibonacci numbers set. In this research, we construct a graph where the set of vertices contains integer numbers such that for every , there exist some edge in that satisfies the condition . By applying some properties
Darmajid, Dwi Mifta Mahanani
doaj +1 more source
On the arrowhead-Fibonacci numbers
In this paper, we define the arrowhead-Fibonacci numbers by using the arrowhead matrix of the characteristic polynomial of the k-step Fibonacci sequence and then we give some of their properties.
Gültekin Inci, Deveci Ömür
doaj +1 more source
Determinants and inverses of circulant matrices with complex Fibonacci numbers
Let ℱn = circ (︀F*1 , F*2, . . . , F*n︀ be the n×n circulant matrix associated with complex Fibonacci numbers F*1, F*2, . . . , F*n. In the present paper we calculate the determinant of ℱn in terms of complex Fibonacci numbers.
Altınışık Ercan +2 more
doaj +1 more source
Factorizations of the Fibonacci Infinite Word [PDF]
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 ...
Fici, Gabriele
core +1 more source
Perfect numbers and Fibonacci primes (I) [PDF]
In this paper, we introduce the concept of F-perfect number, which is a positive integer n such that ∑d|n,d<n d2 = 3n. We prove that all the F-perfect numbers are of the form n = F2k-1 F2k+1, where both F2k-1 and F2k+1 are Fibonacci primes. Moreover, we obtain other interesting results and raise a new conjecture on perfect numbers.
Cai, Tianxin, Chen, Deyi, Zhang, Yong
openaire +4 more sources
Bidiagonal Decompositions and Accurate Computations for the Ballot Table and the Fibonacci Matrix
ABSTRACT Riordan arrays include many important examples of matrices. Here we consider the ballot table and the Fibonacci matrix. For finite truncations of these Riordan arrays, we obtain bidiagonal decompositions. Using them, algorithms to solve key linear algebra problems for ballot tables and Fibonacci matrices with high relative accuracy are derived.
Jorge Ballarín +2 more
wiley +1 more source
On Generalized Fibonacci Numbers
Fibonacci numbers and their polynomials have been generalized mainly by two ways: by maintaining the recurrence relation and varying the initial conditions, and by varying the recurrence relation and maintaining the initial conditions. In this paper, we
Isaac Owino Okoth, Fidel Oduol
doaj +1 more source
Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results
ABSTRACT Background Theoretical algorithm analysis provides fundamental insights into algorithm complexity but relies on simplified and often outdated computational models. Experimental algorithmics complements this approach by evaluating the empirical performance of algorithm implementations on real data and modern computing platforms.
Tomaž Dobravec
wiley +1 more source
Some properties and extended Binet’s formula for the class of bifurcating Fibonacci sequence
One of the generalizations of Fibonacci sequence is a -Fibonacci sequence, which is further generalized in several other ways, some by conserving the initial conditions and others by conserving the related recurrence relation.
Daksha Manojbhai Diwan +2 more
doaj +1 more source
On Convolved Generalized Fibonacci and Lucas Polynomials [PDF]
We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials.
Ramírez, José L.
core

