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

A further look at the overpartition function modulo \(2^4\) and \(2^5\)

  • Ranganatha Dasappa,
  • Gedela Kavya Keerthana

摘要

In this paper, we describe a systematic way of obtaining the exact generating functions for \(\overline{p}(2n)\) p ¯ ( 2 n ) , \(\overline{p}(4n)\) p ¯ ( 4 n ) (first proved by Fortin et al.), \(\overline{p}(8n)\) p ¯ ( 8 n ) , \(\overline{p}(16n)\) p ¯ ( 16 n ) , etc. where \(\overline{p}(n)\) p ¯ ( n ) denotes the number of overpartitions of n. We further establish several new infinite families of congruences modulo \(2^4\) 2 4 and \(2^5\) 2 5 for \(\overline{p}(n)\) p ¯ ( n ) . For example, we prove that for all \(n, \alpha , \beta \ge 0\) n , α , β 0 and primes \(p\ge 5\) p 5 , \(\begin{aligned} \overline{p}\left( 3^{4\alpha +1}p^{2\beta +1}\left( 24pn+24j+7p\right) \right)&\equiv 0\pmod {2^5} \end{aligned}\) p ¯ 3 4 α + 1 p 2 β + 1 24 p n + 24 j + 7 p 0 ( mod 2 5 ) and \(\begin{aligned} \overline{p}\left( 3^{2\alpha +1}(24n+23)\right)&\equiv 0\pmod {2^5}, \end{aligned}\) p ¯ 3 2 α + 1 ( 24 n + 23 ) 0 ( mod 2 5 ) , where \(\bigl (\frac{-6}{p}\bigr )=-1\) ( - 6 p ) = - 1 and \(1\le j\le p-1\) 1 j p - 1 . The last congruence was proved by Xiong (Int J Number Theory 12:1195–1208, 2016) for modulo \(2^4\) 2 4 .