<p>The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the existence of long blocks of <i>k</i>-wise coprime elements in certain regular sequences. More precisely, we prove that for any positive integers <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1219_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="80" /> </InlineMediaObject> <EquationSource Format="TEX">\(H \ge k \ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>H</mi> <mo>≥</mo> <mi>k</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> and for a real-valued <i>k</i>-times continuously differentiable function <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1219_Article_IEq2.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="109" /> </InlineMediaObject> <EquationSource Format="TEX">\(f \in \mathcal {C}^k\left( [1, \infty )\right) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>f</mi> <mo>∈</mo> <msup> <mrow> <mi mathvariant="script">C</mi> </mrow> <mi>k</mi> </msup> <mfenced close=")" open="("> <mo stretchy="false">[</mo> <mn>1</mn> <mo>,</mo> <mi>∞</mi> <mo stretchy="false">)</mo> </mfenced> </mrow> </math></EquationSource> </InlineEquation> satisfying <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1219_Article_IEq3.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="135" /> </InlineMediaObject> <EquationSource Format="TEX">\(\lim _{x \rightarrow \infty } f^{(k)}(x) = 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mo movablelimits="true">lim</mo> <mrow> <mi>x</mi> <mo stretchy="false">→</mo> <mi>∞</mi> </mrow> </msub> <msup> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1219_Article_IEq4.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="188" /> </InlineMediaObject> <EquationSource Format="TEX">\(\limsup _{x \rightarrow \infty } f^{(k-1)}(x) = \infty \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mo movablelimits="true">lim sup</mo> <mrow> <mi>x</mi> <mo stretchy="false">→</mo> <mi>∞</mi> </mrow> </msub> <msup> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mi>∞</mi> </mrow> </math></EquationSource> </InlineEquation>, there exist infinitely many positive integers <i>n</i> such that <Equation ID="Equ54"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1219_Article_Equ54.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="370" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \gcd \left( \lfloor f(n+i_1)\rfloor , \lfloor f(n+i_2)\rfloor , \cdots , \lfloor f(n+i_k)\rfloor \right) ~=~ 1 \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mo movablelimits="true">gcd</mo> <mfenced close=")" open="("> <mrow> <mo>⌊</mo> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>+</mo> <msub> <mi>i</mi> <mn>1</mn> </msub> <mo stretchy="false">)</mo> </mrow> <mo>⌋</mo> </mrow> <mo>,</mo> <mrow> <mo>⌊</mo> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>+</mo> <msub> <mi>i</mi> <mn>2</mn> </msub> <mo stretchy="false">)</mo> </mrow> <mo>⌋</mo> </mrow> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <mrow> <mo>⌊</mo> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>+</mo> <msub> <mi>i</mi> <mi>k</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo>⌋</mo> </mrow> </mfenced> <mspace width="3.33333pt" /> <mo>=</mo> <mspace width="3.33333pt" /> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>for any integers <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1219_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="197" /> </InlineMediaObject> <EquationSource Format="TEX">\(1 \le i_1&lt; i_2&lt; \cdots &lt; i_k \le H\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>≤</mo> <msub> <mi>i</mi> <mn>1</mn> </msub> <mo>&lt;</mo> <msub> <mi>i</mi> <mn>2</mn> </msub> <mo>&lt;</mo> <mo>⋯</mo> <mo>&lt;</mo> <msub> <mi>i</mi> <mi>k</mi> </msub> <mo>≤</mo> <mi>H</mi> </mrow> </math></EquationSource> </InlineEquation>. Further, we show that there exists a subset <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1219_Article_IEq6.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="50" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {A}\subseteq \mathbb {N}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">A</mi> <mo>⊆</mo> <mi mathvariant="double-struck">N</mi> </mrow> </math></EquationSource> </InlineEquation> having upper Banach density one such that <Equation ID="Equ55"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1219_Article_Equ55.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="292" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \gcd \left( \lfloor f(n_1) \rfloor , \lfloor f(n_2) \rfloor , \cdots , \lfloor f(n_k) \rfloor \right) ~=~ 1 \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mo movablelimits="true">gcd</mo> <mfenced close=")" open="("> <mrow> <mo>⌊</mo> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo stretchy="false">)</mo> </mrow> <mo>⌋</mo> </mrow> <mo>,</mo> <mrow> <mo>⌊</mo> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>n</mi> <mn>2</mn> </msub> <mo stretchy="false">)</mo> </mrow> <mo>⌋</mo> </mrow> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <mrow> <mo>⌊</mo> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>n</mi> <mi>k</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo>⌋</mo> </mrow> </mfenced> <mspace width="3.33333pt" /> <mo>=</mo> <mspace width="3.33333pt" /> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>for any distinct integers <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1219_Article_IEq7.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="140" /> </InlineMediaObject> <EquationSource Format="TEX">\(n_1, n_2, \cdots , n_k \in \mathcal {A}.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>n</mi> <mn>2</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>n</mi> <mi>k</mi> </msub> <mo>∈</mo> <mi mathvariant="script">A</mi> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation></p>

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

Coprimality of elements in regular sequences with polynomial growth

  • Jean-Marc Deshouillers,
  • Sunil Naik

摘要

The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the existence of long blocks of k-wise coprime elements in certain regular sequences. More precisely, we prove that for any positive integers \(H \ge k \ge 2\) H k 2 and for a real-valued k-times continuously differentiable function \(f \in \mathcal {C}^k\left( [1, \infty )\right) \) f C k [ 1 , ) satisfying \(\lim _{x \rightarrow \infty } f^{(k)}(x) = 0\) lim x f ( k ) ( x ) = 0 and \(\limsup _{x \rightarrow \infty } f^{(k-1)}(x) = \infty \) lim sup x f ( k - 1 ) ( x ) = , there exist infinitely many positive integers n such that \(\begin{aligned} \gcd \left( \lfloor f(n+i_1)\rfloor , \lfloor f(n+i_2)\rfloor , \cdots , \lfloor f(n+i_k)\rfloor \right) ~=~ 1 \end{aligned}\) gcd f ( n + i 1 ) , f ( n + i 2 ) , , f ( n + i k ) = 1 for any integers \(1 \le i_1< i_2< \cdots < i_k \le H\) 1 i 1 < i 2 < < i k H . Further, we show that there exists a subset \(\mathcal {A}\subseteq \mathbb {N}\) A N having upper Banach density one such that \(\begin{aligned} \gcd \left( \lfloor f(n_1) \rfloor , \lfloor f(n_2) \rfloor , \cdots , \lfloor f(n_k) \rfloor \right) ~=~ 1 \end{aligned}\) gcd f ( n 1 ) , f ( n 2 ) , , f ( n k ) = 1 for any distinct integers \(n_1, n_2, \cdots , n_k \in \mathcal {A}.\) n 1 , n 2 , , n k A .