On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3

Mahadi Ddamulira*, Florian Luca

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


For an integer k ≥ 2, let {Fn(k)} n≥2-k be the k-generalized Fibonacci sequence which starts with 0,..., 0, 1 (a total of k terms) and for which each term afterwards is the sum of the k preceding terms. In this paper, we find all integers c with at least two representations as a difference between a k-generalized Fibonacci number and a power of 3. This paper continues the previous work of the first author for the Fibonacci numbers, and for the Tribonacci numbers.

Original languageEnglish
Pages (from-to)1643-1666
Number of pages24
JournalInternational Journal of Number Theory
Issue number7
Publication statusPublished - 1 Aug 2020


  • Baker's method
  • generalized Fibonacci numbers
  • linear forms in logarithms
  • Pillai's problem

ASJC Scopus subject areas

  • Algebra and Number Theory

Fields of Expertise

  • Information, Communication & Computing

Cite this