Diophantine approximation by special primes
S. I. Dimitrov

TL;DR
This paper proves the existence of infinitely many prime triples with specific linear relations and bounded prime factors in their shifted forms, advancing understanding of Diophantine approximation with primes.
Contribution
It establishes new results on prime triples approximating linear forms with constraints on the number of prime factors of shifted primes.
Findings
Infinitely many prime triples satisfy the inequality with a specific bound.
Each prime in the triple has at most 28 prime factors when increased by 2.
The results depend on certain necessary conditions on the coefficients.
Abstract
We show that whenever , is real and constants satisfy some necessary conditions, there are infinitely many prime triples satisfying the inequality and such that, for each , has at most prime factors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Diophantine approximation by special primes
S. I. Dimitrov
(2017)
Abstract
We show that whenever , is real and constants satisfy some necessary conditions, there are infinitely many prime triples satisfying the inequality and such that, for each , has at most prime factors.
Keywords: Rosser’s weights, vector sieve, circle method.
2000 Math. Subject Classification. 11D75, 11N36, 11P32.
1 Introduction and statements of the result.
In 1973 Vaughan [13] proved that whenever , is real and constants satisfy some necessary conditions, there are infinitely many prime triples such that
[TABLE]
for . Latter the upper bound for was improved by Baker and Harman [1] to , by Harman [4] to and the best result up to now is due to K. Matomäki [9] with .
On the other hand a famous and still unsolved problem in Number Theory is the prime-twins conjecture, which states that there exist infinitely many prime numbers such that is also a prime.
Up to now many hybrid theorems were proved. One of the best result belongs to K. Matomäki and Shao [8]. They proved that every sufficiently large odd integer such that can be represented as a sum
[TABLE]
of primes such that
[TABLE]
where is a number with at most prime factors.
In the present paper we consider (1) with primes of the form specified above. We prove the following theorem.
Theorem 1**.**
Suppose that are non-zero real numbers, not all of the same sign, that is real, and that is irrational. Let and . Then there are infinitely many ordered triples of primes for which
[TABLE]
and
[TABLE]
By choosing the parameters in a different way we may obtain other similar results, for example .
Result of this type were obtained by Dimitrov and Todorova [3]. Combining the circle and sieve methods and using the Bombieri – Vinogradov prime number theorem they proved (2) with right-hand side , and primes such that . In this paper we improve the right-hand side of [3]. Obviously this is at the expense of the number of the prime factors of .
2 Notations and some lemmas.
For positive and we write instead of . As usual and denote Euler’s function and Möbius’ function. Let and be the greatest common divisor and the least common multiple of respectively. Instead of we write for simplicity . As usual, denotes the integer part of , . The letter denotes an arbitrary small positive number, not the same in all appearances. For example this convention allows us to write . Since is irrational, there are infinitely many different convergents to its continued fraction, with
[TABLE]
where and . We choose to be large in terms of and , and make the following definitions.
[TABLE]
The value of will be specified latter.
Let be the lower and upper bounds Rosser’s weights of level , hence
[TABLE]
For further properties of Rosser’s weights we refer to [5], [6].
Lemma 1**.**
Let and . There exists a function which is times continuously differentiable and such that
[TABLE]
and its Fourier transform
[TABLE]
satisfies the inequality
[TABLE]
Proof.
See [10]. ∎
Lemma 2**.**
Let , . We have
[TABLE]
3 Outline of the proof.
Consider the sum
[TABLE]
Any non-trivial estimate from below of implies solvability of in primes such that .
We have
[TABLE]
On the other hand
[TABLE]
where
[TABLE]
We denote
[TABLE]
From the linear sieve we know that (see [2], Lemma 10). Then we have a simple inequality
[TABLE]
analogous to this one in ([2], Lemma 13).
[TABLE]
Let
[TABLE]
where for example
[TABLE]
and so on. We shall consider the sum . The rest can be considered in the same way.
[TABLE]
Using the inverse Fourier transform for the function we get
[TABLE]
where
[TABLE]
We divide into three parts
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
We shall estimate , , respectively in the sections 4, 5, 6. In section 7 we shall complete the proof of the Theorem.
4 Upper bound for .
Lemma 3**.**
For the integral , defined by (25), we have
[TABLE]
Proof.
See [[3], Lemma 2]. ∎
5 Asymptotic formula for .
The first lemma we need in this section is the following.
Lemma 4**.**
Let . Using the definitions (11) and (21) we have
[TABLE]
Proof.
We only prove (i). The inequality (ii) can be proved likewise.
Having in mind (5), (12) and (21) we get
[TABLE]
where
[TABLE]
We have
[TABLE]
Obviously where
[TABLE]
and takes the values , with .
We have
[TABLE]
The assertion in (i) follows from (5), (5) – (5). ∎
The next lemma gives us asymptotic formula for the sums denoted by (21).
Lemma 5**.**
Let is defined by (9), and be complex numbers defined for such that
[TABLE]
If
[TABLE]
then for we have
[TABLE]
where is an arbitrary large constant.
Proof.
This lemma is very similar to results of Tolev [12]. Inspecting the arguments presented in ([12], Lemma 10), the reader will easily see that the proof of Lemma 5 can be obtained by the same manner. ∎
Let
[TABLE]
We use the identity
[TABLE]
Replace
[TABLE]
Then from (21), (23), (5), (5), (35), Lemma 1 and Lemma 5 we obtain
[TABLE]
On the other hand (5) and Lemma 2 give us
[TABLE]
Bearing in mind (5), (37) and Lemma 4 we find
[TABLE]
Arguing as in [3] for the integral defined by (35) we get
[TABLE]
where
[TABLE]
According to ([3], Lemma 4) we have
[TABLE]
Usung (5), (6), (38) and (39) we obtain
[TABLE]
Let
[TABLE]
Thus from (41) and (42) it follows
[TABLE]
6 Upper bound for .
The treatment of the intermediate region depends on the following lemma.
Lemma 6**.**
Suppose with a rational approximation satisfying \displaystyle\bigg{|}\alpha-\frac{a}{q}\bigg{|}<\frac{1}{q^{2}}, where , . Let is defined by (9), and be complex numbers defined for and let . If
[TABLE]
then
[TABLE]
where is an arbitrary small positive number.
Proof.
See [[11], Lemma 1]. ∎
Let us consider any sum denoted by (21). We represent it as sum of finite number sums of the type
[TABLE]
where
[TABLE]
We have
[TABLE]
If
[TABLE]
then from Lemma 6 for the sums we get
[TABLE]
Therefore
[TABLE]
Let
[TABLE]
We shall prove the following
Lemma 7**.**
Let ,
[TABLE]
where and are denoted by (5) and (7), and is defined by (47). Then there exists a sequence of real numbers such that
[TABLE]
Proof.
Our aim is to prove that there exists a sequence such that for each at least one of the numbers and with t, subject to (48) can be approximated by rational numbers with denominators, satisfying (45). Then the proof follows from (46) and (47).
Let be sufficiently large and be such that (see (4)). Let us notice that there exist , such that
[TABLE]
From Dirichlet’s Theorem ([7], p.158) it follows the existence of integers and , satisfying the first three conditions. If then and from (48) it follows
[TABLE]
From the last inequality, (4) and (5) we obtain
[TABLE]
which is impossible for large , respectively, for a large . So . By analogy there exist , such that
[TABLE]
If q_{i}\in\bigg{[}X^{1/6},\,X^{5/6}\bigg{]} for or , then the proof is completed. From (4), (50) and (51) we have
[TABLE]
Thus it remains to prove that the case
[TABLE]
is impossible. Let , . From (7), (48), (50) – (52) it follows
[TABLE]
We have
[TABLE]
where \mathfrak{T}_{i}=\dfrac{q_{i}}{a_{i}}\bigg{(}\lambda_{i}t-\dfrac{a_{i}}{q_{i}}\bigg{)}\,,\;i=1,\,2. According to (50), (51) and (54) we obtain
[TABLE]
Thus and
[TABLE]
Therefore, both fractions and approximate . Using (50), (52) and inequality (53) with we obtain
[TABLE]
so and the fractions and are different. Then using (56) it follows
[TABLE]
On the other hand, from (3) and (55) we have
[TABLE]
which contradicts (57). This rejects the assumption (52). Let be an infinite sequence of values of , satisfying (3). Then using (4) one gets an infinite sequence of values of , such that at least one of the numbers and can be approximated by rational numbers with denominators, satisfying (45). Hence, the proof is completed. ∎
Let us estimate the integral , denoted by (24). Using (47), (49) and Lemma 1 we find
[TABLE]
where
[TABLE]
Arguing as in [3] we obtain
[TABLE]
Using (6), (59) and choosing we get
[TABLE]
Summarizing (22), (26), (43) and (60) we find
[TABLE]
7 Proof of the Theorem.
Since the sums , and are estimated in the same way then from (13), (14), (3), (19) and (61) we obtain
[TABLE]
where
[TABLE]
and are defined by (42).
Let and are the lower and the upper functions of the linear sieve. We know that if
[TABLE]
then
[TABLE]
where is the Euler constant (see Lemma 10,[2]). Using (42) and Lemma 10 [1] we get
[TABLE]
Here
[TABLE]
To estimate from below we shall use the inequalities (see (7)):
[TABLE]
Let . Then from (63) and (68) it follows
[TABLE]
Choose .
Then by (8), (9) and (64) we find
[TABLE]
It is not difficult to compute that for sufficiently large we have
[TABLE]
Choose .
Then by (6), (40), (62), (67), (69) and (70) we obtain:
[TABLE]
The last inequality implies that as .
By the definition (13) of and the inequality (71) we conclude that for some constant there are at least triples of primes satisfying and such that for every prime factor of we have .
The proof of the Theorem is complete.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Baker, G. Harman, Diophantine approximation by prime numbers , J. Lond. Math. Soc., 25 (2), (1982), 201 – 215.
- 2[2] J. Brüdern and E. Fouvry, Lagrange’s Four Squares Theorem with almost prime variables , J. Reine Angew. Math., 454 , (1994), 59 – 96.
- 3[3] S. Dimitrov, T. Todorova, Diophantine approximation by prime numbers of a special form , Annuaire Univ. Sofia, Fac. Math. Inform., 102 , (2015), 71 – 90.
- 4[4] G. Harman, Diophantine approximation by prime numbers , J. Lond. Math. Soc., 44 (2), (1991), 218 – 226.
- 5[5] H. Iwaniec, Rosser’s sieve , Acta Arith., 36 , (1980), 171 – 202.
- 6[6] H. Iwaniec, A new form of the error term in the linear sieve , Acta Arith., 37 , (1980), 307 – 320.
- 7[7] A. Karatsuba, Principles of the Analytic Number Theory , Nauka, Moscow, (1983), (in Russian).
- 8[8] K. Matomäki, H. Shao, Vinogradov s three primes theorem with almost twin primes , ar Xiv:1512.03213 v 1 [math.NT]
