English

A Pillai-Catalan-type problem involving Fibonacci numbers

Number Theory 2024-09-16 v3

Abstract

This paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let FnF_{n} be the Fibonacci numbers defined by the recurrence relation F1=1F_{1}=1, F2=1F_{2}=1 and Fn=Fn1+Fn2F_{n}=F_{n-1}+F_{n-2} for all n3n\geq 3. We will find all positive integer solution to the equation 3xFn2y=13^{x}-F_{n}2^{y}=1 using properties of Fibonacci numbers, linear forms of logarithms, and the Baker-Davenport reduction method.

Keywords

Cite

@article{arxiv.2401.08205,
  title  = {A Pillai-Catalan-type problem involving Fibonacci numbers},
  author = {Seyran S. Ibrahimov and Nazim I. Mahmudov},
  journal= {arXiv preprint arXiv:2401.08205},
  year   = {2024}
}
R2 v1 2026-06-28T14:17:48.668Z