On the sum of a Fibonacci number and a prime

In this paper, we prove that the set of integers which can be represented as the sum of a Fibonacci number and a prime in at least one and at most [Formula: see text] ways has the lower asymptotic density at least [Formula: see text].