<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1209_Article_IEq1.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 a positive integer. A <i>k</i>th power rational Diophantine <i>n</i>-tuple is a set of <i>n</i> pairwise distinct nonzero rational numbers <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1209_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="115" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{ a_{1}, a_{2}, \dots , a_{n} \}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <msub> <mi>a</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>a</mi> <mn>2</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>a</mi> <mi>n</mi> </msub> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1209_Article_IEq3.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="101" /> </InlineMediaObject> <EquationSource Format="TEX">\(a_{i} a_{j} + 1 = r_{i, j}^{k}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>a</mi> <mi>i</mi> </msub> <msub> <mi>a</mi> <mi>j</mi> </msub> <mo>+</mo> <mn>1</mn> <mo>=</mo> <msubsup> <mi>r</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> </mrow> </math></EquationSource> </InlineEquation> holds for each <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1209_Article_IEq4.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="104" /> </InlineMediaObject> <EquationSource Format="TEX">\(1 \le i &lt; j \le n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>≤</mo> <mi>i</mi> <mo>&lt;</mo> <mi>j</mi> <mo>≤</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation> with some rational <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1209_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="23" /> </InlineMediaObject> <EquationSource Format="TEX">\(r_{i, j}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>r</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>’s. In this paper, we prove that there exist infinitely many rational Diophantine triples for an arbitrary exponent. When the exponent is <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1209_Article_IEq6.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="41" /> </InlineMediaObject> <EquationSource Format="TEX">\(k = 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>=</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>, we characterize certain pairs that can be extended to triples; additionally, we also prove the existence of infinitely many quadruples. The primary tool in our arguments is what we call <i>curves induced by rational Diophantine pairs</i>.</p>

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

Higher power rational Diophantine tuples

  • Gergő Batta,
  • Márton Szikszai,
  • Szabolcs Tengely

摘要

Let \(k \ge 2\) k 2 be a positive integer. A kth power rational Diophantine n-tuple is a set of n pairwise distinct nonzero rational numbers \(\{ a_{1}, a_{2}, \dots , a_{n} \}\) { a 1 , a 2 , , a n } such that \(a_{i} a_{j} + 1 = r_{i, j}^{k}\) a i a j + 1 = r i , j k holds for each \(1 \le i < j \le n\) 1 i < j n with some rational \(r_{i, j}\) r i , j ’s. In this paper, we prove that there exist infinitely many rational Diophantine triples for an arbitrary exponent. When the exponent is \(k = 3\) k = 3 , we characterize certain pairs that can be extended to triples; additionally, we also prove the existence of infinitely many quadruples. The primary tool in our arguments is what we call curves induced by rational Diophantine pairs.