On the multiplicity in Pillai's problem with Fibonacci numbers and powers of a fixed prime
Herbert BatteMahadi DdamuliraJuma KasoziFlorian Luca
所有作者
Herbert BatteMahadi DdamuliraJuma KasoziFlorian Luca
文献摘要
Let {Fn}n≥0 be the sequence of Fibonacci numbers and let p be a prime. For an integer c we write mF,p(c) for the number of distinct representations of c as Fk−pℓ with k≥2 and ℓ≥0. We prove that mF,p(c)≤4.