Results 31 to 40 of about 1,488 (185)
On the arrowhead-Fibonacci numbers
Open Mathematics, 2016 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
The Fibonacci-Padovan sequences in finite groups [PDF]
Maejo International Journal of Science and Technology, 2014 The Fibonacci-Padovan sequence modulo m was studied. Also, the Fibonacci-Padovan orbits of -generator finite groups such that was examined. The Fibonacci-Padovan lengths of the groups , and for , where Z is integer, were then obtained.
Sait Tas, Omur Deveci, Erdal Karaduman
doaj +1 more source
Note on a Fibonacci parity sequence
Cryptography and Communications, 2022 Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in Fibonacci representation. In this note we show how, using the Walnut theorem-prover, to obtain a measure of its complexity, previously studied by Jamet, Popoli, and Stoll. We strengthen one of their theorems and disprove one of their conjectures.
openaire +3 more sources
Generalized Fibonacci-like sequence and Fibonacci sequence
International Journal of Contemporary Mathematical Sciences, 2014 Every term in the Fibonacci Sequence can be determined recursively with the help of initial values F0 = 0, F1 = 1. Similar is the case with Lucas Sequence. In this paper, we study Generalized Fibonacci-Like sequence {Dn} defined by the recurrence relation Dn = Dn-1 + Dn-2, for all n 2 with D0 = 2 and D1 = 1+m, m being a fixed positive integer.
Sanjay Harne +2 more
openaire +1 more source
Trees and Meta-Fibonacci Sequences [PDF]
The Electronic Journal of Combinatorics, 2009 For $k>1$ and nonnegative integer parameters $a_p, b_p$, $p = 1..k$, we analyze the solutions to the meta-Fibonacci recursion $C(n)=\sum_{p=1}^k C(n-a_p-C(n-b_p))$, where the parameters $a_p, b_p$, $p = 1..k$ satisfy a specific constraint. For $k=2$ we present compelling empirical evidence that solutions exist only for two particular families of ...
Abraham Isgur +2 more
openaire +2 more sources
Power Fibonacci sequences in quadratic integer modulo m [PDF]
Notes on Number Theory and Discrete MathematicsThe power Fibonacci sequence in ℤₘ[√δ] is defined as a Fibonacci sequence Fₙ=Fₙ₋₁+Fₙ₋₂ where F₀=1 and F₁=a, such that a∈ℤₘ[√δ] and Fₙ≡aⁿ(mod m), for all n∈ℕ∪{0}. In this paper, we investigated the existence of power Fibonacci sequences in ℤₘ[√δ], and the
Paul Ryan A. Longhas +3 more
doaj +1 more source
Fibonacci numbers: A population dynamics perspective
Heliyon, 2019 Fibonacci numbers or Fibonacci sequence is among the most popular numbers or sequence in Mathematics. In this paper, we discuss the sequence in a population dynamics perspective. We discuss the early development of the sequence and interpret the sequence
Asep K. Supriatna +2 more
doaj +1 more source
Combined Pseudo-Random Sequence Generator for Cybersecurity
Sensors, 2022 Random and pseudo-random number and bit sequence generators with a uniform distribution law are the most widespread and in demand in the market of pseudo-random generators.
Volodymyr Maksymovych +5 more
doaj +1 more source
Fibonacci Modules and Multiple Fibonacci Sequences
Ars Comb., 2008 Double Fibonacci sequences are introduced and they are related to operations with Fibonacci modules. Generalizations and examples are also discussed.
openaire +2 more sources
On (k,p)-Fibonacci numbers and matrices [PDF]
Notes on Number Theory and Discrete MathematicsIn this paper, some relations between the powers of any matrices X satisfying the equation Xᵏ-pXᵏ⁻¹-(p-1)X-I=0 and (k,p)-Fibonacci numbers are established with ...
Sinan Karakaya +2 more
doaj +1 more source