<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_667_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="30" /> </InlineMediaObject> <EquationSource Format="TEX">\(\lfloor z\rfloor \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>⌊</mo> <mi>z</mi> <mo>⌋</mo> </mrow> </math></EquationSource> </InlineEquation> be the integer part of a real number <i>z</i>. For non-integer <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_667_Article_IEq2.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="40" /> </InlineMediaObject> <EquationSource Format="TEX">\(c&gt;1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>c</mi> <mo>&gt;</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, asymptotic formulas are derived for sums of the forms <Equation ID="Equ35"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_667_Article_Equ35.gif" Format="GIF" Height="42" Rendition="HTML" Resolution="72" Type="Linedraw" Width="271" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \sum _{n\le N}\mu ^2(n)\mu ^2(\lfloor n^c \rfloor ), \,\,\,\sum _{n\le N}\mu ^2(n)q_2(\lfloor n^c \rfloor ) \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <munder> <mo>∑</mo> <mrow> <mi>n</mi> <mo>≤</mo> <mi>N</mi> </mrow> </munder> <msup> <mi>μ</mi> <mn>2</mn> </msup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <msup> <mi>μ</mi> <mn>2</mn> </msup> <mrow> <mo stretchy="false">(</mo> <mrow> <mo>⌊</mo> <msup> <mi>n</mi> <mi>c</mi> </msup> <mo>⌋</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mspace width="0.166667em" /> <mspace width="0.166667em" /> <mspace width="0.166667em" /> <munder> <mo>∑</mo> <mrow> <mi>n</mi> <mo>≤</mo> <mi>N</mi> </mrow> </munder> <msup> <mi>μ</mi> <mn>2</mn> </msup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <msub> <mi>q</mi> <mn>2</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mrow> <mo>⌊</mo> <msup> <mi>n</mi> <mi>c</mi> </msup> <mo>⌋</mo> </mrow> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_667_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="41" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mu ^2(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>μ</mi> <mn>2</mn> </msup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_667_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\(q_2(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>q</mi> <mn>2</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> are the characteristic functions of square-free and square-full integers, respectively. Using the exponent pair approach, it is proved that the sequence <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_667_Article_IEq5.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="74" /> </InlineMediaObject> <EquationSource Format="TEX">\((\lfloor n^c \rfloor )_{n\in Q_2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">(</mo> <mrow> <mo>⌊</mo> <msup> <mi>n</mi> <mi>c</mi> </msup> <mo>⌋</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mrow> <mi>n</mi> <mo>∈</mo> <msub> <mi>Q</mi> <mn>2</mn> </msub> </mrow> </msub> </math></EquationSource> </InlineEquation> contains infinitely many square-free integers, where <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_667_Article_IEq6.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(Q_2\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>Q</mi> <mn>2</mn> </msub> </math></EquationSource> </InlineEquation> is the set of all square-free numbers and <i>c</i> belongs to a range depending on two exponent pairs. By the same method, it is shown that the sequence <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10998_2025_667_Article_IEq5.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="74" /> </InlineMediaObject> <EquationSource Format="TEX">\((\lfloor n^c \rfloor )_{n\in Q_2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">(</mo> <mrow> <mo>⌊</mo> <msup> <mi>n</mi> <mi>c</mi> </msup> <mo>⌋</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mrow> <mi>n</mi> <mo>∈</mo> <msub> <mi>Q</mi> <mn>2</mn> </msub> </mrow> </msub> </math></EquationSource> </InlineEquation> contains infinitely many square-full integers, where <i>c</i> belongs to a range depending on another two exponent pairs.</p>

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

Square-free and square-full numbers in Piatetski–Shapiro subsequences

  • Watcharapon Pimsert,
  • Teerapat Srichan,
  • Vichian Laohakosol

摘要

Let \(\lfloor z\rfloor \) z be the integer part of a real number z. For non-integer \(c>1\) c > 1 , asymptotic formulas are derived for sums of the forms \(\begin{aligned} \sum _{n\le N}\mu ^2(n)\mu ^2(\lfloor n^c \rfloor ), \,\,\,\sum _{n\le N}\mu ^2(n)q_2(\lfloor n^c \rfloor ) \end{aligned}\) n N μ 2 ( n ) μ 2 ( n c ) , n N μ 2 ( n ) q 2 ( n c ) where \(\mu ^2(n)\) μ 2 ( n ) and \(q_2(n)\) q 2 ( n ) are the characteristic functions of square-free and square-full integers, respectively. Using the exponent pair approach, it is proved that the sequence \((\lfloor n^c \rfloor )_{n\in Q_2}\) ( n c ) n Q 2 contains infinitely many square-free integers, where \(Q_2\) Q 2 is the set of all square-free numbers and c belongs to a range depending on two exponent pairs. By the same method, it is shown that the sequence \((\lfloor n^c \rfloor )_{n\in Q_2}\) ( n c ) n Q 2 contains infinitely many square-full integers, where c belongs to a range depending on another two exponent pairs.