<p>The arithmetic properties of the second order mock theta function <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\mathcal {B}(q)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">B</mi> <mo stretchy="false">(</mo> <mi>q</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, introduced by McIntosh, defined by <Equation ID="Equ103"> <EquationSource Format="TEX">\(\begin{aligned} \mathcal {B}(q) := \sum _{n \ge 0} \frac{q^n (-q;q^2)_n}{(q;q^2)_{n+1}} = \sum _{n \ge 0}b(n)q^n, \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mi mathvariant="script">B</mi> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo stretchy="false">)</mo> </mrow> <mo>:</mo> <mo>=</mo> <munder> <mo>∑</mo> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </munder> <mfrac> <mrow> <msup> <mi>q</mi> <mi>n</mi> </msup> <msub> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mi>q</mi> <mo>;</mo> <msup> <mi>q</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> <mi>n</mi> </msub> </mrow> <msub> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo>;</mo> <msup> <mi>q</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mfrac> <mo>=</mo> <munder> <mo>∑</mo> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </munder> <mi>b</mi> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <msup> <mi>q</mi> <mi>n</mi> </msup> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>have been extensively studied. For instance, for all <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(n\ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, Kaur and Rana [<CitationRef CitationID="CR9">9</CitationRef>] established congruences such as <Equation ID="Equ104"> <EquationSource Format="TEX">\(\begin{aligned} b(12n+10)&amp;\equiv 0 \pmod {36}, \quad b(18n+16) \equiv 0 \pmod {72}, \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mi>b</mi> <mo stretchy="false">(</mo> <mn>12</mn> <mi>n</mi> <mo>+</mo> <mn>10</mn> <mo stretchy="false">)</mo> </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" /> <mn>36</mn> <mo stretchy="false">)</mo> <mo>,</mo> <mspace width="1em" /> <mi>b</mi> <mo stretchy="false">(</mo> <mn>18</mn> <mi>n</mi> <mo>+</mo> <mn>16</mn> <mo stretchy="false">)</mo> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>72</mn> <mo stretchy="false">)</mo> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>Chen and Mao [<CitationRef CitationID="CR6">6</CitationRef>] proved that for all <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>, <Equation ID="Equ105"> <EquationSource Format="TEX">\(\begin{aligned} b(4n+1)&amp;\equiv 0 \pmod {2}, \quad b(4n+2) \equiv 0 \pmod {4}, \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mi>b</mi> <mo stretchy="false">(</mo> <mn>4</mn> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </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" /> <mn>2</mn> <mo stretchy="false">)</mo> <mo>,</mo> <mspace width="1em" /> <mi>b</mi> <mo stretchy="false">(</mo> <mn>4</mn> <mi>n</mi> <mo>+</mo> <mn>2</mn> <mo stretchy="false">)</mo> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>4</mn> <mo stretchy="false">)</mo> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>while Mao [<CitationRef CitationID="CR10">10</CitationRef>] also showed that for all <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(n\ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, <Equation ID="Equ106"> <EquationSource Format="TEX">\(\begin{aligned} b(6n+2)&amp;\equiv 0 \pmod {4}, \quad b(6n+4) \equiv 0 \pmod {9}. \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mi>b</mi> <mo stretchy="false">(</mo> <mn>6</mn> <mi>n</mi> <mo>+</mo> <mn>2</mn> <mo stretchy="false">)</mo> </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" /> <mn>4</mn> <mo stretchy="false">)</mo> <mo>,</mo> <mspace width="1em" /> <mi>b</mi> <mo stretchy="false">(</mo> <mn>6</mn> <mi>n</mi> <mo>+</mo> <mn>4</mn> <mo stretchy="false">)</mo> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>9</mn> <mo stretchy="false">)</mo> <mo>.</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>In this paper, we find new congruences and infinite families of congruences modulo 4,&#xa0;6,&#xa0;36,&#xa0;54,&#xa0;72 for the function <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\mathcal {B}(q)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">B</mi> <mo stretchy="false">(</mo> <mi>q</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. For example, let <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(p \ge 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≥</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation> be a prime and <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(1 \le \ell \le p - 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>≤</mo> <mi>ℓ</mi> <mo>≤</mo> <mi>p</mi> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\left( \frac{12\ell + 9}{p} \right) _L = -1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mfenced close=")" open="("> <mfrac> <mrow> <mn>12</mn> <mi>ℓ</mi> <mo>+</mo> <mn>9</mn> </mrow> <mi>p</mi> </mfrac> </mfenced> <mi>L</mi> </msub> <mo>=</mo> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. Then for all <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(n, k \ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>,</mo> <mi>k</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, we have <Equation ID="Equ107"> <EquationSource Format="TEX">\(\begin{aligned} b\left( 6p^{2k+3}n + \frac{3p^{2k+2}(4\ell +3)-1}{2}\right) \equiv 0 \pmod {36}. \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mi>b</mi> <mfenced close=")" open="("> <mn>6</mn> <msup> <mi>p</mi> <mrow> <mn>2</mn> <mi>k</mi> <mo>+</mo> <mn>3</mn> </mrow> </msup> <mi>n</mi> <mo>+</mo> <mfrac> <mrow> <mn>3</mn> <msup> <mi>p</mi> <mrow> <mn>2</mn> <mi>k</mi> <mo>+</mo> <mn>2</mn> </mrow> </msup> <mrow> <mo stretchy="false">(</mo> <mn>4</mn> <mi>ℓ</mi> <mo>+</mo> <mn>3</mn> <mo stretchy="false">)</mo> </mrow> <mo>-</mo> <mn>1</mn> </mrow> <mn>2</mn> </mfrac> </mfenced> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>36</mn> <mo stretchy="false">)</mo> </mrow> <mo>.</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>Our techniques involve elementary <i>q</i>-series and Maple.</p>

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

