On The Lucas Sequence Equations $$V_{n}=7\square $$ V n = 7 □ and $$V_{n}=7V_{m}\square $$ V n = 7 V m □

2017 ◽  
Author(s):  
Olcay Karaatlı ◽  
Refik Keskin
Keyword(s):  
Lucas 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.

A CUBIC EL-GAMAL ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE AND ELLIPTIC CURVE

2021 ◽  
Vol 10 (11) ◽  
pp. 3439-3447
Author(s):  
T. J. Wong ◽  
L. F. Koo ◽  
F. H. Naning ◽  
A. F. N. Rasedee ◽  
M. M. Magiman ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Mathematical Problem ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Encryption Scheme ◽  
Secret Key ◽  
Chosen Plaintext Attack ◽  
The Public ◽  
Lucas Sequence

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.

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.

On the Lucas sequence equations Vn=kVmand Un=kUm

2013 ◽  
Vol 130 (1) ◽  
pp. 27-38 ◽  
Author(s):  
Refik Keskin ◽  
Zafer Şiar
Keyword(s):  
Lucas Sequence

scholarly journals On some new results for the generalised Lucas sequences

2021 ◽  
Vol 29 (1) ◽  
pp. 17-36
Author(s):  
Dorin Andrica ◽  
Ovidiu Bagdasar ◽  
George Cătălin Ţurcaş
Keyword(s):  
Integer Sequences ◽  
Lucas Sequences ◽  
Lucas Sequence ◽  
Necessary And Sufficient

Abstract In this paper we introduce the functions which count the number of generalized Lucas and Pell-Lucas sequence terms not exceeding a given value x and, under certain conditions, we derive exact formulae (Theorems 3 and 4) and establish asymptotic limits for them (Theorem 6). We formulate necessary and sufficient arithmetic conditions which can identify the terms of a-Fibonacci and a-Lucas sequences. Finally, using a deep theorem of Siegel, we show that the aforementioned sequences contain only finitely many perfect powers. During the process we also discover some novel integer sequences.

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 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 generalized Lucas sequence and permutation binomials

2005 ◽  
Vol 134 (1) ◽  
pp. 15-22 ◽  
Author(s):  
Amir Akbary ◽  
Qiang Wang
Keyword(s):  
Lucas Sequence

scholarly journals Diophantine triples and reduced quadruples with the Lucas sequence of recurrence un=Aun-1-un-2

2014 ◽  
Vol 49 (2) ◽  
pp. 303-312 ◽  
Author(s):  
Nurettin Irmak ◽  
◽  
László Szalay ◽  
Keyword(s):  
Lucas Sequence ◽  
Diophantine Triples
Sign in / Sign up

Export Citation Format

Share Document