scholarly journals Application of Fibonacci Sequence and Lucas Sequence on the Design of the Toilet Siphon Pipe Shape

2019 ◽  
Vol 51 (4) ◽  
pp. 463
Author(s):  
Xiaole Ge ◽  
Hongfeng Wang ◽  
Shengrong Liu ◽  
Zhanfu Li ◽  
Xin Tong ◽  
...  
Keyword(s):  
Fibonacci Sequence ◽  
Lucas Sequence

scholarly journals On the Sum of Powers of Two k-Fibonacci Numbers which Belongs to the Sequence of k-Lucas Numbers

2016 ◽  
Vol 67 (1) ◽  
pp. 41-46
Author(s):  
Pavel Trojovský
Keyword(s):  
Recurrence Relation ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Lucas Numbers ◽  
Initial Values ◽  
Lucas Sequence ◽  
Positive Integers

Abstract Let k ≥ 1 and denote (Fk,n)n≥0, the k-Fibonacci sequence whose terms satisfy the recurrence relation Fk,n = kFk,n−1 +Fk,n−2, with initial conditions Fk,0 = 0 and Fk,1 = 1. In the same way, the k-Lucas sequence (Lk,n)n≥0 is defined by satisfying the same recurrence relation with initial values Lk,0 = 2 and Lk,1 = k. These sequences were introduced by Falcon and Plaza, who showed many of their properties, too. In particular, they proved that Fk,n+1 + Fk,n−1 = Lk,n, for all k ≥ 1 and n ≥ 0. In this paper, we shall prove that if k ≥ 1 and $F_{k,n + 1}^s + F_{k,n - 1}^s \in \left( {L_{k,m} } \right)_{m \ge 1} $ for infinitely many positive integers n, then s =1.

scholarly journals Some Diophantine Problems Related to k-Fibonacci Numbers

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1047
Author(s):  
Pavel Trojovský ◽  
Štěpán Hubálovský
Keyword(s):  
Recurrence Relation ◽  
Diophantine Equations ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Recursive Relation ◽  
Initial Values ◽  
Lucas Sequence ◽  
Diophantine Problems ◽  
Positive Integers

Let k ≥ 1 be an integer and denote ( F k , n ) n as the k-Fibonacci sequence whose terms satisfy the recurrence relation F k , n = k F k , n − 1 + F k , n − 2 , with initial conditions F k , 0 = 0 and F k , 1 = 1 . In the same way, the k-Lucas sequence ( L k , n ) n is defined by satisfying the same recursive relation with initial values L k , 0 = 2 and L k , 1 = k . The sequences ( F k , n ) n ≥ 0 and ( L k , n ) n ≥ 0 were introduced by Falcon and Plaza, who derived many of their properties. In particular, they proved that F k , n 2 + F k , n + 1 2 = F k , 2 n + 1 and F k , n + 1 2 − F k , n − 1 2 = k F k , 2 n , for all k ≥ 1 and n ≥ 0 . In this paper, we shall prove that if k > 1 and F k , n s + F k , n + 1 s ∈ ( F k , m ) m ≥ 1 for infinitely many positive integers n, then s = 2 . Similarly, that if F k , n + 1 s − F k , n − 1 s ∈ ( k F k , m ) m ≥ 1 holds for infinitely many positive integers n, then s = 1 or s = 2 . This generalizes a Marques and Togbé result related to the case k = 1 . Furthermore, we shall solve the Diophantine equations F k , n = L k , m , F k , n = F n , k and L k , n = L n , k .

scholarly journals A Note on Two Fundamental Recursive Sequences

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Reza Farhadian ◽  
Rafael Jakimczuk
Keyword(s):  
Fibonacci Sequence ◽  
Lucas Sequence ◽  
Recursive Sequences ◽  
General Limit

Abstract In this note, we establish some general results for two fundamental recursive sequences that are the basis of many well-known recursive sequences, as the Fibonacci sequence, Lucas sequence, Pell sequence, Pell-Lucas sequence, etc. We establish some general limit formulas, where the product of the first n terms of these sequences appears. Furthermore, we prove some general limits that connect these sequences to the number e(≈ 2.71828...).

New encryption scheme using k-Fibonacci-like sequence

2021 ◽  
pp. 2250037
Author(s):  
Saida Lagheliel ◽  
Abdelhakim Chillali ◽  
Ahmed Ait Mokhtar
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Recurrence Relation ◽  
Fibonacci Sequence ◽  
Encryption Scheme ◽  
Lucas Sequence

In this paper, we present a new encryption scheme using generalization k-Fibonacci-like sequence, we code the points of an elliptic curve with the terms of a sequence of k-Fibonacci-like using of Fibonacci sequence and we call it as k-Fibonacci like sequence [Formula: see text] defined by the recurrence relation: [Formula: see text] and we present some relation among k-Fibonacci like sequence, k-Fibonacci sequence and k-Lucas sequence. After that, we give application of elliptic curves in cryptography using k-Fibonacci like sequence.

scholarly journals Some properties of the generalized (p,q)- Fibonacci-Like number

2018 ◽  
Vol 189 ◽  
pp. 03028
Author(s):  
Alongkot Suvarnamani
Keyword(s):  
Generating Function ◽  
Real World ◽  
Open Problem ◽  
Basic Concept ◽  
Fibonacci Number ◽  
Fibonacci Sequence ◽  
Lucas Number ◽  
Generalized Fibonacci Sequence ◽  
Lucas Sequence ◽  
Real World Problems

For the real world problems, we use some knowledge for explain or solving them. For example, some mathematicians study the basic concept of the generalized Fibonacci sequence and Lucas sequence which are the (p,q) – Fibonacci sequence and the (p,q) – Lucas sequence. Such as, Falcon and Plaza showed some results of the k-Fibonacci sequence. Then many researchers showed some results of the k-Fibonacci- Like number. Moreover, Suvarnamani and Tatong showed some results of the (p, q) - Fibonacci number. They found some properties of the (p,q) – Fibonacci number and the (p,q) – Lucas number. There are a lot of open problem about them. In this paper, we studied about the generalized (p,q)- Fibonacci-Like sequence. We establish properties like Catalan’s identity, Cassini’s identity, Simpson’s identity, d’Ocagne’s identity and Generating function for the generalized (p,q)-Fibonacci-Like number by using the Binet formulas. However, all results which be showed in this paper, are generalized of the (p,q) – Fibonacci-like number and the (p,q) – Fibonacci number. Corresponding author: [email protected]

scholarly journals Prime Factors and Divisibility of Sums of Powers of Fibonacci and Lucas Numbers

2021 ◽  
Vol 17 (4) ◽  
pp. 59-69
Author(s):  
Spirit Karcher ◽  
Mariah Michael
Keyword(s):  
Fibonacci Sequence ◽  
Recursive Formula ◽  
Modular Arithmetic ◽  
Integer Sequences ◽  
Lucas Numbers ◽  
Lucas Sequence ◽  
Mathematical Properties ◽  
Sums Of Powers ◽  
Prime Factors ◽  
Fibonacci And Lucas Numbers

The Fibonacci sequence, whose first terms are f0; 1; 1; 2; 3; 5; : : :g, is generated using the recursive formula Fn+2 = Fn+1 + Fn with F0 = 0 and F1 = 1. This sequence is one of the most famous integer sequences because of its fascinating mathematical properties and connections with other fields such as biology, art, and music. Closely related to the Fibonacci sequence is the Lucas sequence. The Lucas sequence, whose first terms are f2; 1; 3; 4; 7; 11; : : :g, is generated using the recursive formula Ln+2 = Ln+1 + Ln with L0 = 2 and L1 = 1. In this paper, patterns in the prime factors of sums of powers of Fibonacci and Lucas numbers are examined. For example, F2 3n+4 + F2 3n+2 is even for all n 2 N0. To prove these results, techniques from modular arithmetic and facts about the divisibility of Fibonacci and Lucas numbers are utilized. KEYWORDS: Fibonacci Sequence; Lucas Sequence; Modular Arithmetic; Divisibility Sequence

Sebuah Generalisasi Baru Barisan Fibonacci-Lucas

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Musraini M Musraini M ◽  
Rustam Efendi ◽  
Rolan Pane ◽  
Endang Lily
Keyword(s):  
Recurrence Relation ◽  
Initial Conditions ◽  
Lucas Sequence ◽  
Binet’S Formula

Barisan Fibonacci dan Lucas telah digeneralisasi dalam banyak cara, beberapa dengan mempertahankan kondisi awal, dan lainnya dengan mempertahankan relasi rekurensi. Makalah ini menyajikan sebuah generalisasi baru barisan Fibonacci-Lucas yang didefinisikan oleh relasi rekurensi B_n=B_(n-1)+B_(n-2),n≥2 , B_0=2b,B_1=s dengan b dan s bilangan bulat  tak negatif. Selanjutnya, beberapa identitas dihasilkan dan diturunkan menggunakan formula Binet dan metode sederhana lainnya. Juga dibahas beberapa identitas dalam bentuk determinan.   The Fibonacci and Lucas sequence has been generalized in many ways, some by preserving the initial conditions, and others by preserving the recurrence relation. In this paper, a new generalization of Fibonacci-Lucas sequence is introduced and defined by the recurrence relation B_n=B_(n-1)+B_(n-2),n≥2, with ,  B_0=2b,B_1=s                          where b and s are non negative integers. Further, some identities are generated and derived by Binet’s formula and other simple methods. Also some determinant identities are discussed.

On the zero-multiplicity of the k-generalized Fibonacci sequence

2020 ◽  
Vol 26 (11-12) ◽  
pp. 1564-1578
Author(s):  
Jonathan García ◽  
Carlos A. Gómez ◽  
Florian Luca
Keyword(s):  
Fibonacci Sequence ◽  
Generalized Fibonacci Sequence

scholarly journals Note on some representations of general solutions to homogeneous linear difference equations

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Stevo Stević ◽  
Bratislav Iričanin ◽  
Witold Kosmala ◽  
Zdeněk Šmarda
Keyword(s):  
General Solution ◽  
Difference Equation ◽  
Difference Equations ◽  
Fibonacci Sequence ◽  
Linear Difference Equation ◽  
Linear Difference Equations ◽  
Second Order Difference Equation ◽  
Constant Coefficients ◽  
Order Difference Equation ◽  
Homogeneous Linear

Abstract It is known that every solution to the second-order difference equation $x_{n}=x_{n-1}+x_{n-2}=0$ x n = x n − 1 + x n − 2 = 0 , $n\ge 2$ n ≥ 2 , can be written in the following form $x_{n}=x_{0}f_{n-1}+x_{1}f_{n}$ x n = x 0 f n − 1 + x 1 f n , where $f_{n}$ f n is the Fibonacci sequence. Here we find all the homogeneous linear difference equations with constant coefficients of any order whose general solution have a representation of a related form. We also present an interesting elementary procedure for finding a representation of general solution to any homogeneous linear difference equation with constant coefficients in terms of the coefficients of the equation, initial values, and an extension of the Fibonacci sequence. This is done for the case when all the roots of the characteristic polynomial associated with the equation are mutually different, and then it is shown that such obtained representation also holds in other cases. It is also shown that during application of the procedure the extension of the Fibonacci sequence appears naturally.

scholarly journals Magnetic Normal Mode Calculations in Big Systems: A Highly Scalable Dynamical Matrix Approach Applied to a Fibonacci-Distorted Artificial Spin Ice

2021 ◽  
Vol 7 (3) ◽  
pp. 34
Author(s):  
Loris Giovannini ◽  
Barry W. Farmer ◽  
Justin S. Woods ◽  
Ali Frotanpour ◽  
Lance E. De Long ◽  
...  
Keyword(s):  
Normal Modes ◽  
Low Frequency ◽  
Fibonacci Sequence ◽  
Exchange Interactions ◽  
Geometric Distortion ◽  
Dynamical Matrix ◽  
Spin Ice ◽  
Magnetization Dynamics ◽  
Distortion Parameter ◽  
Artificial Spin Ice

We present a new formulation of the dynamical matrix method for computing the magnetic normal modes of a large system, resulting in a highly scalable approach. The motion equation, which takes into account external field, dipolar and ferromagnetic exchange interactions, is rewritten in the form of a generalized eigenvalue problem without any additional approximation. For its numerical implementation several solvers have been explored, along with preconditioning methods. This reformulation was conceived to extend the study of magnetization dynamics to a broader class of finer-mesh systems, such as three-dimensional, irregular or defective structures, which in recent times raised the interest among researchers. To test its effectiveness, we applied the method to investigate the magnetization dynamics of a hexagonal artificial spin-ice as a function of a geometric distortion parameter following the Fibonacci sequence. We found several important features characterizing the low frequency spin modes as the geometric distortion is gradually increased.

Sign in / Sign up

Export Citation Format

Share Document