Next Article in Journal
Clifford Distributions Revisited
Next Article in Special Issue
Inverse and Logarithmic Coefficient Bounds of Concave Univalent Functions
Previous Article in Journal
The Effects of the Weak Allee Effect and Disease on the Dynamics of a Predator–Prey System: Stability and Bifurcation Properties
Previous Article in Special Issue
Borel Summation in a Martingale-Type Collar
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Distribution Modulo One of αpγ + β for Special Classes of Primes

by
Atanaska Georgieva
1,* and
Tatiana L. Todorova
2
1
Faculty of Mathematics and Informatics, University of Plovdiv, 4000 Plovdiv, Bulgaria
2
Faculty of Mathematics and Informatics, Sofia University ”St. Kliment Ohridski”, 1504 Sofia, Bulgaria
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(7), 532; https://doi.org/10.3390/axioms14070532
Submission received: 8 June 2025 / Revised: 7 July 2025 / Accepted: 10 July 2025 / Published: 12 July 2025
(This article belongs to the Special Issue Mathematical Analysis and Applications IV)

Abstract

Let α , β R with α 0 , and let γ ( 0 , 5 / 6 ) . Define the set M 1 to consist of primes p such that p + 2 is almost prime, and let M 2 be the set of primes of the form p = a 2 + b 2 + 1 . We study the distribution of α p γ   +   β modulo one, as p ranges over the sets M 1 and M 2 , respectively.
MSC:
11J71; 11N36; 11N05

1. Introduction and Statements of the Result

The problem of the distribution of fractional parts of the sequence α n k was first considered by Hardy and Littlewood [1]. Later, Vinogradov (see Chapter 11 of [2,3]) studied the distribution of the fractional parts of α p k with p—prime for the cases k = 1 and k 2 . 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 n 2 + 1 . This problem is still unsolved, and it is equivalent to the existence of infinitely many primes p such that
{ p } < p θ
with θ = 1 / 2 (as usual { x } = x [ x ] , where [ x ] is the largest integer not greater than x). The best exponent θ = 0.262 + ε for the right-hand side of (1) is due to Harman and Lewis [4], but their result is applicable only for { p λ } with λ = 1 / 2 . For λ ( 0 , 1 ) 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 { p λ θ } < δ with δ depending on a fractional power of p.
Another still unproven conjecture states that infinitely many primes p exist such that p + 2 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 p + 2 = P 2 . As usual, we denote by P r 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
{ p } < p θ and p + 2 = P r
with θ = 1 / 15.5 and r = 4 . Later Li [13] (2023) and [14] (2025) improve Cai’s result. Let M ( θ , r ) 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:
M ( 1 15.5 , 4 ) , M ( θ , 8 1 4 θ ) with θ ( 0 , 1 / 4 ) , M ( 1 15.1 , 4 ) , M ( 1 9.83 , 5 ) , M ( 1 9.38 , 6 ) , M ( 1 9.34 , 7 ) .
Meanwhile, in 2017, Dunn [15] proved that if 0 < γ < 1 and θ < γ / 10 then there are infinitely many primes p such that
| | α p γ + β | | < p θ and p + 2 = P 3 .
Here, following standard notation, we denote by | | x | | = min n Z | x n | the distance from x to the nearest integer. Our first statement improves Dunn’s result.
Theorem 1. 
Let α R { 0 } , β R , 0 < γ < 5 / 6 and θ < γ / 10 . Then there are infinitely many primes p such that
| | α p γ + β | | < p θ and p + 2 = P 2 .
If we assume slightly stronger restrictions on γ and θ , then we get
Theorem 2. 
Let α and β be defined as above and
4 θ < γ < 5 6 θ .
Then 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 that
| | p | | < p 1 / 8
and p + 2 = P 2 .
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 p = a 2 + b 2 + 1 . He proved the asymptotic formula
p X r ( p 1 ) = π p > 2 1 + χ ( p ) p ( p 1 ) X log X + O X ( log log X ) 5 ( log X ) 1 + θ 0 ,
where r ( n ) is the number of representations of n as a sum of two squares, χ ( n ) is the non-principal character modulo 4, and θ 0 = 1 2 1 4 e log 2 .
In 2017 Teräväinen [17] proved that there are infinitely many primes p such that p = a 2 + b 2 + 1 and | | α p + β | | < p 1 / 80 + ε , where α is irrational.
We couple the problem of the distribution of α p γ + β modulo one and the existence of Linnik’s primes, and we prove
Theorem 3. 
Let α R { 0 } , β R , 0 < γ < 5 / 6 and θ < γ / 10 . Then there are infinitely many primes p of the form p = a 2 + b 2 + 1 and such that
| | α p γ + β | | < p θ .

2. Notation

