<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_663_Article_IEq1.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="41" /> </InlineMediaObject> <EquationSource Format="TEX">\(r\ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_663_Article_IEq2.gif" Format="GIF" Height="18" Rendition="HTML" Resolution="72" Type="Linedraw" Width="89" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell \ge 2^{r-1}+1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ℓ</mi> <mo>≥</mo> <msup> <mn>2</mn> <mrow> <mi>r</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>+</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_663_Article_IEq3.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(k\ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> be integers. In this paper, we give an asymptotic formula for <Equation ID="Equ30"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_663_Article_Equ30.gif" Format="GIF" Height="50" Rendition="HTML" Resolution="72" Type="Linedraw" Width="252" /> </MediaObject> <EquationSource Format="TEX">\(\sum _{1\le p_{1},p_{2},\ldots ,p_{\ell }\le x^{\frac{1}{r}}}\tau _{k}(p_{1}^{r}+p_{2}^{r}+\cdots +p_{\ell }^{r}),\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <munder> <mo>∑</mo> <mrow> <mn>1</mn> <mo>≤</mo> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>p</mi> <mi>ℓ</mi> </msub> <mo>≤</mo> <msup> <mi>x</mi> <mfrac> <mn>1</mn> <mi>r</mi> </mfrac> </msup> </mrow> </munder> <msub> <mi>τ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <msubsup> <mi>p</mi> <mrow> <mn>1</mn> </mrow> <mi>r</mi> </msubsup> <mo>+</mo> <msubsup> <mi>p</mi> <mrow> <mn>2</mn> </mrow> <mi>r</mi> </msubsup> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msubsup> <mi>p</mi> <mrow> <mi>ℓ</mi> </mrow> <mi>r</mi> </msubsup> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> </mrow> </math></EquationSource> </Equation>where <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_663_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(\tau _k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>τ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> represents the <i>k</i>-th divisor function and <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_663_Article_IEq5.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="71" /> </InlineMediaObject> <EquationSource Format="TEX">\(p_{1},\dots ,p_{\ell }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>p</mi> <mi>ℓ</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> are prime variables. Moreover, we also provide an asymptotic formula for <Equation ID="Equ31"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_663_Article_Equ31.gif" Format="GIF" Height="50" Rendition="HTML" Resolution="72" Type="Linedraw" Width="397" /> </MediaObject> <EquationSource Format="TEX">\(\sum _{1\le p_{1},p_{2},\ldots ,p_{\ell }\le x^{\frac{1}{r}}}\tau _{k}(p_{1}^{r}+p_{2}^{r}+\cdots +p_{\ell }^{r})\log p_1 \log p_2 \cdots \log p_{\ell }.\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <munder> <mo>∑</mo> <mrow> <mn>1</mn> <mo>≤</mo> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>p</mi> <mi>ℓ</mi> </msub> <mo>≤</mo> <msup> <mi>x</mi> <mfrac> <mn>1</mn> <mi>r</mi> </mfrac> </msup> </mrow> </munder> <msub> <mi>τ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <msubsup> <mi>p</mi> <mrow> <mn>1</mn> </mrow> <mi>r</mi> </msubsup> <mo>+</mo> <msubsup> <mi>p</mi> <mrow> <mn>2</mn> </mrow> <mi>r</mi> </msubsup> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msubsup> <mi>p</mi> <mrow> <mi>ℓ</mi> </mrow> <mi>r</mi> </msubsup> <mo stretchy="false">)</mo> </mrow> <mo>log</mo> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>log</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo>⋯</mo> <mo>log</mo> <msub> <mi>p</mi> <mi>ℓ</mi> </msub> <mo>.</mo> </mrow> </math></EquationSource> </Equation>Previously, partial results of these summations were obtained by many mathematicians.</p>

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

Sums of the higher divisor function of diagonal homogeneous forms at prime arguments

  • Shuangrui Tian,
  • Guang-Liang Zhou

摘要

Let \(r\ge 2\) r 2 , \(\ell \ge 2^{r-1}+1\) 2 r - 1 + 1 and \(k\ge 2\) k 2 be integers. In this paper, we give an asymptotic formula for \(\sum _{1\le p_{1},p_{2},\ldots ,p_{\ell }\le x^{\frac{1}{r}}}\tau _{k}(p_{1}^{r}+p_{2}^{r}+\cdots +p_{\ell }^{r}),\) 1 p 1 , p 2 , , p x 1 r τ k ( p 1 r + p 2 r + + p r ) , where \(\tau _k(n)\) τ k ( n ) represents the k-th divisor function and \(p_{1},\dots ,p_{\ell }\) p 1 , , p are prime variables. Moreover, we also provide an asymptotic formula for \(\sum _{1\le p_{1},p_{2},\ldots ,p_{\ell }\le x^{\frac{1}{r}}}\tau _{k}(p_{1}^{r}+p_{2}^{r}+\cdots +p_{\ell }^{r})\log p_1 \log p_2 \cdots \log p_{\ell }.\) 1 p 1 , p 2 , , p x 1 r τ k ( p 1 r + p 2 r + + p r ) log p 1 log p 2 log p . Previously, partial results of these summations were obtained by many mathematicians.