Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

On a binary Diophantine inequality involving prime numbers

  • Let N denote a sufficiently large real number. In this paper, we prove that for 1<c<10434977419, c43, for almost all real numbers T(N,2N] (in the sense of Lebesgue measure), the Diophantine inequality |pc1+pc2T|<T910c(10434977419c) is solvable in primes p1,p2. In addition, it is proved that the Diophantine inequality |pc1+pc2+pc3+pc4N|<N910c(10434977419c) is solvable in primes p1,p2,p3,p4. This result constitutes a refinement upon that of Li and Cai.

    Citation: Jing Huang, Qian Wang, Rui Zhang. On a binary Diophantine inequality involving prime numbers[J]. AIMS Mathematics, 2024, 9(4): 8371-8385. doi: 10.3934/math.2024407

    Related Papers:

    [1] Jing Huang, Ao Han, Huafeng Liu . On a Diophantine equation with prime variables. AIMS Mathematics, 2021, 6(9): 9602-9618. doi: 10.3934/math.2021559
    [2] Bingzhou Chen, Jiagui Luo . On the Diophantine equations $x^2-Dy^2=-1$ and $x^2-Dy^2=4$. AIMS Mathematics, 2019, 4(4): 1170-1180. doi: 10.3934/math.2019.4.1170
    [3] Jinyan He, Jiagui Luo, Shuanglin Fei . On the exponential Diophantine equation $ (a(a-l)m^{2}+1)^{x}+(alm^{2}-1)^{y} = (am)^{z} $. AIMS Mathematics, 2022, 7(4): 7187-7198. doi: 10.3934/math.2022401
    [4] Cheng Feng, Jiagui Luo . On the exponential Diophantine equation $ \left(\frac{q^{2l}-p^{2k}}{2}n\right)^x+(p^kq^ln)^y = \left(\frac{q^{2l}+p^{2k}}{2}n\right)^z $. AIMS Mathematics, 2022, 7(5): 8609-8621. doi: 10.3934/math.2022481
    [5] Liuying Wu . On a Diophantine equation involving fractional powers with primes of special types. AIMS Mathematics, 2024, 9(6): 16486-16505. doi: 10.3934/math.2024799
    [6] Xinyan Li, Wenxu Ge . A Diophantine approximation problem with unlike powers of primes. AIMS Mathematics, 2025, 10(1): 736-753. doi: 10.3934/math.2025034
    [7] Wenpeng Zhang, Jiafan Zhang . The hybrid power mean of some special character sums of polynomials and two-term exponential sums modulo $ p $. AIMS Mathematics, 2021, 6(10): 10989-11004. doi: 10.3934/math.2021638
    [8] Ashraf Al-Quran . T-spherical linear Diophantine fuzzy aggregation operators for multiple attribute decision-making. AIMS Mathematics, 2023, 8(5): 12257-12286. doi: 10.3934/math.2023618
    [9] Shujie Zhou, Li Chen . On the sixth power mean values of a generalized two-term exponential sums. AIMS Mathematics, 2023, 8(11): 28105-28119. doi: 10.3934/math.20231438
    [10] Wenpeng Zhang, Yuanyuan Meng . On the sixth power mean of one kind two-term exponential sums weighted by Legendre's symbol modulo $ p $. AIMS Mathematics, 2021, 6(7): 6961-6974. doi: 10.3934/math.2021408
  • Let N denote a sufficiently large real number. In this paper, we prove that for 1<c<10434977419, c43, for almost all real numbers T(N,2N] (in the sense of Lebesgue measure), the Diophantine inequality |pc1+pc2T|<T910c(10434977419c) is solvable in primes p1,p2. In addition, it is proved that the Diophantine inequality |pc1+pc2+pc3+pc4N|<N910c(10434977419c) is solvable in primes p1,p2,p3,p4. This result constitutes a refinement upon that of Li and Cai.



    The Waring-Goldbach problem is that every natural number n can be represented as the type

    n=pk1++pks,

    where s and k are given positive integers and p1,,ps are prime variables. This well-known problem has spawned many analogues, which has attracted a large number of scholars to investigate and obtain many celebrated results. For instance, given c>1 is not an integer and ε>0. For every sufficiently large real N, suppose that h(c) is the smallest natural number s satisfying the inequality

    |pc1+pc2++pcsN|<ε (1.1)

    with solutions in primes p1,,ps. Piatetski-Shapiro showed in [13] that

    lim supch(c)clogc4,

    and h(c)5 holds for 1<c<32. Based on this result and Vinogradov's three prime theorem, we can conjecture that h(c)3 for c near one. Tolev [14] first proved this conjecture. More precisely, Tolev [15] showed that, if 1<c<1514, the inequality has solutions in primes p1,p2,p3:

    |pc1+pc2+pc3N|<ε,

    where ε=N1c(1514c)log9N. Subsequently, this result was constantly improved by several authors (see [1,2,3,4,7,8]).

    In 1999, Laporta [10] considered the corresponding binary problem. If 1<c<1514 fixed and ε=T11514clog8T, the following inequality

    |pc1+pc2T|<ε (1.2)

    has a solution for all real numbers T(N,2N]T with |T|=O(Nexp(13(logNc)15)). Later, the exponent of c was improved to

    4336=1.944444,   65=1.2,   5944=1.340909

    by Zhai and Cao [16], Kumchev and Laporta [9], and Li and Cai [11] successively.

    In 2003, Zhai and Cao [17] first proved that the inequality

    |pc1+pc2++pc4N|<ε (1.3)

    is solvable, where 1<c<8168. Afterwards, the exponent of c was improved to

    9781=1.197530,   65=1.2,   1193889=1.341957

    by Mu [12], Zhang and Li [18], and Li and Zhang [19] successively.

    Here, we consider the cases s=2 and s=4 in inequality (1.1), and enlarge the exponent of c. Our results are as follows:

    Theorem 1. Assume 1<c<10434977419, c43, and N is a sufficiently large real number. Suppose ε=T910c(10434977419c), and B0(T) is the number of solutions of inequality (1.2). Then, for all real numbers T(N,2N]T with |T|=O(Nexp(13(logNc)15)), we obtain

    B0(T)εT2c1log2T.

    Theorem 2. Assume 1<c<10434977419, c43, and N is a sufficiently large real number. Suppose ε=T910c(10434977419c), and B0(N) is the number of solutions of inequality (1.3). Then, we obtain

    B0(N)εN4c1log4N.

    In this paper, our improvement mainly comes from the estimates of exponential sums. We transform the exponential sum into Type Ⅰ and Type Ⅱ sums by using Heath-Brown's identity. As a result, we improve the previous results by enlarging the upper bound of c. In addition, by using Lemma 2.8, the value of c=43 can be excluded.

    Now, we will give some notations which are required throughout the paper.

    Throughout this paper, suppose that N is a sufficiently large integer, Λ(n) stands for the von Mangoldt function, and |T| is the cardinality of the set T. aA means A<a2A. As usual, the constants in the -symbols and O-terms are absolute or depend only on c.

    In addition, we write

    1<c<10434977419, c43;    X=N1c4,    ι=X50489154838c2,K=X10434977419c,    e(t)=e2πit,    ε=N910c(10434977419c),δ=11000(10434977419c),    E=exp((logNc)15),P=(2E2)13logN,    S(t)=pXe(pct)logp,I(t)=2XXe(uct)du.

    Next, we shall recall some preliminary lemmas that are necessary in this paper.

    Lemma 2.1 ([15, Lemma 1]). Assume that ξ(y) is a function which is ω=[logX] times continuously differentiable and satisfies

    {ξ(y)=1, |y|45ε,0<ξ(y)<1, 45ε<|y|ε,ξ(y)=0, |y|ε.

    For its Fourier transformation

    Ξ(t)=e(ty)ξ(y)dy,

    then

    |Ξ(t)|min(95ε,1π|t|,1π|t|(5ωπ|t|ε)ω).

    Lemma 2.2. ([15, Lemma 14]). If |t|ι, then

    S(t)=I(t)+O(Xexp(log15X)).

    Lemma 2.3 ([5, Lemma 3.1]). There is a trivial bound that

    I(t)X1c|t|1. (2.1)

    Lemma 2.4 ([15, Lemma 7]). There exist the following inequalities

    (i)|t|<ι|S(t)|2dtX2clog3X; (2.2)
    (ii)|t|<ι|I(t)|2dtX2clog3X; (2.3)
    (iii)n+1n|S(t)|2dtXlog3X uniformly in n. (2.4)

    Lemma 2.5. We have

    (i)I2(t)Ξ(t)e(Tt)dtεT2c1, (2.5)
    (ii)I4(t)Ξ(t)e(Nt)dtεX4c. (2.6)

    Proof. The above two inequalities (2.5) and (2.6) can be found in [9] and [17] independently.

    Lemma 2.6 ([6, Lemma 5]). For any complex number αn, we have the inequality

    |Hn2Hαn|2(1+HU)0|u|U(1|u|U)(Hn2Huαn+u¯αn),

    where H1, UH, and ¯αn stands for the conjugate of αn.

    Lemma 2.7 ([11, Lemma 2.3]). Suppose |D|>0 and AA10A, then the inequality

    AaAe(Dac)(|D|Ac)κAλκ+A|D|Ac

    holds for any exponent pair (κ,λ) with 0κ12λ1.

    Lemma 2.8 ([1, Therorem 2]). Suppose τ, υ are real numbers such that

    τυ(τ1)(υ1)(τ2)(τ+υ2)(τ+υ3)(τ+2υ3)(2τ+υ4)0.

    Let

    I=aAα(a)bIae(Daτbυ),

    where D>0, A1, B1, |α(a)|1, and Ia is a subinterval of [B,2B]. Assume G=DAτBυ. For any η>0, then

    I(G314A4156B2956+G15A34B1120+G18A1316B1116+A34B+AB34+G1AB)(AB)η.

    Lemma 2.9 ([10, Lemma 1]).

    V=maxN<v22N2NN|ι<|t|Ke((v1v2)t)dt|dv1logN.

    Lemma 2.10 ([10, Lemma 2]). Let the letters C and R be the sets of complex and real numbers, respectively. Suppose that ϝ1 and ϝ2 are measurable subsets of Rn, and

    gi=(ϝi|g(t)|2dt)12, g,fi=ϝig(t)¯f(t)dt

    stand for the usual norm and inner product in L2(ϝi,C) (i=1,2), respectively.

    Assume ϖ is a measurable complex-valued function defined on ϝ1×ϝ2, then

    supyϝ1ϝ2|ϖ(y,t)|dt<+, suptϝ2ϝ1|ϖ(y,t)|dt<+.

    Hence,

    |ϝ1ϕ(y)ψ,ϖ(y,)2dy|ψ2ϕ1(supyϝ1ϝ1|ϖ(y,),ϖ(y,)2|dy)12,

    where ϕL2(ϝ1,C), ψL2(ϝ2,C).

    In this section, we transform the exponential sum into Type Ⅰ and Type Ⅱ sums by taking advantage of Lemma 3.1.

    Lemma 3.1 ([6, Lemma 3]). For 3<L<M<Q<X, {Q}=12, X64Q2L, Q4L2,and M332X, if G(n) is a complex valued function satisfying |G(n)|1, then the sum

    Xn2XΛ(n)G(n)

    may be decomposed into O(log10X) sums, each either of type I:

    Aa2Aα(a)Bb2BG(ab)

    with B>Q, ABX, |α(a)|aη, or of type II:

    Aa2Aα(a)Bb2Bβ(b)G(ab)

    with LBM, ABX, |α(a)|aη,|β(b)|bη.

    Lemma 3.2. For any η>0, α(a) is a sequence of complex numbers satisfying |α(a)|aη. If ι|t|K and AX36858279056017314356, then

    SI=aAα(a)Xab2Xe(t(ab)c)X14171932031504328589+2η,

    where c(1,10434977419] and c43.

    Proof. Suppose AX368582790510530300123, and we use Lemma 2.7 by choosing the exponent pair (27,47), then

    SIAηaA|Xab2Xe(t(ab)c)|AηaA((|t|Xc)27X27+1|t|Xc1a)X14171932031504328589+2η.

    In addition, suppose X368582790510530300123AX36858279056017314356, then from Lemma 2.8 we derive that

    SI=AηaAa(m)AηXab2Xe(t(ab)c)((KXc)314A314X2956+(KXc)15A15X1120+(KXc)18A18X1116+A14X+A14X34+(ιXc)1X)X2ηX14171932031504328589+2η.

    Combining the above two cases, we complete the proof of this lemma.

    Lemma 3.3. For any η>0, α(a) and β(b) are sequences of complex numbers satisfying |α(a)|aη, |β(b)|bη. If ι|t|K and X1742707721504328589AX4271647518750251190813782635796, then

    SII=A<a2Aα(a)X<ab2Xβ(b)e(t(ab)c)X14171932031504328589+3η.

    Proof. Let U=X1742707721504328589η. Cauchy's inequality and Lemma 2.6 gives us

    |SII|(bIa|β(b)|2)1/2(bIa|A<a2Aα(a)e(t(ab)c)|2)1/2X2η(X2U+XU1uUAa2Au|Eu|)1/2, (3.1)

    where Ia stands for a subinterval of [X2A,2XA], and Eu=bIae(tbc((a+u)cac)).

    Following from Lemma 2.7 and choosing the exponent pair (1331,1631), we obtain the estimate of Eu:

    Eu(|t|Xc1u)1331X1631A1631+1|t|Xc1u.

    Then, taking the estimate of Eu into (3.1), we get

    |SII|X2η(X2U+XU(U4431|K|1331X1331c+331A1531+X1c|ι|1AlogU))1/2X14171932031504328589+3η.

    Lemma 3.4. Assume that η is any arbitrarily small positive number and ι|t|K, then

    S(t)X14171932031504328589+5η,

    where c(1,10434977419] and c43.

    Proof. First of all, we define

    M(t)=nXΛ(n)e(nct).

    Obviously, we can deduce that

    S(t)=M(t)+O(X12). (3.2)

    Suppose

    L=X1742707721504328589, M=X4271647518750251190813782635796, Q=[X23314864516017314356]+12.

    Following from Lemma 3.1 with G(n)=e(tnc), we reduce the sum M(t) of type Ⅰ:

    Aa2Aα(a)Bb2BG(ab), B>Q

    or of type Ⅱ:

    Aa2Aα(a)Bb2Bβ(b)G(ab),LBM.

    From this combined with Lemmas 3.2 and 3.3, we deduce

    M(t)X14171932031504328589+5η.

    Inserting the bound of M(t) into (3.2), we finish the proof of Lemma 3.4.

    In this section, we shall give the details of the proof of Theorem 1.

    Let ξ(y) and Ξ(t) stand for the functions that appear in Lemma 2.1. For T[N,2N], we write

    B(T)=p1,p2X|pc1+pc2T|<ε(logp1)(logp2).

    It suffices to show that B(T)B1(T), where

    B1(T)=X<p1,p22X(logp1)(logp2)e((pc1+pc2T)t)Ξ(t)dt=S2(t)Ξ(t)e(Tt)dt=(|t|ι+ι<|t|K+|t|>K)S2(t)Ξ(t)e(Tt)dt=Q1(T)+Q2(T)+Q3(T).

    In addition, we write

    P(T)=I2(t)e(Tt)Ξ(t)dt, P1(T)=ιιI2(t)Ξ(t)e(Tt)dt.

    Lemma 4.1. We have

    ι<|t|K|S(t)|2|Ξ(t)|dtXlog4X.

    Proof. It follows from Lemma 2.1 and (2.4) that

    ι<|t|K|S(t)|2|Ξ(t)|dtε0n1εn+1n|S(t)|2dt+1ε1nK1nn+1n|S(t)|2dtXlog4X.

    Lemma 4.2. We have

    ι<|t|K|S(t)|4|Ξ(t)|dtε12X100073329693008657178c2+12δ.

    Proof. If V(t) is a continuous function defined for KtK, then we find that

    |ι<|t|KS(t)V(t)dt|=|X<p2X(logp)ι<|t|KV(t)e(pct)dt|X<p2X(logp)|ι<|t|KV(t)e(pct)dt|(logX)X<m2X|ι<|t|KV(t)e(mct)dt|. (4.1)

    Suppose H(t)=mXe(mct). Using Cauchy's inequality, we deduce that

    |ι<|t|KS(t)V(t)dt|X12(logX)|X<m2X|ι<|t|KV(t)e(mct)dt|2|12=X12(logX)|X<m2Xι<|t|KV(t)e(mct)dtι<|y|K¯V(y)e(mcy)dy|12=X12(logX)|ι<|y|K¯V(y)dyι<|t|KV(t)H(ty)dt|12X12(logX)|ι<|y|K|V(y)|dyι<|t|K|V(t)||H(ty)|dt|12. (4.2)

    Then, we estimate the inner integral in (4.2).

    First, we need to consider H(ty). Following from Lemma 2.7 and choosing the exponent pair (1912658293,3136958293), we obtain that the inequality

    H(t)(|t|Xc)1912658293X1224358293+X|t|Xc

    holds for Xc<|t|2K.

    Combining with the trivial upper bound H(ty)X, we get

    H(ty)min((|ty|Xc)1912658293X1224358293+X|ty|Xc,X). (4.3)

    Next, inserting the estimate of H(ty) into the inner integral in (4.2), we find that

    ι<|t|K|V(t)||H(ty)|dtι<|t|K|ty|Xc|V(t)||H(ty)|dt+ι<|t|KXc<|ty|2K|V(t)||H(ty)|dtXι<|t|K|ty|Xc|V(X)|dt+ι<|t|KXc<|ty|2K|V(t)|((|ty|Xc)1912658293X1224358293+1|ty|Xc1)dtXmaxι<|t|K|V(t)||ty|Xcdt+X9812065971504328589ι<|t|K|V(t)|dt (4.4)
    +X1cmaxι<|t|K|V(t)|Xc<|ty|2K1|ty|dtX9812065971504328589ι<|t|K|V(t)|dt+X1c(logX)maxι<|t|K|V(t)|. (4.5)

    From (4.2) and (4.4), we have

    |ι<|t|KS(t)V(t)dt|X24855351863008657178(logX)ι<|t|K|V(t)|dt+X1c2(log32X)|maxι<|t|K|V(t)|ι<|t|K|V(t)|dt|12. (4.6)

    Taking V(t)=|Ξ(t)|¯S(t)|S(t)|, from Lemmas 3.4 and 4.1 and (4.6), we get

    ι<|t|K|Ξ(t)||S(t)|3dt=ι<|t|KV(t)S(t)dtX12427675981504328589(logX)ι<|t|K|Ξ(t)||S(t)|2dt+ε12X29215217921504328589c2+6δ|ι<|t|K|Ξ(t)||S(t)|2dt|12X27470961821504328589log5X+ε12X73473721733008657178c2+7δX27470961821504328589+7δ. (4.7)

    Next, taking V(t)=|Ξ(t)|¯S(t)|S(t)|2, by Lemma 3.4, (4.6), and (4.7), we obtain

    ι<|t|K|S(t)|4|Ξ(t)|dt=ι<|t|KV(t)S(t)dtX12427675981504328589(logX)ι<|t|K|S(t)|3|Ξ(t)|dt+ε12X24200789291002885726c2+8δ|ι<|t|K|S(t)|3|Ξ(t)|dt|12X39898637801504328589+8δ+ε12X100073329693008657178c2+12δε12X100073329693008657178c2+12δ.

    Lemma 4.3 ([11, Lemma 3.3]). We have

    2NN|Q1(T)P1(T)|2dTε2N4c1E13.

    Lemma 4.4. We have

    2NN|Q2(T)|2dTε2N4c1E13.

    Proof. Suppose

    ϝ1={T:TN}, ϝ2={t:ι<|t|K}.

    Taking advantage of Lemma 2.10 with ψ(t)=Ξ(t)S2(t),ϖ(t,T)=e(Tt),ϕ(T)=¯Q2(T), we obtain

    2NN|Q2(T)|2dT=ϝ1¯Q2(T)Ξ(t)S2(t),e(tT)2dT(ϝ2|Ξ(t)S2(t)|2dt)12(ϝ1|¯Q2(T)|2dT)12(suptϝ1ϝ1|e(tT),e(tT)2|dt)12. (4.8)

    According to Lemmas 2.1, 2.9, and 4.2, we get

    2NN|Q2(T)|2dTVι<|t|K|S(t)|4|Ξ(t)|2dtε(logN)ι<|t|K|S(t)|4|Ξ(t)|dtε32X100073329693008657178c2+12δlogNε2N4c1E13.

    Hence, we finish the proof of this lemma.

    Lemma 4.5. We have

    2NN|Q3(T)|2dTN.

    Proof. It follows from the estimate of Ξ(t) in Lemma 2.1 that

    2NN|Q3(T)|2dTN|tK|S2(t)||Ξ(t)|dt|2NX4|tK(5ωπtε)ωdtt|2NX4(5ωπKε)2ωN.

    Lemma 4.6. We have

    2NN|B1(T)P(T)|2dTε2N4c1E13.

    Proof. We obtain

    2NN|B1(T)P(T)|2=2NN|Q1(t)P1(T)+Q2(t)+Q3(t)+P1(T)P(T)|2 (4.9)
    2NN|Q1(T)P1(T)|2dT+2NN|Q2(T)|2dT+2NN|Q3(T)|2dT+2NN|P(T)P1(T)|2dT. (4.10)

    For the last integral, we will use Lemmas 2.1 and 2.3 to estimate and obtain

    2NN|P(T)P1(T)|2dT2NN|t|>ι|I(t)|4|Ξ(t)|2dtdTNX44c|t|>ι|Ξ(t)|2|t|4dtε2NX44cι3. (4.11)

    From (4.9) and (4.11), we have

    2NN|B1(T)P(T)|2dT2NN|Q1(T)P1(T)|2dT+2NN|Q2(T)|2dT+2NN|Q3(T)|2dT+ε2NX44cι3ε2N4c1E13, (4.12)

    where Lemmas 4.3, 4.4, and 4.5 are employed.

    Lemma 4.6 implies

    B1(T)=P(T)+O(εN2c1E19), (4.13)

    where T(N,2N]T with |T|=O(NE1/3).

    Then, it follows from (4.13) and (2.5) that

    B0(T)B(T)log22XB1(T)log22XP(T)log22XεT2c1log2T. (4.14)

    Thus, we finish the proof of Theorem 1.

    Suppose

    B(N)=X<p1,,p42X|pc1++pc4N|<ε(logp1)(logp4).

    It follows from the definition of ξ(y) and Ξ(t) in Lemma 2.1 that

    B(N)B1(N), (5.1)

    where

    B1(N)=S4(t)Ξ(t)e(Nt)dt=(ιι+ι<|t|K+|t|>K)S4(t)Ξ(t)e(Nt)dt=Q1(N)+Q2(N)+Q3(N). (5.2)

    First of all, we need to estimate Q1(N). Let

    P1(N)=ιιI4(t)Ξ(t)e(tN)dt,P(N)=I4(t)Ξ(t)e(tN)dt,

    then we find that

    Q1(N)=ιιS4(t)Ξ(t)e(Nt)dt=P(N)+(P1(N)P(N))+(Q1(N)P1(N)). (5.3)

    For the second integral in (5.3), we use Lemmas 2.1 and 2.3 to estimate and obtain

    |P1(N)P(N)|ιι|I(t)|4|Ξ(t)|dtX44c|t|>ι|Ξ(t)||t|4dtεX44cι3εX4clogX. (5.4)

    For the third integral in (5.3), we use Lemmas 2.1 and 2.2 to estimate and get

    |Q1(N)P1(N)||t|ι|S4(t)I4(t)||Ξ(t)|dtεmaxιtι|S(t)I(t)||t|ι(|S(t)|+|I(t)|)(|S(t)|2+|I(t)|2)dtεXexp(log15X)X|t|ι(|S(t)|2+|I(t)|2)dtεX2exp(log15X)X2c(log3X)εX4cexp(log15X), (5.5)

    where (2.2) and (2.3) in Lemma 2.4 are utilized. Combining (2.6) and (5.3)–(5.5), we derive that

    Q1(N)εX4c. (5.6)

    From Lemma 4.2, we have

    Q2(N)ι<|t|K|S(t)|4|Ξ(t)|dtε12X100073329693008657178c2+12δεX4clogX. (5.7)

    From Lemma 2.1, we obtain

    Q3(N)KK|S4(t)||Ξ(t)|dtX4KK(5ωπ|t|ε)ωdt|t|X4(5ωπKε)ω1. (5.8)

    It follows from (5.2), (5.6)–(5.8) that

    B1(N)εX4c. (5.9)

    From (5.1) and (5.9), we have

    B0(N)B(N)log42XB1(N)log42XεN4c1log4N. (5.10)

    Hence, we finish the proof of Theorem 2.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The paper is supported by National Natural Science Foundation of China (Grant No. 12171286).

    The authors declare that they have no conflict of interest.



    [1] R. Baker, A. Weingartner, A ternary Diophantine inequality over primes, Acta Arith., 162 (2014), 159–196. https://doi.org/10.4064/aa162-2-3 doi: 10.4064/aa162-2-3
    [2] Y. C. Cai, On a Diophantine inequality involving prime numbers, (Chinese), Acta Mathematica Sinica: Chinese Series, 39 (1996), 733–742.
    [3] Y. C. Cai, A ternary Diophantine inequality involving primes, Int. J. Number Theory, 14 (2018), 2257–2268. https://doi.org/10.1142/S1793042118501361 doi: 10.1142/S1793042118501361
    [4] X. D. Cao, W. G. Zhai, A Diophantine inequality with prime numbers, (Chinese), Acta Mathematica Sinica: Chinese Series, 45 (2002), 361–370. https://doi.org/10.12386/A2002sxxb0046 doi: 10.12386/A2002sxxb0046
    [5] S. W. Graham, G. A. Kolesnik, Van der Corpue's method of exponential sums, London: Cambridge University Press, 1991. https://doi.org/10.1017/CBO9780511661976
    [6] D. R. Heath-Brown, The Pjateckiĭ-Šapiro prime number theorem, J. Number theory, 16 (1983), 242–266. https://doi.org/10.1016/0022-314X(83)90044-6 doi: 10.1016/0022-314X(83)90044-6
    [7] A. Kumchev, A Diophantine inequality involving prime powers, Acta Arith., 89 (1999), 311–330. https://doi.org/10.4064/aa-89-4-311-330 doi: 10.4064/aa-89-4-311-330
    [8] A. Kumchev, T. Nedeva, On an equation with prime numbers, Acta Arith., 83 (1998), 117–126. https://doi.org/10.4064/aa-83-2-117-126 doi: 10.4064/aa-83-2-117-126
    [9] A. Kumchev, M. B. S. Laporta, On a binary Diophantine inequality involving prime powers, In: Number theory for the Millennium II, Wellesley: A K Peters, 2002,307–329.
    [10] M. B. S. Laporta, On a binary Diophantine inequality involving prime numbers, Acta Math. Hungar., 83 (1999), 179–187. https://doi.org/10.1023/A:1006763805240 doi: 10.1023/A:1006763805240
    [11] S. H. Li, Y. C. Cai, On a binary Diophantine inequality involving prime numbers, Ramanujan J., 54 (2021), 571-–589. https://doi.org/10.1007/s11139-019-00222-4 doi: 10.1007/s11139-019-00222-4
    [12] Q. W. Mu, On a Diophantine inequality over primes, Advances in Mathematics (China), 44 (2015), 621–637. https://doi.org/10.11845/sxjz.2013046b doi: 10.11845/sxjz.2013046b
    [13] I. I. Piatetski-Shapiro, On a variant of the Waring-Goldbach problem, (Russian), Mat. Sb., 30 (1952), 105–120.
    [14] D. I. Tolev, Diophantine inequality involving prime numbers, (Russian), PhD Thesis, Moscow University, 1990.
    [15] D. I. Tolev, On a Diophantine inequality involving prime numbers, Acta Arith., 61 (1992), 289–306. https://doi.org/10.4064/aa-61-3-289-306 doi: 10.4064/aa-61-3-289-306
    [16] W. G. Zhai, X. D. Cao, On a binary Diophantine inequality, (Chinese), Advances in Mathematics (China), 32 (2003), 706–721. https://doi.org/10.3969/j.issn.1000-0917.2003.06.009 doi: 10.3969/j.issn.1000-0917.2003.06.009
    [17] W. G. Zhai, X. D. Cao, On a Diophantine inequality over primes, (Chinese), Advances in Mathematics (China), 32 (2003), 63–73. https://doi.org/10.3969/j.issn.1000-0917.2003.01.008 doi: 10.3969/j.issn.1000-0917.2003.01.008
    [18] M. Zhang, J. J. Li, On a Diophantine inequality over primes, J. Number Theory, 202 (2019), 220–253. https://doi.org/10.1016/j.jnt.2019.01.008 doi: 10.1016/j.jnt.2019.01.008
    [19] M. Zhang, J. J. Li, A Diophantine inequality with four prime variables, Int. J. Number Theory, 15 (2019), 1759–1770. https://doi.org/10.1142/S1793042119500982 doi: 10.1142/S1793042119500982
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1094) PDF downloads(88) Cited by(0)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog