<p>In this article, we are interested in whether a product of three consecutive integers <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_635_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="109" /> </InlineMediaObject> <EquationSource Format="TEX">\(a (a+1) (a+2)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo stretchy="false">(</mo> <mi>a</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo stretchy="false">(</mo> <mi>a</mi> <mo>+</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> divides another such product <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_635_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="103" /> </InlineMediaObject> <EquationSource Format="TEX">\(b (b+1) (b+2)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>b</mi> <mo stretchy="false">(</mo> <mi>b</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo stretchy="false">(</mo> <mi>b</mi> <mo>+</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. If this happens, we prove that there is some gap between them: <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_635_Article_IEq5.gif" Format="GIF" Height="33" Rendition="HTML" Resolution="72" Type="Linedraw" Width="102" /> </InlineMediaObject> <EquationSource Format="TEX">\(b \gg \frac{a (\log a)^{1/6}}{(\log \log a)^{1/3}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>b</mi> <mo>≫</mo> <mfrac> <mrow> <mi>a</mi> <msup> <mrow> <mo stretchy="false">(</mo> <mo>log</mo> <mi>a</mi> <mo stretchy="false">)</mo> </mrow> <mrow> <mn>1</mn> <mo stretchy="false">/</mo> <mn>6</mn> </mrow> </msup> </mrow> <msup> <mrow> <mo stretchy="false">(</mo> <mo>log</mo> <mo>log</mo> <mi>a</mi> <mo stretchy="false">)</mo> </mrow> <mrow> <mn>1</mn> <mo stretchy="false">/</mo> <mn>3</mn> </mrow> </msup> </mfrac> </mrow> </math></EquationSource> </InlineEquation>. We also consider other polynomial sequences such as <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_635_Article_IEq6.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="70" /> </InlineMediaObject> <EquationSource Format="TEX">\(a^2 (a^2 + l)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>a</mi> <mn>2</mn> </msup> <mrow> <mo stretchy="false">(</mo> <msup> <mi>a</mi> <mn>2</mn> </msup> <mo>+</mo> <mi>l</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> dividing <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_635_Article_IEq7.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="66" /> </InlineMediaObject> <EquationSource Format="TEX">\(b^2 (b^2 + l)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>b</mi> <mn>2</mn> </msup> <mrow> <mo stretchy="false">(</mo> <msup> <mi>b</mi> <mn>2</mn> </msup> <mo>+</mo> <mi>l</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for some fixed integer <i>l</i>. Our method is based on the effective Liouville–Baker–Feldman theorem.</p>

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

The Diophantine equation \(b (b+1) (b+2) = t a (a + 1) (a + 2)\) and the gap principle

  • Tsz Ho Chan

摘要

In this article, we are interested in whether a product of three consecutive integers \(a (a+1) (a+2)\) a ( a + 1 ) ( a + 2 ) divides another such product \(b (b+1) (b+2)\) b ( b + 1 ) ( b + 2 ) . If this happens, we prove that there is some gap between them: \(b \gg \frac{a (\log a)^{1/6}}{(\log \log a)^{1/3}}\) b a ( log a ) 1 / 6 ( log log a ) 1 / 3 . We also consider other polynomial sequences such as \(a^2 (a^2 + l)\) a 2 ( a 2 + l ) dividing \(b^2 (b^2 + l)\) b 2 ( b 2 + l ) for some fixed integer l. Our method is based on the effective Liouville–Baker–Feldman theorem.