<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_664_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="40" /> </InlineMediaObject> <EquationSource Format="TEX">\(d_k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>d</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the <i>k</i>-fold divisor function. For a wide range of large <i>q</i> the expected bound <Equation ID="Equ43"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_664_Article_Equ43.gif" Format="GIF" Height="80" Rendition="HTML" Resolution="72" Type="Linedraw" Width="268" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \sum _{\begin{array}{c} n\le x\\ {n\equiv a(q)} \end{array}}d_k(n)-\text { main term }\approx \sqrt{\frac{x}{q}} \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <munder> <mo>∑</mo> <mrow> <mtable> <mtr> <mtd> <mrow> <mi>n</mi> <mo>≤</mo> <mi>x</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow /> <mrow> <mi>n</mi> <mo>≡</mo> <mi>a</mi> <mo stretchy="false">(</mo> <mi>q</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> </mtr> </mtable> </mrow> </munder> <msub> <mi>d</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mo>-</mo> <mrow> <mi mathvariant="normal">main</mi> <mi mathvariant="normal">term</mi> </mrow> <mo>≈</mo> <msqrt> <mfrac> <mi mathvariant="normal">x</mi> <mi mathvariant="normal">q</mi> </mfrac> </msqrt> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>is shown to be true in an average sense - for all <i>k</i>. This generalises the work of Pongsriiam and Vaughan [<CitationRef CitationID="CR18">18</CitationRef>] who studied <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_664_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="41" /> </InlineMediaObject> <EquationSource Format="TEX">\(k=2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>=</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, and answers the work of Rodgers and Soundararajan [<CitationRef CitationID="CR19">19</CitationRef>], who used the asymptotic large sieve to study a smoothed version of the problem. We use a circle method approach as developed by Goldston and Vaughan [<CitationRef CitationID="CR8">8</CitationRef>] to study the unsmoothed problem.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Montgomery-Hooley theorem for the k-fold divisor function

  • Tomos Parry

摘要

Let \(d_k(n)\) d k ( n ) denote the k-fold divisor function. For a wide range of large q the expected bound \(\begin{aligned} \sum _{\begin{array}{c} n\le x\\ {n\equiv a(q)} \end{array}}d_k(n)-\text { main term }\approx \sqrt{\frac{x}{q}} \end{aligned}\) n x n a ( q ) d k ( n ) - main term x q is shown to be true in an average sense - for all k. This generalises the work of Pongsriiam and Vaughan [18] who studied \(k=2\) k = 2 , and answers the work of Rodgers and Soundararajan [19], who used the asymptotic large sieve to study a smoothed version of the problem. We use a circle method approach as developed by Goldston and Vaughan [8] to study the unsmoothed problem.