On the sum of a prime and a Fibonacci number

@article{Lee2010OnTS,
  title={On the sum of a prime and a Fibonacci number},
  author={K. S. Enoch Lee},
  journal={arXiv: Number Theory},
  year={2010}
}
  • K. S. E. Lee
  • Published 31 October 2010
  • Mathematics
  • arXiv: Number Theory
We show that the set of the numbers that are the sum of a prime and a Fibonacci number has positive lower asymptotic density. 
View PDF on arXiv
8 Citations
Highly Influential Citations
2
Background Citations
3
Methods Citations
3

8 Citations

Citation Type

Citation Type

On Numbers of the Form P + 2
Here, we show that the set of positive integers of the form p+2n−n where p is prime has a positive lower asymptotic density, thus answering a question of Z.-W. Sun. 2010 Mathematics Subject…
On integers not of the form Fn ± pa
In this paper, we prove a conjecture of Sun concerning the arithmetic progression of integers which contains no integers of the form Fn + p. In fact, we show that d − Fn has at least two distinct…
On the sumset of the primes and a linear recurrence
where en(F ) is the period of maximal length of the Fibonacci sequence modulo p as p varies through the prime divisors of n. In Lee’s work properties that may seem specific to the Fibonacci sequence…
Sums of primes and quadratic linear recurrence sequences
Let U be a sequence of positive integers which grows essentially as a geometric progression. We give a criterion on U in terms of its distribution modulo d, d = 1, 2, …, under which the set of…
Romanov type problems
Romanov proved that the proportion of positive integers which can be represented as a sum of a prime and a power of 2 is positive. We establish similar results for integers of the form…
The density of numbersnhaving a prescribed G.C.D. with thenth Fibonacci number
The moments of the logarithm of a G.C.D. related to Lucas sequences
  • C. Sanna
  • Mathematics
    Journal of Number Theory
  • 2018
Rational trigonometric sums for Fibonacci sequences and an analogue of Romanoff’s theorem

References

SHOWING 1-10 OF 20 REFERENCES
Covers of the integers with odd moduli and their applications to the forms xm-2n and x2-F3n/2
TLDR
It is shown that for any positive integer m divisible by none of 3, 5, 7, 11, 13 there exists an infinite arithmetic progression of positive odd integers the mth powers of whose terms are never of the form 2 n ± p a with a, n ∈ {0,1,2,...} and p a prime.
Additive Number Theory The Classical Bases
The purpose of this book is to describe the classical problems in additive number theory, and to introduce the circle method and the sieve method, which are the basic analytical and combinatorial…
An Introduction to Sieve Methods and Their Applications
1. Some basic notions 2. Some elementary sieves 3. The normal order method 4. The Turan sieve 5. The sieve of Eratosthenes 6. Brun's sieve 7. Selberg's sieve 8. The large sieve 9. The…
Preprint (2007-02-13) COVERS OF THE INTEGERS WITH ODD MODULI AND THEIR APPLICATIONS TO THE FORMS x m − 2 n AND x 2 − F3n/2
In this paper we construct a cover {as(mod ns)}ks=1 of Z with odd moduli such that there are distinct primes p1, . . . , pk dividing 2 n1 − 1, . . . , 2k − 1 respectively. Using this cover we show…
Fibonacci and Lucas Numbers
Houghton Mifflin Company has just released a 92-page booklet in its Enrichment Series entitled "Fibonacci and Lucas Numbers" by our Editor, V. E. Hoggatt, J r . If a first impression is valid, this…
Mixed Sums of Primes and Other Terms
In this paper, we study mixed sums of primes and linear recurrences. We show that if m ≡ 2 (mod 4) and m + 1 is a prime, then \(({m}^{{2}^{n}-1 } - 1)/(m - 1)\not ={m}^{n} + {p}^{a}\) for any n = 3,…
Distribution of Residues of Certain Second-Order Linear Recurrences Modulo p-III
  • L. Somer
  • Mathematics, Computer Science
  • 1990
TLDR
Upper bounds were determined for the number of times an element of a finite field can appear in a shortest period of a second-order linear recurrence over that finite field.
DISTRIBUTION OF RESIDUES OF CERTAIN SECOND-ORDER LINEAR RECURRENCES MODULO p—II
  • L. Somer
  • Mathematics, Computer Science
  • 1990
TLDR
This paper considers the LSFK u(a, -1) modulo p and determines the possible values for A(d) and obtains upper bounds for N(p), the least positive integer t such that un + t n (mod p) for all nonnegative integers n and some nonzero residue s.
Fibonacci and Lucas Numbers With Applications
Preface. List of Symbols. Leonardo Fibonacci. The Rabbit Problem. Fibonacci Numbers in Nature. Fibonacci Numbers: Additional Occurrances. Fibonacci and Lucas Identities. Geometric Paradoxes.…
Über einige Sätze der additiven Zahlentheorie
A locking mechanism for vehicle safety belts of the type in which a strap of the belt is automatically retracted into a housing and coiled up on a reel when the belt is not in use, to lock the reel…
...
1
2
...