An exponential equation involving k-Fibonacci numbers

dc.contributor.authorGueye, Alioune
dc.contributor.authorRıhane, Salah Eddine
dc.contributor.authorTogb, Alain
dc.date.accessioned2025-01-06T17:23:32Z
dc.date.available2025-01-06T17:23:32Z
dc.date.issued2021
dc.departmentAdana Alparslan Türkeş Bilim ve Teknoloji Üniversitesi
dc.description.abstractFor k ? 2, consider the k -Fibonacci sequence (F(k)\rn )n?2?k having initial conditions 0, . . . , 0, 1 (k terms)\rand each term afterwards is the sum of the preceding k terms. Some well-known sequences are special cases of this\rgeneralization. The Fibonacci sequence is a special case of (F(k)\rn )n?2?k with k = 2 and Tribonacci sequence is\r(F(k)\rn )n?2?k with k = 3. In this paper, we use Baker’s method to show that 4, 16, 64, 208, 976, and 1936 are all\rk -Fibonacci numbers of the form (3a ± 1)(3b ± 1), where a and b are nonnegative integers
dc.identifier.doi10.3906/mat-2106-86
dc.identifier.endpage2677
dc.identifier.issn1300-0098
dc.identifier.issn1303-6149
dc.identifier.issue6
dc.identifier.startpage2664
dc.identifier.trdizinid528511
dc.identifier.urihttps://doi.org/10.3906/mat-2106-86
dc.identifier.urihttps://search.trdizin.gov.tr/tr/yayin/detay/528511
dc.identifier.urihttps://hdl.handle.net/20.500.14669/797
dc.identifier.volume45
dc.indekslendigikaynakTR-Dizin
dc.language.isoen
dc.relation.ispartofTurkish Journal of Mathematics
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_20241211
dc.titleAn exponential equation involving k-Fibonacci numbers
dc.typeArticle

Dosyalar