<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(b_3(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>b</mi> <mn>3</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> be the number of 3-regular partitions of <i>n</i>. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo 2 for <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(b_3(2n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>b</mi> <mn>3</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> involving every prime <i>p</i> with <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="192" /> </InlineMediaObject> <EquationSource Format="TEX">\(p \equiv 13, 17, 19, 23 \pmod {24}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≡</mo> <mn>13</mn> <mo>,</mo> <mn>17</mn> <mo>,</mo> <mn>19</mn> <mo>,</mo> <mn>23</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>24</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, and O. X. M. Yao provided new infinite families of Ramanujan type congruences modulo 2 for <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(b_3(2n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>b</mi> <mn>3</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> involving every prime <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(p\geqslant 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>⩾</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation>. In this paper, we introduce new infinite Ramanujan type congruences modulo 2 for <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(b_3(2n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>b</mi> <mn>3</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> with cube-free period. In contrast to the work of Keith-Zanello and Yao, the congruences presented here do not originate in local obstructions and thus complement these recent results. They involve primes in <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq7.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="554" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal P=\{p \text { prime }: \exists \, j\in \{1,4,8\},\, x, y \in \mathbb Z,\, \gcd (x,y)=1 \text { with } x^2+216y^2=jp\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">P</mi> <mo>=</mo> <mo stretchy="false">{</mo> <mi>p</mi> <mspace width="0.333333em" /> <mtext>prime</mtext> <mspace width="0.333333em" /> <mo>:</mo> <mo>∃</mo> <mspace width="0.166667em" /> <mi>j</mi> <mo>∈</mo> <mrow> <mo stretchy="false">{</mo> <mn>1</mn> <mo>,</mo> <mn>4</mn> <mo>,</mo> <mn>8</mn> <mo stretchy="false">}</mo> </mrow> <mo>,</mo> <mspace width="0.166667em" /> <mi>x</mi> <mo>,</mo> <mi>y</mi> <mo>∈</mo> <mi mathvariant="double-struck">Z</mi> <mo>,</mo> <mspace width="0.166667em" /> <mo movablelimits="true">gcd</mo> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo>,</mo> <mi>y</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mn>1</mn> <mspace width="0.333333em" /> <mtext>with</mtext> <mspace width="0.333333em" /> <msup> <mi>x</mi> <mn>2</mn> </msup> <mo>+</mo> <mn>216</mn> <msup> <mi>y</mi> <mn>2</mn> </msup> <mo>=</mo> <mi>j</mi> <mi>p</mi> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> whose Dirichlet density is 1/6. As a key ingredient in our proof we show that the number of primitive solutions for <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq8.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="124" /> </InlineMediaObject> <EquationSource Format="TEX">\(x^2+216y^2=pm\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>x</mi> <mn>2</mn> </msup> <mo>+</mo> <mn>216</mn> <msup> <mi>y</mi> <mn>2</mn> </msup> <mo>=</mo> <mi>p</mi> <mi>m</mi> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq9.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(p \in {\mathcal {P}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>∈</mo> <mi mathvariant="script">P</mi> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq10.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(p\not \mid m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>∤</mo> <mi>m</mi> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13398_2025_1754_Article_IEq11.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="129" /> </InlineMediaObject> <EquationSource Format="TEX">\(pm\equiv 1\pmod {24}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mi>m</mi> <mo>≡</mo> <mn>1</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>24</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, is divisible by 8. Here, the difficulty arises from the fact that 216 is not idoneal. We also give a conjectural exact formula for the number of solutions for this Diophantine equation.</p>

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

Parity of 3-regular partition numbers and Diophantine equations

  • Cristina Ballantine,
  • Mircea Merca,
  • Cristian-Silviu Radu

摘要

Let \(b_3(n)\) b 3 ( n ) be the number of 3-regular partitions of n. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo 2 for \(b_3(2n)\) b 3 ( 2 n ) involving every prime p with \(p \equiv 13, 17, 19, 23 \pmod {24}\) p 13 , 17 , 19 , 23 ( mod 24 ) , and O. X. M. Yao provided new infinite families of Ramanujan type congruences modulo 2 for \(b_3(2n)\) b 3 ( 2 n ) involving every prime \(p\geqslant 5\) p 5 . In this paper, we introduce new infinite Ramanujan type congruences modulo 2 for \(b_3(2n)\) b 3 ( 2 n ) with cube-free period. In contrast to the work of Keith-Zanello and Yao, the congruences presented here do not originate in local obstructions and thus complement these recent results. They involve primes in \(\mathcal P=\{p \text { prime }: \exists \, j\in \{1,4,8\},\, x, y \in \mathbb Z,\, \gcd (x,y)=1 \text { with } x^2+216y^2=jp\}\) P = { p prime : j { 1 , 4 , 8 } , x , y Z , gcd ( x , y ) = 1 with x 2 + 216 y 2 = j p } whose Dirichlet density is 1/6. As a key ingredient in our proof we show that the number of primitive solutions for \(x^2+216y^2=pm\) x 2 + 216 y 2 = p m , \(p \in {\mathcal {P}}\) p P , \(p\not \mid m\) p m and \(pm\equiv 1\pmod {24}\) p m 1 ( mod 24 ) , is divisible by 8. Here, the difficulty arises from the fact that 216 is not idoneal. We also give a conjectural exact formula for the number of solutions for this Diophantine equation.