Infinite families of congruences for the second order mock theta function \(\mathcal {B}(q)\)

  • Hemjyoti Nath,
  • Hirakjyoti Das

摘要

The arithmetic properties of the second order mock theta function \(\mathcal {B}(q)\) B ( q ) , introduced by McIntosh, defined by \(\begin{aligned} \mathcal {B}(q) := \sum _{n \ge 0} \frac{q^n (-q;q^2)_n}{(q;q^2)_{n+1}} = \sum _{n \ge 0}b(n)q^n, \end{aligned}\) B ( q ) : = n 0 q n ( - q ; q 2 ) n ( q ; q 2 ) n + 1 = n 0 b ( n ) q n , have been extensively studied. For instance, for all \(n\ge 0\) n 0 , Kaur and Rana [9] established congruences such as \(\begin{aligned} b(12n+10)&\equiv 0 \pmod {36}, \quad b(18n+16) \equiv 0 \pmod {72}, \end{aligned}\) b ( 12 n + 10 ) 0 ( mod 36 ) , b ( 18 n + 16 ) 0 ( mod 72 ) , Chen and Mao [6] proved that for all \(n\ge 0\) n 0 , \(\begin{aligned} b(4n+1)&\equiv 0 \pmod {2}, \quad b(4n+2) \equiv 0 \pmod {4}, \end{aligned}\) b ( 4 n + 1 ) 0 ( mod 2 ) , b ( 4 n + 2 ) 0 ( mod 4 ) , while Mao [10] also showed that for all \(n\ge 0\) n 0 , \(\begin{aligned} b(6n+2)&\equiv 0 \pmod {4}, \quad b(6n+4) \equiv 0 \pmod {9}. \end{aligned}\) b ( 6 n + 2 ) 0 ( mod 4 ) , b ( 6 n + 4 ) 0 ( mod 9 ) . In this paper, we find new congruences and infinite families of congruences modulo 4, 6, 36, 54, 72 for the function \(\mathcal {B}(q)\) B ( q ) . For example, let \(p \ge 5\) p 5 be a prime and \(1 \le \ell \le p - 1\) 1 p - 1 such that \(\left( \frac{12\ell + 9}{p} \right) _L = -1\) 12 + 9 p L = - 1 . Then for all \(n, k \ge 0\) n , k 0 , we have \(\begin{aligned} b\left( 6p^{2k+3}n + \frac{3p^{2k+2}(4\ell +3)-1}{2}\right) \equiv 0 \pmod {36}. \end{aligned}\) b 6 p 2 k + 3 n + 3 p 2 k + 2 ( 4 + 3 ) - 1 2 0 ( mod 36 ) . Our techniques involve elementary q-series and Maple.