On a problem of Pillai with Fibonacci numbers and powers of 2
Abstract
In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.