Results 31 to 40 of about 879,292 (211)
The Polytopic-k-Step Fibonacci Sequences in Finite Groups
Discrete Dynamics in Nature and Society, 2011 We study the polytopic-k-step Fibonacci sequences, the polytopic-k-step Fibonacci sequences modulo m, and the polytopic-k-step Fibonacci sequences in finite groups.
Ömür Deveci
doaj +1 more source
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
Algebraic divisibility sequences over function fields [PDF]
, 2011 In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields ...
Mahe, Valery +14 more
core +2 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
Complete k-ary trees and generalized meta-Fibonacci sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We show that a family of generalized meta-Fibonacci sequences arise when counting the number of leaves at the largest level in certain infinite sequences of k-ary trees and restricted compositions of an integer.
Chris Deugau, Frank Ruskey
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
On Period of the Sequence of Fibonacci Polynomials Modulo
Discrete Dynamics in Nature and Society, 2013 It is shown that the sequence obtained by reducing modulo coefficient and exponent of each Fibonacci polynomials term is periodic. Also if is prime, then sequences of Fibonacci polynomial are compared with Wall numbers of Fibonacci sequences according ...
İnci Gültekin, Yasemin Taşyurdu
doaj +1 more source
Generalized Fibonacci Sequences for Elliptic Curve Cryptography
Mathematics, 2023 The Fibonacci sequence is a well-known sequence of numbers with numerous applications in mathematics, computer science, and other fields. In recent years, there has been growing interest in studying Fibonacci-like sequences on elliptic curves.
Zakariae Cheddour +2 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 +3 more sources
Generalization of the 2-Fibonacci sequences and their Binet formula [PDF]
Notes on Number Theory and Discrete MathematicsWe will explore the generalization of the four different 2-Fibonacci sequences defined by Atanassov. In particular, we will define recurrence relations to generate each part of a 2-Fibonacci sequence, discuss the generating function and Binet formula of ...
Timmy Ma, Richard Vernon, Gurdial Arora
doaj +1 more source