Let x be a sufficiently large real number,
Δ = Δ ( x ) = x θ , K = Δ 1 log 2 x , z = x 1 / δ ,
where θ and δ are parameters, which will be chosen later, and they will be different in the proofs of Theorems 1 and 2.
By q ,   p ,   p 1 ,   p 2 , we denote prime numbers and by φ ( n ) ,   μ ( n ) ,   Λ ( n ) , and τ ( n ) we denote the Euler totient function, the Möbius function, Mangoldt’s function, and the number of solutions to the equation m 1 m 2 = n in natural numbers m 1 ,   m 2 . Let ( m 1 , , m k ) and [ m 1 , , m k ] be the largest common divisor and the least common multiple of m 1 , , m k , respectively. Instead of m n ( mod k ) , for simplicity, we write m n ( k ) . We denote e ( y ) = e 2 π i y and n x as means that n runs through a subinterval of ( x , 2 x ] 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 x ε log x x ε .

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 0 < θ < 1 2 , D = x θ , and A > 0 , we have
d D max ( a , d ) = 1 | π ( x , d , a ) π ( x ) φ ( d ) | A x ( log x ) A 5
Theorem 5 
([19], Theorem 10). Let ε > 0 , D = x 4 / 7 ε and λ ( . ) denote a well-factorable function of level D. Then, for any given A > 0 and a 0 , we have
q D ( d , a ) = 1 λ ( d ) π ( x , d , a ) π ( x ) φ ( d ) A x ( log x ) A .
The constant implied in ≪ depends at most on ε , a and A.
The following Lemma is a generalization of Bombieri–Vinogradov’s theorem:
Theorem 6 
([20]). Let g ( x , k ) be an arithmetic function satisfying g ( x , k ) τ r ( k ) , 1 / 2 E ( x ) x 1 θ , 0 < θ 1 and
H ( y ; k , d , l ) = k p y k p l ( d ) 1 1 ϕ ( d ) k p y 1
Then for any given constant A > 10 , there exists a constant B = B ( A ) > 0 such that for D x 1 / 2 ( log x ) B the inequality
d D max ( d , l ) = 1 max y x | k E ( x ) ( k , d ) = 1 g ( x , k ) H ( y ; k , d , l ) | x log A x
is fulfilled.
Our primary tool will be a half-dimensional linear sieve. We will use the following notation.
Let P be a set of prime numbers,
P ( z ) = p z p P p .
For the set A = { a n | n x } of nonnegative numbers, we will impose the following conditions:
C1.
if A d = n x d | n a n then there exists multiplicative function ω ( d ) such that
| A d | = ω ( d ) d X + r ( A , d )
where X is independent of d and r ( A , d ) is a real number considered as an error term.
C2.
The multiplicative function ω ( d ) satisfies 0 ω ( p ) < p and
z 1 p < z 2 p P 1 ω ( p ) p 1 log z 2 log z 1 κ 1 + L log z 1
for all z 2 > z 1 2 with some constant κ 0 and absolute constant L 1 .
Definition 1. 
The arithmetical functions λ ± are called upper and lower bound sieve weights of level D 2 for the set of primes P if
D1. 
for any positive integer d we have
| λ ± ( d ) | 1 if d | P ( z ) and λ ± ( d ) = 0 if d > D or μ ( d ) = 0 ;
D2. 
for n N the inequalities
d | n λ ( d ) d | n μ ( d ) d | n λ + ( d ) .
are fulfilled.
We will use the following notation.
S ( A , P , z ) = n A ( n , P ( z ) ) = 1 a n and V ( z ) = p z p P 1 ω ( p ) p .
We will use a linear sieve.
Lemma 1 
([21]). Suppose that for the set A the conditions (C1.) and (C2.) are fulfilled and the inequality (7) is fulfilled with κ = 1 . Then, there exists arithmetical functions λ ± ( d ) (called Rosser’s weights of level D) with the properties (D1.) (D2.) and for s = log D log z we have
S ( A , z ) X V ( z ) ( F ( s ) + O ( ( log D ) 1 3 ) ) + d D λ + ( d ) r ( A , d ) if 2 z D ,
S ( A , z ) V ( z ) X ( f ( s ) + O ( ( log D ) 1 3 ) ) + d D λ ( d ) r ( A , d ) 2 z D 1 / 2 , ,
where F ( s ) and f ( s ) satisfy equations
F ( s ) = 2 e γ s 1 , if 0 < s 3 , f ( s ) = 2 e γ s 1 log ( s 1 ) , if 2 s 3 , ( s F ( s ) ) = f ( s 1 ) , if s > 3 , ( s f ( s ) ) = F ( s 1 ) , if s > 2
and γ is Euler’s constant. ( γ 0.577 , 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 A the conditions (C1.) and (C2.) are fulfilled, the inequality (7) is fulfilled with κ = 1 , 2 z D 1 / 2 and s = log D log z . Then
S ( A , z ) x V ( z ) ( F ( s ) + o ( 1 ) ) + l L d | P ( z ) λ l + ( d ) r ( A , d )
and
S ( A , z ) x V ( z ) ( f ( s ) o ( 1 ) ) l L d | P ( z ) λ l ( d ) r ( A , d )
where L 1 , λ l ± are well factorable functions of level D and the functions F ,   f are defined by (11).
The next Lemma gives the explicit form of the functions of the linear sieve for s 6 :
Lemma 3 
([23]). For functions F ( s ) and f ( s ) of the linear sieve the following inequalities
F ( s ) = 2 e γ s if 0 < s 3 ; F ( s ) = 2 e γ s 1 + 2 s 1 log ( t 1 ) t d t if 3 s 5 ; f ( s ) = 2 e γ log ( s 1 ) s , 2 s 4 ; f ( s ) = 2 e γ s log ( s 1 ) + 3 s 1 d t t 2 t 1 log ( u 1 ) u d u if 4 s 6
are fulfilled.
The next Lemma is a fundamental Lemma for the semi-linear sieve:
Lemma 4. 
Suppose that for the set A the conditions (C1.) and (C2.) are fulfilled, the inequality (7) holds with κ = 1 / 2 . Then, there exists an arithmetical functions λ sem ± with the properties (D1.) (D2.) such that
S ( A , P , z ) X V ( z ) f s e m ( s ) + O ( log D ) 1 / 6 d D λ s e m ( d ) r ( A , d ) , S ( A , P , z ) X V ( z ) F s e m ( s ) + O ( log D ) 1 / 6 + d D λ s e m + ( d ) r ( A , d ) ,
where s = log D log z and f s e m , F s e m are continuous functions which satisfy
s F s e m ( s ) = 2 e γ / π if 0 < s 2 , f s e m ( s ) = 0 if 0 < s 1 , 2 s s F s e m ( s ) = f s e m ( s 1 ) , 2 s s f s e m ( s ) = F s e m ( s 1 )
where γ is the Euler constant.
Proof. 
The proof follows from [24] Theorem 11.12–Theorem 11.13 with β = 1 and [24] Chapter 14 (pp. 275–276). □
Let
z = x 1 / δ , 2 δ 6 , P 3 = { p p 3 ( mod 4 ) } , P 3 ( z ) = p z p P 3 p , A = { p 1 x < p 2 x , p 3 ( mod 8 ) } , S ( A , P 3 , z ) = p A ( p 1 , P 3 ( z ) ) = 1 1 .
The following Lemma provides a lower bound for S ( A , P 3 , z ) .
Lemma 5 
([25], Proposition 6). Under condition (12) the inequality
S ( A , P 3 , z ) W ( δ ) + o ( 1 ) x ( log x ) 3 / 2 ,
where
W ( δ ) = A C 3 2 1 δ / 2 d t t ( t 1 ) ;
A = 1 2 2 p 3 ( mod 4 ) 1 1 p 2 1 / 2 ;
C 3 = p 3 ( mod 4 ) 1 1 ( p 1 ) 2
is fulfilled.
We will use the following
Lemma 6 
([25], Lemma 5). Let z = x 1 / δ , 2 δ < 4 ,
L = l = n p 1 | n x 1 2 / δ , p n p 1 ( mod 4 ) , x 1 / δ p 1 < ( x / n ) 1 / 2 , p 1 P 3
and
h ( n ) = p | n 1 1 p 1 1 , C 1 = p 1 ( mod 4 ) 1 1 ( p 1 ) 2 .
Then
L h ( ) log ( x / ) = 1 + o ( 1 ) ( log x ) 1 / 2 · A 2 C 1 2 δ log ( t 1 ) t ( 1 t / α ) 1 / 2 d t .
The following two Lemmas are variations of a Lemma by Dunn:
Lemma 7. 
Let α R { 0 } , 0 < γ < 1 , N , K , D N , c , Z , r is fixed positive integer, ( r , ) = 1 and
W ( N , K , D , γ ) = d D λ ( d ) 0 < | k | K c ( k ) n N n c ( d ) b n e ( α k n γ ) ,
where
| λ ( d ) | 1 , c ( k ) 1 , b n = 1 , if n is prime and n ( r ) ; 0 , otherwise .
Then
W ( N , K , d , γ ) K 2 N 1 γ / 5 + ε .
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
M = N 1 3 γ 5 K 3 5
then, we obtain the estimate
W ( N , K , d , γ ) K 4 / 5 x 1 γ / 5 + ε ,
which is nontrivial for θ < γ 4 .
Lemma 8. 
Let α R { 0 } , b , K , D N , x > 2 , c , Z , r is fixed positive integer, ( r , ) = 1 , 0 < α 1 < α 2 < 1 , 0 < γ < 5 6 and
U ( x , K , D , γ ) = d D λ ( d ) 0 < | k | K c ( k ) x α 1 < b x α 2 η ( b ) n x / b b n c ( d ) n ( r ) ρ ( n ) e ( α k b γ n γ ) ,
where λ ( d ) 1 , c ( k ) 1 , η ( b ) 1 and ρ ( n ) 1 . Then
U ( x , K , D , γ ) K 2 x 1 γ 5 + ε .
Proof. 
First, we note that without loss of generality, we may assume that b n , so b x 1 / 2 and we will assume that α 2 1 / 2 . Next we rewrite the sum U ( x , K , D , γ ) on the type
U ( x , K , D , γ ) = x α 1 < b x α 2 U ( b )
where
U ( b ) = 0 < | k | K c ( k ) n N n ( r ) a n ρ ( n ) e ( α k b γ n γ ) ,
b N x , N N and
a n = d D d | b n c λ ( d ) τ ( b n c ) ε x ε
Following the proof of Lemma 1 [15] for some parameter 1 < M < N , we estimate the sum U ( b ) as
U ( b ) ε , r K M 1 / 2 N 1 / 2 + ε + K 1 / 2 N 3 / 2 γ / 2 + ε b γ / 2 M 1 / 2 + K 2 b γ M 2 N 1 γ .
We put
M = N 1 3 γ 5 b 3 γ 5 .
It follows from the requirement M > 1 , b n and n N that γ < 5 / 6 . Having in mind that b N x , we get
U ( b ) ε K x 1 3 γ / 10 + ε b + K 2 x 1 γ / 5 + ε b
Summing over b in (18), we obtain
U ( x , K , D , γ ) K 2 x 1 γ / 5 + ε
which is our statement. □
Remark 2. 
We will notice that under the strong condition γ < 5 6 θ , we can choose
M = N 1 3 γ 5 K 3 5 b 3 γ 5
and then we obtain the estimate
U ( x , K , D , γ ) K 4 / 5 x 1 γ / 5 + ε ,
which is nontrivial for θ < γ 4 .
We will also need the following two Lemmas.
Lemma 9. 
Let 0 < Δ < 1 4 , x > 2 and K = Δ 1 log 2 x . Then there exists periodic with period 1 function χ ( t ) such that:
0 < χ ( t ) 1 f o r Δ < t < Δ , χ ( t ) = 0 f o r Δ t 1 Δ ,
and χ ( t ) admits a Fourier expansion
χ ( t ) = Δ + Δ | k | > 0 g ( k ) e ( k t ) ,
where the Fourier coefficients satisfy
g ( k ) 1 f o r a l l k 0 , Δ | k | > K | g ( k ) | x 1 .
Proof. 
Such a function is a consequence of Vinogradov’s Lemma (see Chapter 1, [26]). □
Lemma 10. 
Let 0 < Δ < 1 4 , x > 2 , K = Δ 1 log 2 x , D 2   α , β , γ R , α 0 , 0 < γ < 5 6 , ξ is fixed real number, 0 < α 1 < α 2 < 1 , c , Z , r is fixed positive integer, ( r , ) = 1 , λ ( d ) 1 , c ( k ) 1 , η ( b ) 1 and ρ ( n ) 1 . Then for the periodic function χ ( t ) from Lemma 9 the equality
d D λ ( d ) x α 1 b < x α 2 η ( b ) n x b b n c ( d ) n ( r ) ρ ( n ) χ α ( b n + ξ ) γ + β = d D λ ( d ) x α 1 b < x α 2 η ( b ) n x b b n c ( d ) n ( r ) ρ ( n ) χ α ( b n ) γ + β + O ( K 2 x 1 γ / 5 + ε )
is fulfilled.
Proof. 
From Lemma 9 we get that
χ ( α ( b n + ξ ) γ + β ) = Δ + Δ 0 < | k | < K g 1 ( k ) e α k ( b n + ξ ) γ + k β + O 1 x , χ ( α ( b n ) γ + β ) = Δ + Δ 0 < | k | < K g 2 ( k ) e α k ( b n ) γ + k β + O 1 x ,
where g 1 ( k ) and g 2 ( k ) satisfy (20). Let g ˜ ( k ) = g 2 ( k ) g 1 ( k ) e ( β k ) . We have that g ˜ ( k ) 1 . From (21) we get
χ ( α ( n b + ξ ) γ + β ) χ ( α ( b n ) γ + β ) = Δ 0 < | k | < K g ˜ ( k ) e α k ( b n ) γ + O Δ 0 < | k | < K | g ˜ 1 ( k , b , n ) | ,
where
g ˜ 1 ( k , b , n ) = g 1 ( k ) e ( β k ) e α k ( b n + ξ ) γ e α k ( b n ) γ | k | . | ( b n + ξ ) γ ( b n ) γ | .
So
d D λ ( d ) x α 1 b < x α 2 η ( b ) n x b b n c ( d ) n ( r ) ρ ( n ) χ ( α ( n b + ξ ) γ + β ) χ ( α ( b n ) γ + β ) = O ( R 1 ) + O ( R 2 ) ,
where
R 1 = Δ 0 < | k | < K g ˜ ( k ) d D λ ( d ) x α 1 b < x α 2 η ( b ) n x b b n c ( d ) n ( r ) ρ ( n ) e α k ( b n ) γ R 2 = Δ 0 < | k | < K d D x α 1 b < x α 2 n x b b n c ( d ) n ( r ) | g ˜ 1 ( k , b , n ) |
and g ˜ 1 ( k , b , n ) satisfy (22). To sum R 1 , we apply Lemma 8 and get
R 1 K 2 x 1 γ / 5 + ε .
In sum R 2 we put m = b n and get
R 2 Δ 0 < | k | < K d D m x m c ( d ) τ ( m ) | k | . | ( m + ξ ) γ m γ |
From τ ( m ) m ε x ε and | ( m + ξ ) γ m γ | x γ 1 we receive
R 2 Δ x γ 1 + ε 0 < k < K k d D m x m c ( d ) 1 Δ K 2 x γ + ε .
From (23), (24), and (26), we obtain our statement. □
Remark 3. 
We notice that if we use result in Remark 2 we get that
d D λ ( d ) x α 1 b < x α 2 η ( b ) n x b b n c ( d ) n ( r ) ρ ( n ) χ α ( b n + ξ ) γ + β = d D λ ( d ) x α 1 b < x α 2 η ( b ) n x b b n c ( d ) n ( r ) ρ ( n ) χ α ( b n ) γ + β + O ( K 4 / 5 x 1 γ / 5 + ε ) ,
whit γ and θ satisfying (4).

4. Proof of the Theorem 1

We will prove that there are infinitely many primes p such that | | α p γ + β | | < p θ and p + 2 = P 2 .
First, using the ideas of Chen (see [11]), we consider the sum
S = p x ( p + 2 , P ( z ) ) = 1 χ ( α p γ + β ) ( 1 1 2 z p 1 < x 1 / 3 p 1 p + 2 1 1 2 z p 1 < x 1 / 3 x 1 / 3 p 2 < ( x / p 1 ) 1 / 2 p 3 p 2 p + 2 = p 1 p 2 p 3 1 ) .
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:
0 < θ < γ 10 , 8 < δ < 10 ,
where δ will be chosen later in the discussion.
We will notice that the expression in brackets is
  • 1 if p + 2 has no prime divisors smaller than x 1 / 3 ;
  • 1 2 if p + 2 has exactly one prime divisor in the interval [ z , x 1 / 3 ) and one prime divisor greater than x 1 / 3 ;
  • ≤0 in all other cases.
So, the weight of p is positive only if
p + 2 = P 2 and | | α p γ + β | | < Δ .
Therefore, it is sufficient to demonstrate that S > 0 .
Our next step is to express S in the form (see (27)):
S = S 1 1 2 S 2 1 2 S 3 ,
where
S 1 = p x ( p + 2 , P ( z ) ) = 1 χ ( α p γ + β ) , S 2 = z p 1 < x 1 / 3 p x ( p + 2 , P ( z ) ) = 1 p 2 ( p 1 ) χ ( α p γ + β ) , S 3 = z p 1 < x 1 / 3 x 1 / 3 p 2 < ( x p 1 ) 1 2 p 3 p 2 p x p + 2 = p 1 p 2 p 3 χ ( α p γ + β ) .
We will estimate the sums S 1 ( x ) , S 2 ( x ) , and S 3 ( x ) separately, the first one from below and the other two from above.

4.1. Estimate of Sum S 1

To sum S 1 , 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 D 1 with
D 1 = x 4 / 7 ε , z = x 1 / δ , and s 1 = log D 1 log z
and
ω ( d ) = 0 , if 2 | d , d φ ( d ) , otherwise
From the Fourier expansion (19) of the function χ ( α p γ + β ) and the inequalities (20), we obtain:
S 1 Δ S 1 + E 1 + R 1 + O 1 ,
where
S 1 = Li ( x ) V ( z ) f ( s 1 ) o ( 1 ) , R 1 = d x 4 / 7 ε d | P ( z ) λ ( d ) ( p x p 2 ( d ) 1 Li x φ ( d ) ) , E 1 = d x 4 / 7 ε d | P ( z ) λ ( d ) 0 < | k | < K c k p x p 2 ( d ) e ( α k p γ )
and
V ( z ) = 2 < p < z 1 1 p 1 = 2 C 2 e γ log z 1 + O 1 log z , C 2 = p 3 1 1 ( p 1 ) 2 0.660161815846869
As
R 1 = d x 4 / 7 ε λ ( d ) p 2 x p 2 ( d ) 1 Li ( 2 x ) φ ( d ) d x 4 / 7 ε λ ( d ) p x p 1 ( d ) 1 Li ( x ) 4 φ ( d )
from Theorem 5, we get
R 1 x ( log x ) A .
Applying Lemma 7 with r = 1 and using (28), we obtain
E 1 K 2 N 1 γ / 5 + ε x ( log x ) A .
Using (31), (32), (34), (35), and Lemma 3, we get
S 1 2 e γ Δ Li ( x ) V ( z ) s 1 ( log ( s 1 1 ) + 3 s 1 1 d t t 2 t 1 log ( u 1 ) u d u ) + O x log 3 x .

4.2. Estimate of Sum S 2

To the inner sum in S 2 , we apply upper bound linear sieve (see Lemma 1) with
D 2 = x 1 / 2 ε p 1 and z = x 1 / δ .
Let λ + ( d ) be upper bounds of Rosser’s weights of level D 2 . Using the Fourier expansion (19) of function χ ( α p γ + β ) and the inequalities (20), we obtain
S 2 Δ S 2 + E 2 + R 2 + O 1 ,
where
S 2 = Li ( x ) z p 1 < x 1 / 3 1 p 1 1 d D 2 d | P ( z ) λ + ( d ) φ ( d ) R 2 = z p 1 < x 1 / 3 d D 2 d | P ( z ) λ + ( d ) p x p 2 ( p 1 d ) 1 Li x φ ( d ) E 2 = 0 < | k | < K c k z p 1 < x 1 / 3 d D 2 d | P ( z ) λ + ( d ) p x p 2 ( p 1 d ) e ( α k p γ )
We can rewrite the sum R 2 in the type
R 2 = q x 1 / 2 ε υ ( q ) p x p 2 ( q ) 1 Li x φ ( q ) ,
where
υ ( q ) = λ + ( d ) , if q = d p 1 , d | P ( z 2 ) , z 2 p 1 < x 1 / 3 , 0 , otherwise .
from
R 2 q x 1 / 2 ε ν ( q ) | p 2 x p 2 ( d ) 1 Li ( 2 x ) φ ( d ) | + q x 1 / 2 ε ν ( q ) | p x p 1 ( d ) 1 Li ( x ) 4 φ ( d ) |
and from Bombieri–Vinogradov’s theorem (see Theorem 4), we get
R 2 x ( log x ) A .
Using the notation (39), Lemma 7 with r = 1 , and restriction (5), we get
E 2 = 0 < | k | < K c k q x 1 / 2 ε υ ( q ) p x p 2 ( q ) e ( α k p γ ) K 2 x 1 γ / 5 + ε x ( log x ) A .
Let
s 2 = δ 2 ε δ .
First, we apply linear sieve (Lemma 1) to sum S 2 :
S 2 Li ( x ) V ( z ) z p < x 1 / 3 1 p F s 2 δ log p log x + O x log 3 x .
and then the Abel transformation:
S 2 Li ( x ) V ( z ) z x 1 / 3 1 t log t F s 2 δ log t log x d t + O x log 3 x Li ( x ) V ( z ) 1 / δ 1 / 3 F ( s 2 δ u ) u d u + O x log 3 x .
Finally, from Lemma 3 and the inequalities (37), (38), and (40), we get
S 2 2 e γ Δ Li ( x ) V ( z ) s 2 ( log s 2 1 1 / 2 3 ε + log δ s 2 δ 2 s 2 2 log ( u 1 ) u d u δ 1 / δ 1 2 3 δ ε log s 2 δ u log u log s 2 δ u 2 s 2 δ u 1 d u ) + O x log 3 x .

4.3. Estimate of Sum S 3

It is not difficult to see that
S 3 z p 1 < x 1 / 3 x 1 / 3 p 2 < ( x / p 1 ) 1 / 2 p 3 x p 1 p 2 ( p 1 p 2 p 3 2 , P ( z ) ) = 1 χ ( α ( p 1 p 2 p 3 2 ) γ + β ) .
Next, we apply the upper bound linear sieve (see Lemma 1) with λ + ( d ) —upper bounds Rosser’s weights of level D 2 = x 1 / 2 ε and z = x 1 / δ :
S 3 d D 2 λ + ( d ) z p 1 < x 1 / 3 x 1 / 3 p 2 < ( x / p 1 ) 1 / 2 p 3 x p 1 p 2 p 1 p 2 p 3 2 ( d ) χ ( α ( p 1 p 2 p 3 2 ) γ + β ) d D 2 λ + ( d ) z x 1 / 3 b < x 2 / 3 η ( b ) p 3 x b b p 3 2 ( d ) χ ( α ( b p 3 2 ) γ + β ) ,
where
η ( b ) = 1 , if b = p 1 p 2 , z p 1 < x 1 / 3 , x 1 / 3 p 2 < ( x / p 1 ) 1 / 2 ; 0 , otherwise
To the last sum, we apply Lemma 10 and get
S 3 S ˜ 3 + O ( K 2 x 1 γ / 5 + ε ) ,
where
S ˜ 3 = d D 2 λ + ( d ) z x 1 / 3 b < x 2 / 3 h ( b ) p 3 x b b p 3 2 ( d ) χ ( α ( b p 3 ) γ + β )
Next, using Fourier expansion (19) of function χ , the inequalities (20), and (45), we obtain
S ˜ 3 Δ S 3 + E 3 + R 3 ,
where
S 3 d x 1 / 2 ε d | P ( z ) λ + ( d ) φ ( d ) z p 1 < x 1 / 3 x 1 / 3 p 2 < ( x / p 1 ) 1 / 2 L i x p 1 p 2 , R 3 = d x 1 / 2 ε d | P ( z ) λ + ( d ) z x 1 / 3 b < x 2 / 3 η ( b ) ( p 3 x b b p 3 2 ( d ) 1 Li ( x / b ) φ ( d ) ) , E 3 = z x 1 / 3 b < x 2 / 3 η ( b ) 0 < | k | < K c k d x d | P ( z ) λ ( d ) p 3 x b b p 3 2 ( d ) e ( α b γ k p 3 γ ) .
It is obvious that
R 3 d x 1 / 2 ε d | P ( z ) max a m o d d | z x 1 / 3 b < x 2 / 3 η ( b ) ( p 3 2 x b b p 3 a ( d ) 1 Li ( x / b ) φ ( d ) ) | + d x 1 / 2 ε d | P ( z ) max a m o d d | z x 1 / 3 b < x 2 / 3 η ( b ) ( p 3 x b b p 3 a ( d ) 1 Li ( x / b ) φ ( d ) ) |
Then, from Theorem 6, we get
R 3 x ( log x ) A .
To estimate the sum E 3 , we apply Lemma 8 with r = 1 , and from the restriction (5), we get
E 3 K 2 x 1 γ / 5 + ε x ( log x ) A .
To sum S 3 , we apply Lemma 1 with s 2 satisfying (41):
S 3 x V ( z ) F ( s 2 ) z p 1 < x 1 / 3 1 p 1 x 1 3 p 2 < ( x / p 1 ) 1 2 1 p 2 ( log x log p 1 log p 2 ) + O x log 3 x .
Then, by applying Abel’s identity twice, we obtain:
S 3 x V ( z ) F ( s 2 ) log x z p 1 < x 1 / 3 1 p 1 1 / 3 1 2 1 log p 1 log x 1 u ( 1 log p 1 log x u ) d u + O x log 3 x = x V ( z ) F ( s 2 ) log x 1 / δ 1 / 3 log ( 2 3 u ) u ( 1 u ) d u + O x log 3 x .
From inequalities (46), (48)–(50) follows
S 3 Δ x V ( z ) F ( s 2 ) log x 1 / δ 1 / 3 log ( 2 3 u ) u ( 1 u ) d u + O x log 3 x .

4.4. Estimate of Sum S

Now from (29), (36), (42), (51) we get
S Δ x V ( z ) log x ( 2 e γ log ( s 1 1 ) s 1 + 2 e γ s 1 3 s 1 1 d t t 2 t 1 log ( u 1 ) u d u 2 e γ s 2 log s 2 1 1 / 2 3 ε 2 e γ log δ s 2 δ s 2 2 s 2 2 log ( u 1 ) u d u + 2 e γ δ s 2 1 / δ 1 2 3 δ ε log ( s 2 δ u ) log u log ( s 2 δ u 2 ) s 2 δ u 1 d u F ( s 2 ) 1 / δ 1 / 3 log ( 2 3 u ) u ( 1 u ) d u )
So for δ = 9 and ε = 0.0001 the inequality
S c Δ x log 2 x
is fulfilled for a small c > 0 . Theorem 1 is proved.
If, in the estimates of E 2 and E 3 , 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 p = a 2 + b 2 + 1 and such that | | α p γ + β | | < p θ .
We will utilize the fact that if p 1 = a 2 + b 2 and ( a , b ) = 1 , then p 1 has no prime factors belonging to P 3 = { p | p 3 ( mod 4 ) } . Our purpose will be an evaluation of the sum
S ( x ) = p x | | α p γ + β | | < Δ ( p 1 , P 3 ) = 1 1 .
From here to the end of the paragraph, we will use the notations (12). It is not difficult to see that
S ( x ) p x p 3 ( 8 ) ( p 1 , P 3 ( z ) ) = 1 χ ( α p γ + β ) 1 A ( p , z , 2 x ) = S 1 ( x ) S 2 ( x ) ,
where
A ( p , z , 2 x ) = 1 , if there exist p 1 P 3 , z p 1 2 x , p 1 | p 1 ; 0 , otherwise .
and
S 1 ( x ) = p x p 3 ( 8 ) ( p 1 , P 3 ( z ) ) = 1 χ ( α p γ + β ) , S 2 ( x ) = p x p 3 ( 8 ) ( p 1 , P 3 ( z ) ) = 1 A ( p , z , 2 x ) χ ( α p γ + β ) .
To prove our assertion, it is sufficient to verify that S 1 ( x ) S 2 ( x ) > 0 . We will estimate the sums S 1 ( x ) and S 2 ( x ) separately, from below and above, respectively.

5.1. Estimation of Sum S 1 ( x )

To sum S 1 ( x ) , we apply a half-dimensional sieve. Let λ s e m be lower bound weights of half dimensional sieve of order D = x 1 / 2 ε . Then
S 1 ( x ) d D d | P 3 ( z ) λ s e m ( d ) p x p 1 ( d ) p 3 ( 8 ) χ ( α p γ + β )
Applying the Fourier expansion (19) and the inequalities (20), we obtain:
S 1 Δ S s e m + E s e m + R s e m + O 1 ,
where
S s e m = Li ( 2 x ) Li ( x ) 4 d D d | P 3 ( z ) λ s e m ( d ) φ ( d ) , R s e m = d D d | P 3 ( z ) λ s e m ( d ) ( p x p 1 ( d ) p 3 ( 8 ) 1 Li ( 2 x ) Li ( x ) 4 φ ( d ) ) , E s e m = d D d | P 3 ( z ) λ s e m ( d ) 0 < | k | K c ( k ) p x p 1 ( d ) p 3 ( 8 ) e ( α k p γ ) .
It is clear that S s e m = S ( A , P 3 , z ) (see (12)). Then, from Lemma 5, we get
S s e m A C 3 x 2 ( log x ) 3 / 2 1 δ / 2 d t t ( t 1 ) + o x ( log x ) 3 / 2
with A and C 3 consequently defined by (13) and (14).
As
R s e m d D | p x p 1 ( d ) p 3 ( 8 ) 1 Li ( x ) 4 φ ( d ) | + d D | p 2 x p 1 ( d ) p 3 ( 8 ) 1 Li ( 2 x ) 4 φ ( d ) | d 8 D max a m o d 8 d | p x p a ( 8 d ) 1 Li ( x ) 4 φ ( d ) | + d 8 D max a m o d 8 d | p 2 x p a ( 8 d ) 1 Li ( 2 x ) 4 φ ( d ) |
from Bombieri–Vinogradov’s Theorem (Theorem 4), it follows that
R s e m x ( log x ) A .
To estimate the sum E s e m ( x ) , we apply Lemma 7 for r = 8 . Using (5) we obtain
E s e m x ( log x ) A .
From (54)–(57) it follows that
S 1 ( x ) A C 3 Δ x 2 ( log x ) 3 / 2 1 δ / 2 d t t ( t 1 ) + o x ( log x ) 3 / 2

5.2. Estimation of Sum S 2

Having in mind the definition (53) of A ( p , z , 2 x ) , we observe that S 2 ( x ) is the sum over that primes p such that p 1 has prime divisor of set [ z , 2 x ] P 3 . As each element p 1 A is divisible by an even number of primes from P 3 and 2 p 1 , we conclude that S 2 ( x ) is the sum over prime numbers of the form p = 1 + 2 n p 1 p 2 whith p 1 , p 2 P 3 , p 2 p 1 x 1 / δ , and n is an integer divisible only by primes of the form p 1 ( mod 4 ) . So
S 2 ( x ) = x < p < 2 x p = 1 + 2 n p 1 p 2 p 1 p 2 3 ( 4 ) q | n q 1 ( 4 ) χ ( α p γ + β )
From p = 1 + 2 n p 1 p 2 2 x follows z p 1 x n 1 / 2 , n x z 2 . So
S 2 ( x ) n x z 2 q | n q 1 ( 4 ) z p 1 x n 1 / 2 p 1 3 ( 4 ) p 2 x 2 n p 1 p 2 3 ( 4 ) ( 1 + 2 n p 1 p 2 , P ( z ) ) = 1 χ ( α ( 1 + 2 n p 1 p 2 ) γ + β ) .
Let b = n p 1 and let
η ( b ) = 1 , if b = n p 1 , z p 1 x n 1 / 2 , p 1 3 ( 4 ) , ( n , P 3 ( z ) ) = 1 0 , otherwise
Then z b x / z and
S 2 ( x ) z < b < x / z η ( b ) p 2 x 2 b ( 1 + 2 b p 2 , P ( z ) ) = 1 p 2 3 ( 4 ) χ ( α ( 2 b p 2 + 1 ) γ + β ) .
To the sum over p 2 in the above inequality, we apply the upper bound linear sieve (see Lemma 1) with λ + ( d ) —upper bounds Rosser’s weights of level D = x 1 / 2 ε and z = x 1 / δ :
S 2 ( x ) d D λ + ( d ) z < b < x / z η ( b ) p 2 x 2 b 2 b p 2 1 ( d ) p 2 3 ( 4 ) χ ( α ( 2 b p 2 + 1 ) γ + β ) .
Then, with the help of Lemma 10, we get
S 2 ( x ) S 2 ( x ) + O ( K 2 x 1 γ / 5 + ε ) ,
where
S 2 ( x ) = d D 2 λ + ( d ) z < b < x / z η ( b ) p 2 x 2 b 2 b p 2 1 ( d ) p 2 3 ( 4 ) χ ( α ( 2 b p 2 ) γ + β )
To sum S 2 ( x ) , we apply the Fourier expansion (19) and the inequalities (20):
S 2 ( x ) Δ S 2 ( x ) + R 2 ( x ) + E 2 ( x ) ,
where
S 2 ( x ) = d D d | P ( z ) λ + ( d ) φ ( d ) z < b < x / z ( b , d ) = 1 η ( b ) L i ( x / 2 b ) 2 R 2 ( x ) = d D d | P ( z ) λ + ( d ) ( z < b < x / z ( b , d ) = 1 η ( b ) p 1 x 2 b 2 b p 2 1 ( d ) p 2 3 ( 4 ) 1 L i ( x / 2 b ) 2 φ ( d ) ) E 2 ( x ) = z < b < x / z ( b , d ) = 1 η ( b ) d D d | P 3 ( z ) λ + ( d ) 0 < | k | K c ( k ) p 1 x 2 b 2 a p 2 1 ( d ) p 2 3 ( 4 ) e ( α b γ k p 1 γ )
We evaluate the sum R 2 ( x ) in the same way as sum R 3 (see (47)) and get
R 2 ( x ) x ( log x ) A .
To estimate sum E 2 ( x ) we apply Lemma 8 with r = 4 and get
E 2 ( x ) x ( log x ) A .
With the help of Lemma 1 for sum S 2 ( x ) we get
S 2 ( x ) = z < b < x / z η ( b ) L i ( x / 2 b ) 2 d D ( b , d ) = 1 λ + ( d ) φ ( d ) x 4 z < b < x / z η ( b ) b log ( x / 2 b ) p | b p < z 1 1 p 1 1 V ( z ) F ( s ) + o ( 1 ) ,
where s = log D log z . Assuming 2 < δ < 3 , from b = n p 1 with p 1 > z , n < x z 2 and x z 2 < z , the conditions p | b and p < z in the above product are equivalent to p | n . So, using notation (15), we get
p | b p < z 1 1 p 1 1 = p | n 1 1 p 1 1 = h ( n ) .
From b = n p 1 and p 1 > z follows
h ( b ) = h ( n ) 1 1 p 1 1 = h ( b ) 1 + O 1 z .
So
S 2 ( x ) x 4 V ( z ) F ( s ) + o ( 1 ) z < b < x / z η ( b ) h ( b ) b log ( x / 2 b ) .
Using Lemma 6, we obtain
S 2 ( x ) x 4 V ( z ) F ( s ) + o ( 1 ) 1 + o ( 1 ) ( log x ) 1 / 2 · A 2 C 1 2 δ log ( t 1 ) t ( 1 t / δ ) 1 / 2 ,
From (14), (15), (33), it follows that C 2 = C 1 C 3 and
V ( z ) = 2 e γ C 1 C 3 log z .
Now, with the help of Lemma 3 and choice D = x 1 / 2 ε , we receive
S 2 ( x ) 2 e γ C 1 C 3 x 4 log z · 2 e γ log z log D · 1 + o ( 1 ) ( log x ) 1 / 2 · A 2 C 1 2 δ log ( t 1 ) t ( 1 t / δ ) 1 / 2 A C 3 x 2 ( log x ) 1 / 2 log D 2 δ log ( t 1 ) t ( 1 t / δ ) 1 / 2 d t A C 3 x ( 1 2 ε ) ( log x ) 3 / 2 2 δ log ( t 1 ) t ( 1 t / δ ) 1 / 2 d t .
From (59)–(63), it follows that
S 2 ( x ) A C 3 Δ x ( 1 2 ε ) ( log x ) 3 / 2 2 δ log ( t 1 ) t ( 1 t / δ ) 1 / 2 d t .
From (58) and (64), we get
S ( x ) A C 3 Δ x ( log x ) 3 / 2 1 2 1 δ / 2 d t t ( t 1 ) 1 1 2 ε 2 δ log ( t 1 ) t ( 1 t / δ ) 1 / 2 d t .
Choosing δ = 2.0005 and ε = 0.00001 , we obtain the following.
S ( x ) c Δ x ( log x ) 3 / 2
with c > 0 , 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 α p γ + β 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 γ ( 0 , 1 ) .
  • Extension of the results to the case γ ( 1 , 2 ) and to the more complex case γ R N . 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

  1. 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]
  2. 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]
  3. 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]
  4. Harman, G.; Lewis, P. Gaussian primes in narrow sectors. Mathematika 2001, 48, 119–135. [Google Scholar] [CrossRef]
  5. Balog, A. On the fractional part of pθ. Arch. Math. 1983, 40, 434–440. [Google Scholar] [CrossRef]
  6. Balog, A. On the distribution of pθ mod 1. Acta Math. Hung. 1985, 45, 179–199. [Google Scholar] [CrossRef]
  7. Balog, A.; Harman, G. On mean values of Dirichlet polynomials. Arch. Math. 1991, 57, 581–587. [Google Scholar] [CrossRef]
  8. Harman, G. On the distribution of p modulo one. Mathematika 1983, 30, 104–116. [Google Scholar] [CrossRef]
  9. Harman, G. Fractional and integral parts of pλ. Acta Arith. 1991, 58, 141–152. [Google Scholar] [CrossRef]
  10. Baier, S. On the pλ problem. Acta Arith. 2004, 113, 77–101. [Google Scholar] [CrossRef]
  11. 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]
  12. Cai, Y. On the distribution of p modulo one involving primes of special type. Stud. Sci. Math. Hung. 2013, 50, 470–490. [Google Scholar]
  13. Li, R. A remark on the distribution of p modulo one involving primes of special type. arXiv 2024, arXiv:2401.01351v1. [Google Scholar]
  14. Li, R. A remark on the distribution of p modulo one involving primes of special type II. arXiv 2024, arXiv:2401.01351v2. [Google Scholar]
  15. Dunn, A. On the distribution of αpγ+β modulo one. J. Number Theory 2017, 176, 67–75. [Google Scholar] [CrossRef]
  16. 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]
  17. 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]
  18. 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]
  19. Bombieri, E.; Friedlander, J.B.; Iwaniec, H. Primes in arithmetic progressions to large moduli. Arch. Math. 1986, 156, 203–251. [Google Scholar] [CrossRef]
  20. Pan, C.D.; Pan, C.B. Goldbach Conjecture; Science Press: Beijing, China, 1981. [Google Scholar]
  21. Iwaniec, H. Rosser’s sieve. Acta Arith. 1980, 36, 171–202. [Google Scholar] [CrossRef]
  22. Iwaniec, H. A new form of the error term in the linear sieve. Acta Arith. 1980, 37, 307–320. [Google Scholar] [CrossRef]
  23. Cai, Y. On Chen’s theorem (II). J. Number Theory 2008, 128, 1336–1357. [Google Scholar] [CrossRef]
  24. Friedlander, J.; Iwaniec, H. Opera de Cribro. In American Mathematical Society Colloquium Publications; American Mathematical Society: Providence, RI, USA, 2010; Volume 57. [Google Scholar]
  25. Matomäki, K. Prime numbers of the form p = m2 + n2 + 1 in short intervals. Acta Arith. 2007, 128, 193–200. [Google Scholar] [CrossRef]
  26. 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.

Share and Cite

MDPI and ACS Style

Georgieva, A.; Todorova, T.L. Distribution Modulo One of αpγ + β for Special Classes of Primes. Axioms 2025, 14, 532. https://doi.org/10.3390/axioms14070532

AMA Style

Georgieva A, Todorova TL. Distribution Modulo One of αpγ + β for Special Classes of Primes. Axioms. 2025; 14(7):532. https://doi.org/10.3390/axioms14070532

Chicago/Turabian Style

Georgieva, Atanaska, and Tatiana L. Todorova. 2025. "Distribution Modulo One of αpγ + β for Special Classes of Primes" Axioms 14, no. 7: 532. https://doi.org/10.3390/axioms14070532

APA Style

Georgieva, A., & Todorova, T. L. (2025). Distribution Modulo One of αpγ + β for Special Classes of Primes. Axioms, 14(7), 532. https://doi.org/10.3390/axioms14070532

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop