<p>We aim to get an algebraic generalization of Alladi–Johnson’s (A–J) work on Duality between Prime Factors and the Prime Number Theorem for Arithmetic Progressions - II, using the Chebotarev Density Theorem (CDT). It has been proved by A–J, that for all positive integers <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(k,\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>,</mo> <mi>ℓ</mi> </mrow> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="74" /> </InlineMediaObject> <EquationSource Format="TEX">\(1\le \ell \le k\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>≤</mo> <mi>ℓ</mi> <mo>≤</mo> <mi>k</mi> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="68" /> </InlineMediaObject> <EquationSource Format="TEX">\((\ell ,k)=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>ℓ</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, <Equation ID="Equ47"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_Equ47.gif" Format="GIF" Height="51" Rendition="HTML" Resolution="72" Type="Linedraw" Width="222" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \sum _{n\ge 2;\;p_1(n) \equiv \ell \;(mod\;k)}\frac{\mu (n)\omega (n)}{n} = 0, \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> <mn>2</mn> <mo>;</mo> <mspace width="0.277778em" /> <msub> <mi>p</mi> <mn>1</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mo>≡</mo> <mi>ℓ</mi> <mspace width="0.277778em" /> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mi>o</mi> <mi>d</mi> <mspace width="0.277778em" /> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </munder> <mfrac> <mrow> <mi>μ</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mi>ω</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mi>n</mi> </mfrac> <mo>=</mo> <mn>0</mn> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="35" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mu (n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>μ</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is the Möbius function, <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="35" /> </InlineMediaObject> <EquationSource Format="TEX">\(\omega (n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ω</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is the number of distinct prime factors of <i>n</i>, and <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="40" /> </InlineMediaObject> <EquationSource Format="TEX">\(p_1(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>p</mi> <mn>1</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is the smallest prime factor of <i>n</i>. In our work here, we will prove the following result: If <i>C</i> is a conjugacy class of the Galois group of some finite extension <i>K</i> of <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_IEq7.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {Q}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">Q</mi> </math></EquationSource> </InlineEquation>, then <Equation ID="Equ48"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_Equ48.gif" Format="GIF" Height="61" Rendition="HTML" Resolution="72" Type="Linedraw" Width="193" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \sum _{ n \ge 2;\;\left[ \frac{K/\mathbb {Q}}{p_1(n)}\right] =C} \frac{\mu (n)\omega (n)}{n} = 0. \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> <mn>2</mn> <mo>;</mo> <mspace width="0.277778em" /> <mfenced close="]" open="["> <mfrac> <mrow> <mi>K</mi> <mo stretchy="false">/</mo> <mi mathvariant="double-struck">Q</mi> </mrow> <mrow> <msub> <mi>p</mi> <mn>1</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </mfrac> </mfenced> <mo>=</mo> <mi>C</mi> </mrow> </munder> <mfrac> <mrow> <mi>μ</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mi>ω</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mi>n</mi> </mfrac> <mo>=</mo> <mn>0</mn> <mo>.</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_IEq8.gif" Format="GIF" Height="33" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(\left[ \frac{K/\mathbb {Q}}{p_1(n)}\right] \)</EquationSource> <EquationSource Format="MATHML"><math> <mfenced close="]" open="["> <mfrac> <mrow> <mi>K</mi> <mo stretchy="false">/</mo> <mi mathvariant="double-struck">Q</mi> </mrow> <mrow> <msub> <mi>p</mi> <mn>1</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </mfrac> </mfenced> </math></EquationSource> </InlineEquation> is the Artin symbol. When <i>K</i> is a cyclotomic extension of <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2025_626_Article_IEq7.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {Q}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">Q</mi> </math></EquationSource> </InlineEquation>, this reduces to the exact case of A–J’s result.</p>

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

Algebraic analogues of results of Alladi–Johnson using the Chebotarev Density Theorem

  • Sroyon Sengupta

摘要

We aim to get an algebraic generalization of Alladi–Johnson’s (A–J) work on Duality between Prime Factors and the Prime Number Theorem for Arithmetic Progressions - II, using the Chebotarev Density Theorem (CDT). It has been proved by A–J, that for all positive integers \(k,\ell \) k , such that \(1\le \ell \le k\) 1 k and \((\ell ,k)=1\) ( , k ) = 1 , \(\begin{aligned} \sum _{n\ge 2;\;p_1(n) \equiv \ell \;(mod\;k)}\frac{\mu (n)\omega (n)}{n} = 0, \end{aligned}\) n 2 ; p 1 ( n ) ( m o d k ) μ ( n ) ω ( n ) n = 0 , where \(\mu (n)\) μ ( n ) is the Möbius function, \(\omega (n)\) ω ( n ) is the number of distinct prime factors of n, and \(p_1(n)\) p 1 ( n ) is the smallest prime factor of n. In our work here, we will prove the following result: If C is a conjugacy class of the Galois group of some finite extension K of \(\mathbb {Q}\) Q , then \(\begin{aligned} \sum _{ n \ge 2;\;\left[ \frac{K/\mathbb {Q}}{p_1(n)}\right] =C} \frac{\mu (n)\omega (n)}{n} = 0. \end{aligned}\) n 2 ; K / Q p 1 ( n ) = C μ ( n ) ω ( n ) n = 0 . where \(\left[ \frac{K/\mathbb {Q}}{p_1(n)}\right] \) K / Q p 1 ( n ) is the Artin symbol. When K is a cyclotomic extension of \(\mathbb {Q}\) Q , this reduces to the exact case of A–J’s result.