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

On two sums related to the Lehmer problem over short intervals

  • In this article, we study sums related to the Lehmer problem over short intervals, and give two asymptotic formulae for them. The original Lehmer problem is to count the numbers coprime to a prime such that the number and the its number theoretical inverse are in different parities in some intervals. The numbers which satisfy these conditions are called Lehmer numbers. It prompts a series of investigations, such as the investigation of the error term in the asymptotic formula. Many scholars investigate the generalized Lehmer problems and get a lot of results. We follow the trend of these investigations and generalize the Lehmer problem.

    Citation: Yanbo Song. On two sums related to the Lehmer problem over short intervals[J]. AIMS Mathematics, 2021, 6(11): 11723-11732. doi: 10.3934/math.2021681

    Related Papers:

    [1] Zhao Xiaoqing, Yi Yuan . Square-free numbers in the intersection of Lehmer set and Piatetski-Shapiro sequence. AIMS Mathematics, 2024, 9(12): 33591-33609. doi: 10.3934/math.20241603
    [2] Lei Liu, Zhefeng Xu . Mean value of the Hardy sums over short intervals. AIMS Mathematics, 2020, 5(6): 5551-5563. doi: 10.3934/math.2020356
    [3] Jiankang Wang, Zhefeng Xu, Minmin Jia . On the generalized Cochrane sum with Dirichlet characters. AIMS Mathematics, 2023, 8(12): 30182-30193. doi: 10.3934/math.20231542
    [4] Jinmin Yu, Renjie Yuan, Tingting Wang . The fourth power mean value of one kind two-term exponential sums. AIMS Mathematics, 2022, 7(9): 17045-17060. doi: 10.3934/math.2022937
    [5] Xiaoqing Zhao, Yuan Yi . High-dimensional Lehmer problem on Beatty sequences. AIMS Mathematics, 2023, 8(6): 13492-13502. doi: 10.3934/math.2023684
    [6] Wenjia Guo, Xiaoge Liu, Tianping Zhang . Dirichlet characters of the rational polynomials. AIMS Mathematics, 2022, 7(3): 3494-3508. doi: 10.3934/math.2022194
    [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] Guohui Chen, Wenpeng Zhang . One kind two-term exponential sums weighted by third-order character. AIMS Mathematics, 2024, 9(4): 9597-9607. doi: 10.3934/math.2024469
    [9] Hu Jiayuan, Chen Zhuoyu . On distribution properties of cubic residues. AIMS Mathematics, 2020, 5(6): 6051-6060. doi: 10.3934/math.2020388
    [10] Zhuoyu Chen, Wenpeng Zhang . A new reciprocity formula of Dedekind sums and its applications. AIMS Mathematics, 2024, 9(5): 12814-12824. doi: 10.3934/math.2024626
  • In this article, we study sums related to the Lehmer problem over short intervals, and give two asymptotic formulae for them. The original Lehmer problem is to count the numbers coprime to a prime such that the number and the its number theoretical inverse are in different parities in some intervals. The numbers which satisfy these conditions are called Lehmer numbers. It prompts a series of investigations, such as the investigation of the error term in the asymptotic formula. Many scholars investigate the generalized Lehmer problems and get a lot of results. We follow the trend of these investigations and generalize the Lehmer problem.



    Let p be an odd primes, a be an integer coprime to p. So there exists a 0<¯ap such that a¯a1modp. Let N(p) denoted the number of integers a (0<a<p) such that a¯a1modp and 2a+¯a. D. H. Lehmer (see [1] problem F12 p. 381) asked a problem about the asymptotic formula of N(p). To give an answer to this problem, Professor W. P. Zhang proved the following two theorems (see [2,3,4]):

    Theorem 1.1. Let N(p) denoted the number of integers a (0<a<p) such that a¯a1modp and 2a+¯a. We have

    N(p)=12p+1π2p1a=1p1b=11ab(S(a,b;p)S(a,b;p)+4S(¯4a,b;p)4S(¯4a,b;p)4S(¯2a,b;p)+4S(¯2a,b;p))+O(log3p),

    where the S(a,b;p) are Kloosterman sums, defined as follows:

    S(m,n;p)=amodpe(ma+n¯ap).

    Theorem 1.2. For any odd number q, let N(q) denotes the number of integers a (0<a<q) which coprime to q such that a¯a1modq and 2a+¯a. We have

    N(q)=12ϕ(q)+O(q1/2τ2(q)log2q).

    For more about Lehmer problem, one can see [5,6,7,8,9,10,11,12]. In 2015, H. Zhang and W. P. Zhang [13] investigated two new sums:

    L(k,p)=12k   a1pa1ak1  akpmod p(1(1)a1+¯a1)(1(1)ak+¯ak),
    S(k,p)=12k   a1pa1ak1  akpmod pn|a1++ak(1(1)a1+¯a1)(1(1)ak+¯ak),

    which related to the Lehmer problem, and gave the asymptotic formulae for these new sums.

    In this paper, we give asymptotic formulae for these new sums over short intervals.

    Theorem 1.3. Let p be an odd primes, and k>2 be an integer, and ε>0 is a sufficient small real number. |Ai|p1/2+1/k+ε, Ai={1,2,,ti}, [1,ti](0,p), i=1,2,,k. Define N(k,p) as follows:

    N(k,p)=12k a1A1a1ak1  akAkmod p(1(1)a1+¯a1)(1(1)ak+¯ak),

    then we have

    N(k,p)=12k(p1)ki=1ti+O(p1/2log2pmax1rk{irti})+O(pk/2+ε),

    where the implied constant of the first and second big 'O' terms depends on k.

    Theorem 1.4. Let p be an odd primes, k>4 be an integer, and ε>0 is a sufficient small real number. pn>pk+22k2+ε be an integer. Ai= {1,2,,ti}, i=1,2,,k1, pk+22k2+ε<ti<n, Ak={1,2,,n}. Define M(k,p) as follows:

    M(k,p)=12k a1A1a1ak1  akAkmod pna1++ak(1(1)a1+¯a1)(1(1)ak+¯ak),

    then we have

    M(k,p)=12k(p1)k1i=1ti+O(p1/2log2pmax1rk1{Π  ir1ik1ti})+O(pk/2+ε),

    where the implied constant of the first and second big 'O' terms depends on k.

    Remark 1.5. The short interval result is usually more difficult than the whole interval result. This is why this problem is interesting and meaningful, and use some technique which are often used to obtain a short interval result such as Lemma 2.4 and formula (2.1). We use 1e(a+b2) instead of (1)a+b to detect 2a+b.

    Before we prove the theorem, we introduce some Lemmas, and through out the paper, p always denotes an odd prime number, and χ and ψ always denote the character modp, χ0 denotes the principal character modp.

    We define the generalized Kloosterman sums, as follows:

    K(m,n;q)=amodqχ(a)e(ma+n¯aq),

    where m, n, q be integers and χ is a Dirichlet character modq. And we define Gauss sums, as follows:

    G(a,χ)=dmodqχ(d)e(adq).

    We have following estimates.

    Lemma 2.1. Let p be an odd primes, then we have

    K(m,n;p)p1/2+ε(m,n,p)1/2.

    Proof. See [14].

    Lemma 2.2. Let a, b, q be natural numbers, χ runs through all the non-principal characters modq, then we have

    χχ0G(a,χ)G(b,χ)q3/2τ(q)(a,q)1/2(b,q)1/2.

    Proof. See Lemma 3 in [15].

    Similarly, we have

    Lemma 2.3. Let p be an odd primes, and a, bbe natural numbers, ψ runs through all the non-principal characters modp, χ is a character modp, then we have

    ψχ0G(a,ψ)G(b,ψχ)p3/2+ε(a,p)1/2(b,p)1/2.

    Lemma 2.4. Let N be a nature number, α be a real number, then

    nNe(αn)min(N,12α),

    where α denotes the distance from α to the nearest integer.

    Proof. See [16].

    Lemma 2.5. Let U and γ be two positive real numbers, p be a nonzero natural number, then

    p1k=1min(U,1kp+γ)U+plogp.

    Proof. Since the inequality

    kp+γ<1p

    hold for at most two k. They contribute at most 2U. The others contribute at most

    2j<p/2p/jplogp.

    This completes the proof of the lemma.

    Lemma 2.6. Let p be an odd prime number, A={1,2,,s}, [1,s](0,p), then we have

     aA2a+ˉaχ(a)e(tan)p1/2+ε,

    when χχ0, and

     aA2a+ˉaχ(a)e(tan)=12aAe(tan)+O(p1/2log2p),

    when χ=χ0.

    Proof. When χ=χ0, we have

     aA2a+ˉae(tan)=aAp1b=1ab1   modp2a+be(tan)=12p2ψmodpaAp1b=1ψ(ab)(1e(a+b2))e(tan)=12p2aAp1b=1e(tan)12p2aAp1b=1e(a+b2)e(tan)+12p2ψχ0aAp1b=1ψ(a)ψ(b)e(tan)12p2ψχ0aAp1b=1ψ(a)ψ(b)e(a+b2)e(tan)=12aAe(tan)12p2ψχ0aAp1b=1ψ(a)ψ(b)e(a+b2)e(tan).

    Let

    S=1p1ψχ0aAp1b=1ψ(a)ψ(b)e(a+b2)e(tan).

    We note that for ψχ0, we have

    ψ(a)=1pp1r=1G(r,ψ)e(arp). (2.1)
    S=1p1ψχ0aAψ(a)e(a2+tan)p1b=1ψ(b)e(b2)=1p2(p1)p1r=1aAe(a2+tanarp)p1s=1p1b=1e(b2bsp)ψχ0G(r,ψ)G(s,ψ)

    By Lemma 2.2 and 2.4, we have

    S1p3/2p1r=1min(|A|,||12+tnrp||1)p1s=1min(p,||12sp||1).

    By Lemma 2.5, we have

    Sp1/2log2p.

    So when χ=χ0, we have

     aA2a+ˉaχ(a)e(tan)=12aAe(tan)+O(p1/2log2p).

    When χχ0, we have

     aA2a+ˉaχ(a)e(tan)=aAp1b=1ab1   modp2a+bχ(a)e(tan)=12p2ψmodpaAp1b=1χ(a)ψ(ab)e(tan)12p2ψmodpaAχ(a)ψ(a)e(tan)p1b=1ψ(b)e(a+b2):=S1S2.

    We only estimate S2, the estimation of S1 is similar.

    S2=12p2ψaAχ(a)ψ(a)e(a2+tan)p1b=1ψ(b)e(b2)=12p2ψχ0,¯χaAχ(a)ψ(a)e(a2+tan)p1b=1ψ(b)e(b2)+12p2ψ=χ0aAχ(a)ψ(a)e(a2+tan)p1b=1ψ(b)e(b2)+12p2ψ=¯χaAχ(a)ψ(a)e(a2+tan)p1b=1ψ(b)e(b2):=S21+S22+S23.

    For S21, by (2.1), we have

    S21=12p2ψχ0aAχψ(a)e(a2+tan)p1b=1ψ(b)e(b2)S23

    So we have

    S21+S23=1p2(p1)p1r=1aAe(a2+tanarp)p1s=1p1b=1e(b2bsp)ψχ0G(r,χψ)G(s,ψ).

    By Lemma 2.3 and 2.4, we have

    S21+S231p3/2εp1r=1min(|A|,||12+tnrp||1)p1s=1min(p,||12sp||1).

    By Lemma 2.5, we have

    S21+S23p1/2+ε.

    For S22, it is simple, we have

    S22p1/2+ε.

    So when χχ0, we have

     aA2a+ˉaχ(a)e(tan)p1/2+ε.

    So we complete the proof of Lemma 2.6.

    For convenience, we record the following four special cases of Lemma 2.6.

    Corollary 2.7. Let p be an odd prime number, A={1,2,,t}, [1,t](0,p), then we have

     aA2a+ˉa1=12|A|+O(p1/2log2p).

    Corollary 2.8. Let p be an odd prime number, A={1,2,,t}, [1,t](0,p), χχ0, then we have

     aA2a+ˉaχ(a)p1/2+ε.

    Corollary 2.9. Let p be an odd prime number, A={1,2,,h}, [1,h](0,p), then we have

     aA2a+ˉae(tan)=12aAe(tan)+O(p1/2log2p).

    Corollary 2.10. Let p be an odd prime number, A={1,2,,t}, [1,t](0,p), χχ0, then we have

     aA2a+ˉaχ(a)e(tan)p1/2+ε.

    Now we prove Theorem 1.3, we give asymptotic formulae for two sums over short intervals.

    N(k,p)=12k a1A1a1ak1  akAkmod p(1(1)a1+¯a1)(1(1)ak+¯ak)=a1A12a1+¯a1akAk2ak+¯aka1ak1modp1=1p1χa1A12a1+¯a1akAk2ak+¯akχ(a1ak)=1p1a1A12a1+¯a1akAk2ak+¯ak1+1p1χχ0a1A12a1+¯a1akAk2ak+¯akχ(a1ak)=1p1i  aiAi2ai+¯ai1+1p1χχ0i  aiAi2ai+¯aiχ(ai).

    By Corollary 2.7, we have

      aiAi2ai+¯ai1=12|Ai|+O(p1/2log2p).

    By Corollary 2.8, we have

      aiAi2ai+¯aiχ(ai)p1/2+ε.

    So we have

    N(k,p)=12k a1A1a1ak1  akAkmod p(1(1)a1+¯a1)(1(1)ak+¯ak)=12k(p1)ki=1(ti+O(p1/2log2p))+O(pk/2+ε)=12k(p1)ki=1ti+O(p1/2log2pmax1rk{irti})+O(pk/2+ε).

    Note that the implied constant of the first big 'O' term is dependent on k. This completes the proof of Theorem 1.3.

    Now we prove Theorem 1.4, we have

    M(k,p)=12k a1A1a1ak1  akAkmod pna1++ak(1(1)a1+¯a1)(1(1)ak+¯ak)=a1A12a1+¯a1akAk2ak+¯aka1ak1modpna1++ak1=1n(p1)nt=1χa1A12a1+¯a1akAk2ak+¯akχ(a1ak)e(t(a1++ak)n)=1n(p1)nt=1a1A12a1+¯a1akAk2ak+¯ake(t(a1++ak)n)+1n(p1)nt=1χχ0a1A12a1+¯a1akAk2ak+¯akχ(a1ak)e(t(a1++ak)n)=1n(p1)nt=1ki=1  aiAi2ai+¯aie(tain)+1n(p1)nt=1χχ0ki=1  aiAi2ai+¯aiχ(ai)e(tain).

    By Corollary 2.9 and 2.10, we have

    aiA2ai+¯aie(tain)=12aiAe(tain)+O(p1/2log2p),aiA2ai+¯aiχ(ai)e(tain)p1/2+ε.

    By the following formula

    p1a=0e(map)={p, if pm;0, otherwise, 

    and the definition of interval Ak, we have

    M(k,p)=12k(p1)k1i=1ti+O(p1/2log2pmax1rk1{Π  ir1ik1ti})+O(pk/2+ε).

    Note that the implied constant of the first big 'O' term is dependent on k. This completes the proof of Theorem 1.4.

    In this paper, we investigated two problems which related to the Lehmer problem, and gave the asymptotic formulae for these new sums over short intervals.

    The author would like to express his heartfelt thanks to the reviewers for their valuable comments and suggestions.

    The author declares that there are no conflicts of interest regarding the publication of this paper.



    [1] R. K. Guy, Unsolved problems in number theory, New York: Springer-Verlag, 2004.
    [2] W. P. Zhang, On D. H. Lehmer problem, Chin. Sci. Bull., 21 (1992), 1765–1769.
    [3] W. P. Zhang, On a problem of D. H. Lehmer and its generalization, Compos. Math., 86 (1993), 307–316.
    [4] W. P. Zhang, A problem of D. H. Lehmer and its generalization (II), Compos. Math., 91 (1994), 47–56.
    [5] Y. Yi, W. P. Zhang, On the generalization of a problem of D. H. Lehmer, Kyushu J. Math., 56 (2002), 235–241. doi: 10.2206/kyushujm.56.235
    [6] I. E. Shparlinski, On a generalised Lehmer problem for arbitrary powers, East-West J. Math., 2008.
    [7] I. E. Shparlinski, On a generalisation of a Lehmer problem, Math. Z., 263 (2009), 619–631. doi: 10.1007/s00209-008-0434-2
    [8] Y. Lu, Y. Yi, On the generalization of the D. H. Lehmer problem, Acta Math. Sinica, Engl. Ser., 25 (2009), 1269–1274. doi: 10.1007/s10114-009-7652-3
    [9] Z. F. Xu, W. P. Zhang, On a problem of D. H. Lehmer over short intervals, J. Math. Anal. Appl., 320 (2006), 756–770. doi: 10.1016/j.jmaa.2005.07.054
    [10] H. N. Liu, W. P. Zhang, On a problem of D. H. Lehmer, Acta Math. Sinica, Engl. Ser., 22 (2006), 61–68.
    [11] Z. Y. Zheng, On the ordinary problem of D. H. Lehmer, Chin. Sci. Bull., 38 (1993), 1060–1065. doi: 10.1360/csb1993-38-12-1060
    [12] P. Xi, Y. Yi, Kloosterman sums and a problem of D. H. Lehmer, Chin. Ann. Math. Ser. B, 41 (2020), 361–370. doi: 10.1007/s11401-020-0203-z
    [13] H. Zhang, W. P. Zhang, Some new sums related to D. H. Lehmer problem, Czech. Math. J., 65 (2015), 915–922. doi: 10.1007/s10587-015-0217-y
    [14] S. Chowla, On Kloosterman's Sum, Norske Vid. Selsk. Forh., 40 (1967), 70–72.
    [15] P. Xi, Y. Yi, Generalized D. H. Lehmer problem over short intervals, Glasgow Math. J., 53 (2011), 293–299. doi: 10.1017/S0017089510000704
    [16] C. D. Pan, C. B. Pan, Goldbach conjecture, Beijing: Science Press, 1981.
  • Reader Comments
  • © 2021 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(2739) PDF downloads(100) Cited by(0)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog