<p>Let <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\overline{p}_{k}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mi>p</mi> <mo>¯</mo> </mover> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the number of overpartition <i>k</i>-tuples of <i>n</i>. In 2023, Saikia (Boletín de la Sociedad Matemática Mexicana 29:15, 2023) conjectured the following congruences: <Equation ID="Equ61"> <EquationSource Format="TEX">\(\begin{aligned} \overline{p}_{q}(8n+2)&amp;\equiv 0 \pmod {4},\quad \overline{p}_{q}(8n+3) \equiv 0 \pmod {8},\quad \\ \overline{p}_{q}(8n+4)&amp;\equiv 0 \pmod {2},\quad \overline{p}_{q}(8n+5) \equiv 0 \pmod {8}, \\ \overline{p}_{q}(8n+6)&amp;\equiv 0 \pmod {8},\quad \overline{p}_{q}(8n+7)\equiv 0 \pmod {32}, \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <msub> <mover> <mi>p</mi> <mo>¯</mo> </mover> <mi>q</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mn>8</mn> <mi>n</mi> <mo>+</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mspace width="1em" /> <msub> <mover> <mi>p</mi> <mo>¯</mo> </mover> <mi>q</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mn>8</mn> <mi>n</mi> <mo>+</mo> <mn>3</mn> <mo stretchy="false">)</mo> </mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>8</mn> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mspace width="1em" /> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="right"> <mrow> <mrow /> <msub> <mover> <mi>p</mi> <mo>¯</mo> </mover> <mi>q</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mn>8</mn> <mi>n</mi> <mo>+</mo> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mspace width="1em" /> <msub> <mover> <mi>p</mi> <mo>¯</mo> </mover> <mi>q</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mn>8</mn> <mi>n</mi> <mo>+</mo> <mn>5</mn> <mo stretchy="false">)</mo> </mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>8</mn> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="right"> <mrow> <mrow /> <msub> <mover> <mi>p</mi> <mo>¯</mo> </mover> <mi>q</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mn>8</mn> <mi>n</mi> <mo>+</mo> <mn>6</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>8</mn> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mspace width="1em" /> <msub> <mover> <mi>p</mi> <mo>¯</mo> </mover> <mi>q</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mn>8</mn> <mi>n</mi> <mo>+</mo> <mn>7</mn> <mo stretchy="false">)</mo> </mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>32</mn> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(n\ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> and <i>q</i> is prime. Recently, Sellers (Boletín de la Sociedad Matemática Mexicana 30:2, 2024) showed that these congruences hold for all odd integers <i>q</i> (not necessarily prime). In this paper, we show that the above congruences hold for all positive integers <i>q</i> (not necessarily odd). We also prove the following congruences on <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\overline{OPT}_k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mrow> <mi mathvariant="italic">OPT</mi> </mrow> <mo>¯</mo> </mover> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, the number of overpartition <i>k</i>-tuples with odd parts of <i>n</i>: For all <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(i,j\ge 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo>≥</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(n\ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, <i>r</i> not a multiple of 2, <i>k</i> not a multiple of 2 or 3, and <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation> not a power of 2, nor a multiple of 2 or 3, we have <Equation ID="Equ62"> <EquationSource Format="TEX">\(\begin{aligned} \overline{OPT}_{2^i\cdot r}(8n+7)&amp;\equiv 0 \pmod {2^{i+4}},\\ \overline{OPT}_{3^i\cdot 2^j\cdot k}(3n+2)&amp;\equiv 0 \pmod {3^{i+1}\cdot 2^{j+2}},\\ \overline{OPT}_{3^i\cdot 2^j\cdot k}(3n+1)&amp;\equiv 0 \pmod {3^{i}\cdot 2^{j+1}},\\ \overline{OPT}_{3^i\cdot \ell }(3n+2)&amp;\equiv 0 \pmod {3^{i+1}\cdot 2},\\ \overline{OPT}_{3^i\cdot \ell }(3n+1)&amp;\equiv 0 \pmod {3^{i}\cdot 2},\end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <msub> <mover> <mrow> <mi mathvariant="italic">OPT</mi> </mrow> <mo>¯</mo> </mover> <mrow> <msup> <mn>2</mn> <mi>i</mi> </msup> <mo>·</mo> <mi>r</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mn>8</mn> <mi>n</mi> <mo>+</mo> <mn>7</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mn>2</mn> <mrow> <mi>i</mi> <mo>+</mo> <mn>4</mn> </mrow> </msup> <mo stretchy="false">)</mo> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="right"> <mrow> <mrow /> <msub> <mover> <mrow> <mi mathvariant="italic">OPT</mi> </mrow> <mo>¯</mo> </mover> <mrow> <msup> <mn>3</mn> <mi>i</mi> </msup> <mo>·</mo> <msup> <mn>2</mn> <mi>j</mi> </msup> <mo>·</mo> <mi>k</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mn>3</mn> <mi>n</mi> <mo>+</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mn>3</mn> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>·</mo> <msup> <mn>2</mn> <mrow> <mi>j</mi> <mo>+</mo> <mn>2</mn> </mrow> </msup> <mo stretchy="false">)</mo> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="right"> <mrow> <mrow /> <msub> <mover> <mrow> <mi mathvariant="italic">OPT</mi> </mrow> <mo>¯</mo> </mover> <mrow> <msup> <mn>3</mn> <mi>i</mi> </msup> <mo>·</mo> <msup> <mn>2</mn> <mi>j</mi> </msup> <mo>·</mo> <mi>k</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mn>3</mn> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mn>3</mn> <mi>i</mi> </msup> <mo>·</mo> <msup> <mn>2</mn> <mrow> <mi>j</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo stretchy="false">)</mo> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="right"> <mrow> <mrow /> <msub> <mover> <mrow> <mi mathvariant="italic">OPT</mi> </mrow> <mo>¯</mo> </mover> <mrow> <msup> <mn>3</mn> <mi>i</mi> </msup> <mo>·</mo> <mi>ℓ</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mn>3</mn> <mi>n</mi> <mo>+</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mn>3</mn> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>·</mo> <mn>2</mn> <mo stretchy="false">)</mo> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="right"> <mrow> <mrow /> <msub> <mover> <mrow> <mi mathvariant="italic">OPT</mi> </mrow> <mo>¯</mo> </mover> <mrow> <msup> <mn>3</mn> <mi>i</mi> </msup> <mo>·</mo> <mi>ℓ</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mn>3</mn> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mn>3</mn> <mi>i</mi> </msup> <mo>·</mo> <mn>2</mn> <mo stretchy="false">)</mo> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where the first congruence was posed as a conjecture by Sarma et al. (Arithmetic properties modulo powers of 2 for overpartition <i>k</i>-tuples with odd parts, 2023) and the latter four were conjectured by Das et al. (Arithmetic properties modulo powers of 2 and 3 for overpartition <i>k</i>-tuples with odd parts, 2024).</p>

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

