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

Mahadi Ddamulira; Florian Luca

doi:10.1142/S1793042120500876

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

Mahadi Ddamulira, Florian Luca

Institute of Analysis and Number Theory (5010)

Research output: Contribution to journal › Article › Research › peer-review

Abstract

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 language	English
Pages (from-to)	1-24
Journal	International Journal of Number Theory
Volume	16
Early online date	9 Apr 2020
DOIs	https://doi.org/10.1142/S1793042120500876
Publication status	E-pub ahead of print - 9 Apr 2020

Keywords

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

Access to Document

10.1142/S1793042120500876Licence: CC BY

Link to publication in Scopus

Fingerprint Dive into the research topics of 'On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3'. Together they form a unique fingerprint.

Cite this

Ddamulira, M., & Luca, F. (2020). On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3. International Journal of Number Theory, 16, 1-24. https://doi.org/10.1142/S1793042120500876

@article{743be69d0ffc48a19479a4ba02cd85c5,

title = "On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3",

abstract = "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.",

keywords = "Baker's method, generalized Fibonacci numbers, linear forms in logarithms, Pillai's problem",

author = "Mahadi Ddamulira and Florian Luca",

note = "Mahadi Ddamulira, Florian Luca. On the problem of Pillai with k--generalized Fibonacci numbers and powers of 3. International Journal of Number Theory, World Scientific Publishing, In press, https://doi.org/10.1142/S1793042120500876.",

year = "2020",

month = "4",

day = "9",

doi = "10.1142/S1793042120500876",

language = "English",

volume = "16",

pages = "1--24",

journal = "International Journal of Number Theory",

issn = "1793-0421",

publisher = "World Scientific Publishing",

}

TY - JOUR

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

AU - Ddamulira, Mahadi

AU - Luca, Florian

N1 - Mahadi Ddamulira, Florian Luca. On the problem of Pillai with k--generalized Fibonacci numbers and powers of 3. International Journal of Number Theory, World Scientific Publishing, In press, https://doi.org/10.1142/S1793042120500876.

PY - 2020/4/9

Y1 - 2020/4/9

N2 - 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.

AB - 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.

KW - Baker's method

KW - generalized Fibonacci numbers

KW - linear forms in logarithms

KW - Pillai's problem

UR - http://www.scopus.com/inward/record.url?scp=85083391344&partnerID=8YFLogxK

U2 - 10.1142/S1793042120500876

DO - 10.1142/S1793042120500876

M3 - Article

VL - 16

SP - 1

EP - 24

JO - International Journal of Number Theory

JF - International Journal of Number Theory

SN - 1793-0421

ER -