On the multiplicity in Pillai's problem with Fibonacci numbers and powers of a fixed prime
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.