Congruences modulo powers of 2 and 3 for overpartition k-tuples

  • G. Kavya Keerthana,
  • S. Ananya,
  • D. Ranganatha

摘要

Let \(\overline{p}_{k}(n)\) p ¯ k ( n ) denote the number of overpartition k-tuples of n. In 2023, Saikia (Boletín de la Sociedad Matemática Mexicana 29:15, 2023) conjectured the following congruences: \(\begin{aligned} \overline{p}_{q}(8n+2)&\equiv 0 \pmod {4},\quad \overline{p}_{q}(8n+3) \equiv 0 \pmod {8},\quad \\ \overline{p}_{q}(8n+4)&\equiv 0 \pmod {2},\quad \overline{p}_{q}(8n+5) \equiv 0 \pmod {8}, \\ \overline{p}_{q}(8n+6)&\equiv 0 \pmod {8},\quad \overline{p}_{q}(8n+7)\equiv 0 \pmod {32}, \end{aligned}\) p ¯ q ( 8 n + 2 ) 0 ( mod 4 ) , p ¯ q ( 8 n + 3 ) 0 ( mod 8 ) , p ¯ q ( 8 n + 4 ) 0 ( mod 2 ) , p ¯ q ( 8 n + 5 ) 0 ( mod 8 ) , p ¯ q ( 8 n + 6 ) 0 ( mod 8 ) , p ¯ q ( 8 n + 7 ) 0 ( mod 32 ) , where \(n\ge 0\) n 0 and q is prime. Recently, Sellers (Boletín de la Sociedad Matemática Mexicana 30:2, 2024) showed that these congruences hold for all odd integers q (not necessarily prime). In this paper, we show that the above congruences hold for all positive integers q (not necessarily odd). We also prove the following congruences on \(\overline{OPT}_k(n)\) OPT ¯ k ( n ) , the number of overpartition k-tuples with odd parts of n: For all \(i,j\ge 1\) i , j 1 , \(n\ge 0\) n 0 , r not a multiple of 2, k not a multiple of 2 or 3, and \(\ell \) not a power of 2, nor a multiple of 2 or 3, we have \(\begin{aligned} \overline{OPT}_{2^i\cdot r}(8n+7)&\equiv 0 \pmod {2^{i+4}},\\ \overline{OPT}_{3^i\cdot 2^j\cdot k}(3n+2)&\equiv 0 \pmod {3^{i+1}\cdot 2^{j+2}},\\ \overline{OPT}_{3^i\cdot 2^j\cdot k}(3n+1)&\equiv 0 \pmod {3^{i}\cdot 2^{j+1}},\\ \overline{OPT}_{3^i\cdot \ell }(3n+2)&\equiv 0 \pmod {3^{i+1}\cdot 2},\\ \overline{OPT}_{3^i\cdot \ell }(3n+1)&\equiv 0 \pmod {3^{i}\cdot 2},\end{aligned}\) OPT ¯ 2 i · r ( 8 n + 7 ) 0 ( mod 2 i + 4 ) , OPT ¯ 3 i · 2 j · k ( 3 n + 2 ) 0 ( mod 3 i + 1 · 2 j + 2 ) , OPT ¯ 3 i · 2 j · k ( 3 n + 1 ) 0 ( mod 3 i · 2 j + 1 ) , OPT ¯ 3 i · ( 3 n + 2 ) 0 ( mod 3 i + 1 · 2 ) , OPT ¯ 3 i · ( 3 n + 1 ) 0 ( mod 3 i · 2 ) , where the first congruence was posed as a conjecture by Sarma et al. (Arithmetic properties modulo powers of 2 for overpartition k-tuples with odd parts, 2023) and the latter four were conjectured by Das et al. (Arithmetic properties modulo powers of 2 and 3 for overpartition k-tuples with odd parts, 2024).