Abstract
Let with , and let . Define the set to consist of primes p such that is almost prime, and let be the set of primes of the form . We study the distribution of modulo one, as p ranges over the sets and , respectively.
MSC:
11J71; 11N36; 11N05
1. Introduction and Statements of the Result
The problem of the distribution of fractional parts of the sequence was first considered by Hardy and Littlewood [1]. Later, Vinogradov (see Chapter 11 of [2,3]) studied the distribution of the fractional parts of with p—prime for the cases and . The case when the exponent of the prime is not an integer is also important. One of Landau’s four problems, which were presented at the 1912 International Congress of Mathematicians, is the problem of having infinitely many primes of the form . This problem is still unsolved, and it is equivalent to the existence of infinitely many primes p such that
with (as usual , where is the largest integer not greater than x). The best exponent for the right-hand side of (1) is due to Harman and Lewis [4], but their result is applicable only for with . For Balog and Harman obtain non-trivial results—see [5,6,7,8,9]. Subsequently, Baier [10] obtained asymptotic formulae for the number of primes in an interval that satisfies with depending on a fractional power of p.
Another still unproven conjecture states that infinitely many primes p exist such that is also a prime. There are several established approximations for it. In 1973, Chen [11] proved that there are infinitely many primes p for which . As usual, we denote by an integer with no more than r prime factors, counted according to multiplicity.
In 2013, Cai [12] mixed these two problems and proved the existence of infinitely many primes p such that
with and . Later Li [13] (2023) and [14] (2025) improve Cai’s result. Let denote that the conditions (2) are fulfilled for infinitely many primes p. Using this notation, we can state the results of Cai [12] and Li [13,14] in the following form:
Meanwhile, in 2017, Dunn [15] proved that if and then there are infinitely many primes p such that
Here, following standard notation, we denote by the distance from x to the nearest integer. Our first statement improves Dunn’s result.
Theorem 1.
Let , , and . Then there are infinitely many primes p such that
If we assume slightly stronger restrictions on and , then we get
Theorem 2.
From the above theorem, we directly obtain the following corollary.
Corollary 1.
There are infinitely many primes p such that
and .
This result extends the work of Cai [12] and Li [14] in relation to the distance-to-the-nearest-integer function.
Our second result is connected to Linnik’s primes. In 1960, Linnik [16] showed that there exist infinitely many prime numbers of the form . He proved the asymptotic formula
where is the number of representations of n as a sum of two squares, is the non-principal character modulo 4, and .
In 2017 Teräväinen [17] proved that there are infinitely many primes p such that and , where is irrational.
We couple the problem of the distribution of modulo one and the existence of Linnik’s primes, and we prove
Theorem 3.
Let , , and . Then there are infinitely many primes p of the form and such that
2. Notation
Let x be a sufficiently large real number,
where and are parameters, which will be chosen later, and they will be different in the proofs of Theorems 1 and 2.
By , we denote prime numbers and by , and we denote the Euler totient function, the Möbius function, Mangoldt’s function, and the number of solutions to the equation in natural numbers . Let and be the largest common divisor and the least common multiple of , respectively. Instead of , for simplicity, we write . We denote and as means that n runs through a subinterval of with endpoints that are not necessarily the same in the different equations. The letter denotes an arbitrary small positive number, not the same in all appearances. For example, this convention allows us to write .
3. Auxiliary Results
This section gives some auxiliary results for the reader’s convenience. We will use Bombieri–Vinogradov’s theorem and its strengthened form, proven by Bombieri, Friedlander, and Iwaniec:
Theorem 4
([18], ch. 24, Bombieri–Vinogradov). For every , , and , we have
Theorem 5
([19], Theorem 10). Let , and denote a well-factorable function of level D. Then, for any given and , we have
The constant implied in ≪ depends at most on and A.
The following Lemma is a generalization of Bombieri–Vinogradov’s theorem:
Theorem 6
([20]). Let be an arithmetic function satisfying , , and
Then for any given constant , there exists a constant such that for the inequality
is fulfilled.
Our primary tool will be a half-dimensional linear sieve. We will use the following notation.
Let be a set of prime numbers,
For the set of nonnegative numbers, we will impose the following conditions:
- C1.
- if then there exists multiplicative function such thatwhere X is independent of d and is a real number considered as an error term.
- C2.
- The multiplicative function satisfies andfor all with some constant and absolute constant .
Definition 1.
The arithmetical functions are called upper and lower bound sieve weights of level for the set of primes if
- D1.
- for any positive integer d we have
- D2.
- for the inequalitiesare fulfilled.
We will use the following notation.
We will use a linear sieve.
Lemma 1
([21]). Suppose that for the set the conditions (C1.) and (C2.) are fulfilled and the inequality (7) is fulfilled with . Then, there exists arithmetical functions (called Rosser’s weights of level D) with the properties (D1.) (D2.) and for we have
where and satisfy equations
and γ is Euler’s constant. (, also known as Euler–Mascheroni constant, is defined as the limiting difference between the harmonic series and the natural logarithm).
Also, we will use a linear sieve in the following form due to Iwaniec:
Lemma 2
The next Lemma gives the explicit form of the functions of the linear sieve for :
Lemma 3
([23]). For functions and of the linear sieve the following inequalities
are fulfilled.
The next Lemma is a fundamental Lemma for the semi-linear sieve:
Lemma 4.
Suppose that for the set the conditions (C1.) and (C2.) are fulfilled, the inequality (7) holds with . Then, there exists an arithmetical functions with the properties (D1.) (D2.) such that
where and are continuous functions which satisfy
where γ is the Euler constant.
Proof.
The proof follows from [24] Theorem 11.12–Theorem 11.13 with and [24] Chapter 14 (pp. 275–276). □
Let
The following Lemma provides a lower bound for .
Lemma 5
We will use the following
Lemma 6
([25], Lemma 5). Let , ,
and
Then
The following two Lemmas are variations of a Lemma by Dunn:
Lemma 7.
Let , , , , r is fixed positive integer, and
where
Then
Proof.
The proof is the same as that of Lemma 1 in [15]. □
Remark 1.
We will notice that if in Dunn’s proof we choose
then, we obtain the estimate
which is nontrivial for .
Lemma 8.
Let , , , , r is fixed positive integer, , , and
where and . Then
Proof.
First, we note that without loss of generality, we may assume that , so and we will assume that . Next we rewrite the sum on the type
where
, and
Following the proof of Lemma 1 [15] for some parameter , we estimate the sum as
We put
It follows from the requirement , and that . Having in mind that , we get
Summing over b in (18), we obtain
which is our statement. □
Remark 2.
We will notice that under the strong condition , we can choose
and then we obtain the estimate
which is nontrivial for .
We will also need the following two Lemmas.
Lemma 9.
Let and . Then there exists periodic with period 1 function such that:
and admits a Fourier expansion
where the Fourier coefficients satisfy
Proof.
Such a function is a consequence of Vinogradov’s Lemma (see Chapter 1, [26]). □
Lemma 10.
Let , , , , , ξ is fixed real number, , , r is fixed positive integer, , and . Then for the periodic function from Lemma 9 the equality
is fulfilled.
Proof.
Remark 3.
4. Proof of the Theorem 1
We will prove that there are infinitely many primes p such that and .
First, using the ideas of Chen (see [11]), we consider the sum
Here, is a periodic function as described in Lemma 9. The variables z, , and K are defined according to (5). We also have the following conditions:
where will be chosen later in the discussion.
We will notice that the expression in brackets is
- 1 if has no prime divisors smaller than ;
- if has exactly one prime divisor in the interval and one prime divisor greater than ;
- ≤0 in all other cases.
So, the weight of p is positive only if
Therefore, it is sufficient to demonstrate that .
Our next step is to express S in the form (see (27)):
where
We will estimate the sums , , and separately, the first one from below and the other two from above.
4.1. Estimate of Sum
To sum , we apply the lower bound linear sieve in the form due to Iwaniec (see Lemma 2). Let be a lower bound well factorable function of level with
and
From the Fourier expansion (19) of the function and the inequalities (20), we obtain:
where
and
As
from Theorem 5, we get
Applying Lemma 7 with and using (28), we obtain
Using (31), (32), (34), (35), and Lemma 3, we get
4.2. Estimate of Sum
To the inner sum in , we apply upper bound linear sieve (see Lemma 1) with
Let be upper bounds of Rosser’s weights of level . Using the Fourier expansion (19) of function and the inequalities (20), we obtain
where
We can rewrite the sum in the type
where
from
and from Bombieri–Vinogradov’s theorem (see Theorem 4), we get
Using the notation (39), Lemma 7 with , and restriction (5), we get
Let
First, we apply linear sieve (Lemma 1) to sum :
and then the Abel transformation:
Finally, from Lemma 3 and the inequalities (37), (38), and (40), we get
4.3. Estimate of Sum
It is not difficult to see that
Next, we apply the upper bound linear sieve (see Lemma 1) with —upper bounds Rosser’s weights of level and :
where
To the last sum, we apply Lemma 10 and get
where
Next, using Fourier expansion (19) of function , the inequalities (20), and (45), we obtain
where
It is obvious that
Then, from Theorem 6, we get
To estimate the sum , we apply Lemma 8 with , and from the restriction (5), we get
To sum , we apply Lemma 1 with satisfying (41):
Then, by applying Abel’s identity twice, we obtain:
From inequalities (46), (48)–(50) follows
4.4. Estimate of Sum S
5. Proof of the Theorem 3
In this section, we will prove that there are infinitely many primes p of the form and such that .
We will utilize the fact that if and , then has no prime factors belonging to . Our purpose will be an evaluation of the sum
From here to the end of the paragraph, we will use the notations (12). It is not difficult to see that
where
and
To prove our assertion, it is sufficient to verify that . We will estimate the sums and separately, from below and above, respectively.
5.1. Estimation of Sum
To sum we apply a half-dimensional sieve. Let be lower bound weights of half dimensional sieve of order . Then
5.2. Estimation of Sum
Having in mind the definition (53) of , we observe that is the sum over that primes p such that has prime divisor of set . As each element is divisible by an even number of primes from and , we conclude that is the sum over prime numbers of the form whith , , and n is an integer divisible only by primes of the form . So
From follows , . So
Let and let
Then and
To the sum over in the above inequality, we apply the upper bound linear sieve (see Lemma 1) with —upper bounds Rosser’s weights of level and :
Then, with the help of Lemma 10, we get
where
To sum , we apply the Fourier expansion (19) and the inequalities (20):
where
We evaluate the sum in the same way as sum (see (47)) and get
To estimate sum we apply Lemma 8 with and get
With the help of Lemma 1 for sum we get
where . Assuming , from with , and , the conditions and in the above product are equivalent to . So, using notation (15), we get
From and follows
So
Using Lemma 6, we obtain
From (14), (15), (33), it follows that and
Now, with the help of Lemma 3 and choice , we receive
From (59)–(63), it follows that
From (58) and (64), we get
Choosing and , we obtain the following.
with , Theorem 3 is proved.
6. Conclusions
The linear and the 1/2 sieves are powerful tools for studying problems related to prime numbers. These methods play a significant role in number theory, particularly in the distribution of primes and the identification of prime patterns. In this paper, we obtain theorems on the distribution of modulo one, with primes belonging to two different sets. Based on the progress made in this article, we identify the following open problems:
- Generalization of the obtained results for .
- Extension of the results to the case and to the more complex case . The main difficulty in this case arises from estimating exponential sums of type (16). The primary requirement for these estimates is that they must be independent of D. Furthermore, there are some difficulties in generalizing the Lemma 10.
Author Contributions
Conceptualization, A.G. and T.L.T.; methodology, A.G. and T.L.T.; validation, A.G. and T.L.T.; formal analysis, A.G. and T.L.T.; writing—original draft preparation, A.G. and T.L.T.; writing—review and editing A.G. and T.L.T.; funding acquisition A.G. and T.L.T. All authors have read and agreed to the published version of the manuscript.
Funding
This study is financed by the European Union-Next Generation EU through the National Recovery and Resilience Plan of the Republic of Bulgaria, project DUECOS BG-RRP-2.004-0001-C01.
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding authors.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Hardy, G.H.; Littlewood, J.E. Some problems of Diophantine approximation I. On the fractional part of nkλ. Acta Math. 1914, 37, 155–191. [Google Scholar] [CrossRef]
- Vinogradov, I.M. The method of trigonometrical sums in the theory of numbers. Trud. Math. Inst. Steklov. 1947, 23, 1–109. (In Russian) [Google Scholar]
- Vinogradov, I.M. A general distribution law for the fractional parts of values of a polynomial with variable running over primes. C.R. Doklady Acad. Sci. URSS NS 1946, 51, 491–492. (In Russian) [Google Scholar]
- Harman, G.; Lewis, P. Gaussian primes in narrow sectors. Mathematika 2001, 48, 119–135. [Google Scholar] [CrossRef]
- Balog, A. On the fractional part of pθ. Arch. Math. 1983, 40, 434–440. [Google Scholar] [CrossRef]
- Balog, A. On the distribution of pθ mod 1. Acta Math. Hung. 1985, 45, 179–199. [Google Scholar] [CrossRef]
- Balog, A.; Harman, G. On mean values of Dirichlet polynomials. Arch. Math. 1991, 57, 581–587. [Google Scholar] [CrossRef]
- Harman, G. On the distribution of p modulo one. Mathematika 1983, 30, 104–116. [Google Scholar] [CrossRef]
- Harman, G. Fractional and integral parts of pλ. Acta Arith. 1991, 58, 141–152. [Google Scholar] [CrossRef]
- Baier, S. On the pλ problem. Acta Arith. 2004, 113, 77–101. [Google Scholar] [CrossRef][Green Version]
- Chen, J.R. On the representation of a large even integer as the sum of a prime and the product of at most two primes. Sci. Sin. 1973, 16, 157–176. [Google Scholar]
- Cai, Y. On the distribution of p modulo one involving primes of special type. Stud. Sci. Math. Hung. 2013, 50, 470–490. [Google Scholar]
- Li, R. A remark on the distribution of p modulo one involving primes of special type. arXiv 2024, arXiv:2401.01351v1. [Google Scholar]
- Li, R. A remark on the distribution of p modulo one involving primes of special type II. arXiv 2024, arXiv:2401.01351v2. [Google Scholar]
- Dunn, A. On the distribution of αpγ+β modulo one. J. Number Theory 2017, 176, 67–75. [Google Scholar] [CrossRef]
- Linnik, J. An asymptotic formula in an additive problem of Hardy and Littlewood. Izv. Akad. Nauk SSSR Ser. Mat. 1960, 24, 629–706. (In Russian) [Google Scholar]
- Teräväinen, J. The Goldbach problem for primes that are sums of two squares plus one. Mathematika 2017, 64, 20–70. [Google Scholar] [CrossRef]
- Davenport, H. Multiplicative Number Theory. In Graduate Texts in Mathematics, 3rd ed.; Montgomery, H.L., Ed.; Springer: New York, NY, USA, 2000; Volume 74. [Google Scholar]
- Bombieri, E.; Friedlander, J.B.; Iwaniec, H. Primes in arithmetic progressions to large moduli. Arch. Math. 1986, 156, 203–251. [Google Scholar] [CrossRef]
- Pan, C.D.; Pan, C.B. Goldbach Conjecture; Science Press: Beijing, China, 1981. [Google Scholar]
- Iwaniec, H. Rosser’s sieve. Acta Arith. 1980, 36, 171–202. [Google Scholar] [CrossRef]
- Iwaniec, H. A new form of the error term in the linear sieve. Acta Arith. 1980, 37, 307–320. [Google Scholar] [CrossRef]
- Cai, Y. On Chen’s theorem (II). J. Number Theory 2008, 128, 1336–1357. [Google Scholar] [CrossRef]
- Friedlander, J.; Iwaniec, H. Opera de Cribro. In American Mathematical Society Colloquium Publications; American Mathematical Society: Providence, RI, USA, 2010; Volume 57. [Google Scholar]
- Matomäki, K. Prime numbers of the form p = m2 + n2 + 1 in short intervals. Acta Arith. 2007, 128, 193–200. [Google Scholar] [CrossRef][Green Version]
- Karatsuba, A.A. Basic Analytic Number Theory; Springer: Berlin/Heidelberg, Germany, 1983. (In Russian) [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).