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 positive integers expre...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 positive integers expressible by the sum of a prime number and an element of u has a positive lower density. This criterion is then checked for some second order linear recurrence sequences. It follows, for instance, that the set of positive integers of the form p ＋ [（2 ＋ √3）n], where p is a prime number and n is a positive integer, has a positive lower density. This generalizes a recent result of Enoch Lee. In passing, we show that the periods of linear recurrence sequences of order m modulo a prime number p cannot be ＂too small＂ for most prime numbers p.展开更多
In this paper, we characterize the odd positive integers n satisfying the congruence ∑j=1^n-1 j n-1/2 We show that the set of such positive integers has an asymptotic densitywhich turns out to be slightly larger than...In this paper, we characterize the odd positive integers n satisfying the congruence ∑j=1^n-1 j n-1/2 We show that the set of such positive integers has an asymptotic densitywhich turns out to be slightly larger than 3/8.展开更多
文摘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 positive integers expressible by the sum of a prime number and an element of u has a positive lower density. This criterion is then checked for some second order linear recurrence sequences. It follows, for instance, that the set of positive integers of the form p ＋ [（2 ＋ √3）n], where p is a prime number and n is a positive integer, has a positive lower density. This generalizes a recent result of Enoch Lee. In passing, we show that the periods of linear recurrence sequences of order m modulo a prime number p cannot be ＂too small＂ for most prime numbers p.
文摘In this paper, we characterize the odd positive integers n satisfying the congruence ∑j=1^n-1 j n-1/2 We show that the set of such positive integers has an asymptotic densitywhich turns out to be slightly larger than 3/8.
