Indexed metadata

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

Herbert Batte, Mahadi Ddamulira, Juma Kasozi, Florian Luca

Source record

Source: Crossref

Published: Dec 30, 2022

DOI: 10.3336/gm.57.2.02

Open original source ↗

Source abstract

Let {Fn}n≥0 \{F_n\}_{n\geq 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

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