A Pillai-Catalan-type problem involving Fibonacci numbers

Simple item page
dc.contributor.authorIbrahimov, Seyran S.
dc.contributor.authorMahmudov, Nazim I.
dc.date.accessioned2026-02-06T18:36:07Z
dc.date.issued2024
dc.departmentDoğu Akdeniz Üniversitesi
dc.description.abstractThis paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let F-n be the Fibonacci numbers defined by the recurrence relation F-1 = 1, F-2 = 1 and F-n = Fn-1 + Fn-2 for all n >= 3. We will find all positive integer solution to the equation 3(x) - F(n)2(y) = 1 using properties of Fibonacci numbers, linear forms of logarithms and Baker-Davenport reduction method.
dc.identifier.doi10.1007/s41478-024-00779-4
dc.identifier.endpage3046
dc.identifier.issn0971-3611
dc.identifier.issn2367-2501
dc.identifier.issue5
dc.identifier.orcid0000-0002-3664-6781
dc.identifier.orcid0000-0003-3943-1732
dc.identifier.scopus2-s2.0-85192054765
dc.identifier.scopusqualityQ2
dc.identifier.startpage3039
dc.identifier.urihttps://doi.org/10.1007/s41478-024-00779-4
dc.identifier.urihttps://hdl.handle.net/11129/12216
dc.identifier.volume32
dc.identifier.wosWOS:001214604800001
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringernature
dc.relation.ispartofJournal of Analysis
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectPillai's problem
dc.subjectCatalan's problem
dc.subjectBaker-Davenport reduction technique
dc.subjectFibonacci numbers
dc.titleA Pillai-Catalan-type problem involving Fibonacci numbers
dc.typeArticle

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu