<p>In this paper we study the equation <Equation ID="Equ29"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1153_Article_Equ29.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="460" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} (x-dr)^5+\cdots +(x-r)^5+x^5+(x+r)^5+\cdots +(x+dr)^5=y^p \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo>-</mo> <mi>d</mi> <mi>r</mi> <mo stretchy="false">)</mo> </mrow> <mn>5</mn> </msup> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo>-</mo> <mi>r</mi> <mo stretchy="false">)</mo> </mrow> <mn>5</mn> </msup> <mo>+</mo> <msup> <mi>x</mi> <mn>5</mn> </msup> <mo>+</mo> <msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo>+</mo> <mi>r</mi> <mo stretchy="false">)</mo> </mrow> <mn>5</mn> </msup> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo>+</mo> <mi>d</mi> <mi>r</mi> <mo stretchy="false">)</mo> </mrow> <mn>5</mn> </msup> <mo>=</mo> <msup> <mi>y</mi> <mi>p</mi> </msup> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>under the condition <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1153_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="93" /> </InlineMediaObject> <EquationSource Format="TEX">\(\gcd (x,r)=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo movablelimits="true">gcd</mo> <mo stretchy="false">(</mo> <mi>x</mi> <mo>,</mo> <mi>r</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. We present a recipe for proving the non-existence of non-trivial integer solutions of the above equation, and as an application we obtain explicit results for the cases <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1153_Article_IEq2.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="56" /> </InlineMediaObject> <EquationSource Format="TEX">\(d=2,3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>d</mi> <mo>=</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation> (the case <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1153_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="40" /> </InlineMediaObject> <EquationSource Format="TEX">\(d=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>d</mi> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> was already solved [Bennett and Koutsianas in Acta Arith 198(4):387–399, 2021]). We also prove an asymptotic result for <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1153_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="121" /> </InlineMediaObject> <EquationSource Format="TEX">\(d\equiv 1, 7\pmod 9\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>d</mi> <mo>≡</mo> <mn>1</mn> <mo>,</mo> <mn>7</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>9</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. Our main tools include the modular method and employing Frey curves and their associated modular forms, as well as the symplectic argument.</p>

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

On the sum of fifth powers in arithmetic progression

  • Lucas Villagra Torcomian

摘要

In this paper we study the equation \(\begin{aligned} (x-dr)^5+\cdots +(x-r)^5+x^5+(x+r)^5+\cdots +(x+dr)^5=y^p \end{aligned}\) ( x - d r ) 5 + + ( x - r ) 5 + x 5 + ( x + r ) 5 + + ( x + d r ) 5 = y p under the condition \(\gcd (x,r)=1\) gcd ( x , r ) = 1 . We present a recipe for proving the non-existence of non-trivial integer solutions of the above equation, and as an application we obtain explicit results for the cases \(d=2,3\) d = 2 , 3 (the case \(d=1\) d = 1 was already solved [Bennett and Koutsianas in Acta Arith 198(4):387–399, 2021]). We also prove an asymptotic result for \(d\equiv 1, 7\pmod 9\) d 1 , 7 ( mod 9 ) . Our main tools include the modular method and employing Frey curves and their associated modular forms, as well as the symplectic argument.