On the multiplicity in Pillai's problem with Fibonacci numbers and powers of a fixed prime

preprint2022arXivOpen access

Abstract

Let {Fn}n≥0 \{F_n\}_{n\ge 0} be the sequence of Fibonacci numbers and let pp be a prime. For an integer cc we write mF,p(c)m_{F,p}(c) for the number of distinct representations of cc as Fk−pℓF_k-p^\ell with k≥2k\ge 2 and ℓ≥0\ell\ge 0. We prove that mF,p(c)≤4m_{F,p}(c)\le 4.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.