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. Let α and β be defined as above andThen there are infinitely many primes p satisfying (3). From the above theorem, we directly obtain the following corollary.
Corollary 1. There are infinitely many primes p such thatand . 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 haveThe 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 , , andThen for any given constant , there exists a constant such that for the inequalityis 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 that
where
X is independent of
d and
is a real number considered as an error term.
- C2.
The multiplicative function
satisfies
and
for 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 havewhere and satisfy equationsand γ 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 ([
22])
. Suppose that for the set the conditions (C1.) and (C2.) are fulfilled, the inequality (7) is fulfilled with , and . Thenandwhere , are well factorable functions of level D and the functions are defined by (11). 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 inequalitiesare 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 thatwhere and are continuous functions which satisfywhere γ is the Euler constant. Proof. The proof follows from [
24] Theorem 11.12–Theorem 11.13 with
and [
24] Chapter 14 (pp. 275–276). □
The following Lemma provides a lower bound for .
Lemma 5 ([
25], Proposition 6)
. Under condition (12) the inequalitywhereis fulfilled. We will use the following
Lemma 6 ([
25], Lemma 5)
. Let , ,andThen The following two Lemmas are variations of a Lemma by Dunn:
Lemma 7. Let , , , , r is fixed positive integer, andwhereThen 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 choosethen, we obtain the estimatewhich is nontrivial for . Lemma 8. Let , , , , r is fixed positive integer, , , andwhere 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 chooseand then we obtain the estimatewhich 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 expansionwhere 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 equalityis fulfilled. Proof. From Lemma 9 we get that
where
and
satisfy (
20). Let
. We have that
. From (
21) we get
where
So
where
and
satisfy (
22). To sum
, we apply Lemma 8 and get
In sum
we put
and get
From
and
we receive
From (
23), (
24), and (
26), we obtain our statement. □
Remark 3. We notice that if we use result in Remark 2 we get thatwhit γ and θ satisfying (4). 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
Now from (
29), (
36), (
42), (
51) we get
So for
and
the inequality
is fulfilled for a small
. Theorem 1 is proved.
If, in the estimates of
and
, we use Remark 2 and Remark 3, respectively, we will obtain for the sum
S the same lower bound as in (
52), but under the restrictions (
4), and obtain Theorem 2.
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
Applying the Fourier expansion (
19) and the inequalities (
20), we obtain:
where
It is clear that
(see (
12)). Then, from Lemma 5, we get
with
A and
consequently defined by (
13) and (14).
As
from Bombieri–Vinogradov’s Theorem (Theorem 4), it follows that
To estimate the sum
, we apply Lemma 7 for
. Using (
5) we obtain
From (
54)–(
57) it follows that
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: