2007
DOI: 10.4064/aa130-3-4
|View full text |Cite
|
Sign up to set email alerts
|

Representations of integers as sums of primes from a Beatty sequence

Abstract: We study the problem of representing integers N ≡ κ (mod 2) as a sum of κ prime numbers from the Beatty sequencewhere α, β ∈ R with α > 1, and α is irrational and of finite type.In particular, we show that for κ = 2, almost all even numbers have such a representation if and only if α < 2, and for any fixed integer κ 3, all sufficiently large numbers N ≡ κ (mod 2) have such a representation if and only if α < κ.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
8
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 17 publications
(22 reference statements)
0
8
0
Order By: Relevance
“…(see [2]) proved that if k ≥ 3, then every sufficiently large integer n ≡ k(mod 2) can be expressed as the sum of k primes from the sequence E α,β , provided that α < k and α has a finite type [see below (2.8)]. In their closing remarks, the authors of [3] note that their method can be used to extend the results of [3] to representations of an integer n in the form…”
Section: Introductionmentioning
confidence: 98%
“…(see [2]) proved that if k ≥ 3, then every sufficiently large integer n ≡ k(mod 2) can be expressed as the sum of k primes from the sequence E α,β , provided that α < k and α has a finite type [see below (2.8)]. In their closing remarks, the authors of [3] note that their method can be used to extend the results of [3] to representations of an integer n in the form…”
Section: Introductionmentioning
confidence: 98%
“…Over the years, a number of authors have studied variants of the three primes theorem with prime numbers restricted to various sequences of arithmetic interest. For instance, a recent work by Banks, Güloglu and Nevans [1] studies the question of representing integers as sums of primes from a Beatty sequence. Suppose that α and β are real numbers, with α > 1 and irrational.…”
Section: Introductionmentioning
confidence: 99%
“…Banks et al proved that if k ≥ 3, then every sufficiently large integer n ≡ k (mod 2) can be expressed as the sum of k primes from the sequence B α,β , provided that α < k and α "has a finite type" (see below). In their closing remarks, the authors of [1] note that their method can be used to extend the main results of [1] to representations of an integer n in the form (1)…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…We remark that some additive problems of Goldbach type involving such primes have also been successfully studied; see [5,24,27]. Unfortunately, it seems that these results and techniques are not well known among non-experts (as we have mentioned, [18] gives a proof of a weaker result), so in part our motivation comes from a desire to make these techniques better known and to examine their potential and limitations.…”
mentioning
confidence: 99%