On integers of the form \(p+F2k+Fq\)
Abstract
In 1934, Romanoff proved that the set of positive integers representable as the sum of a prime and a power of two has positive lower density. Erdős later constructed an infinite arithmetic progression of odd integers none of which admits such a representation. Let \(Fn\) be the Fibonacci sequence. In this paper, we prove that the set of integers of the form \(p+F2k+Fq\), where \(p,q\) are primes and \(k0\), has positive lower asymptotic density. The same holds for the set of integers not of this form.
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.