On the Diophantine equation L-n - L-m=2 . 3(a)
Yükleniyor...
Tarih
2019
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this paper we find (n, m, a) solutions of the Diophantine equation L-n - L-m = 2 . 3(a), where L-n and L-m are Lucas numbers with a >= 0 and n > m >= 0. For proving our theorem, we use lower bounds for linear forms in logarithms and Baker-Davenport reduction method in Diophantine approximation.
Açıklama
Anahtar Kelimeler
Diophantine equation, Lower bounds, Logarithmic method, Fibonacci, Numbers, Form
