On \(m\)-ary partition function congruences: A fresh look at a past problem (Q5931320): Difference between revisions

The author treats \(b_m(n)\), the number of partitions of \(n\) into powers of \(m\), and derives a family of congruences \(b_m(m^{r+1}n- \sigma_r-m)\equiv 0\pmod {m^r/c_r}\), where the symbols \(c_r\) and \(\sigma_r\) depend on \(m\) as follows: \(c_r=1\) if \(m\) is odd, and \(c_r= 2^{r-1}\) if \(m\) is even; \(\sigma_r= \varepsilon_2 m^2+\varepsilon_3 m^3+\cdots+ \varepsilon_rm^r\), where each \(\varepsilon_i\) is 0 or 1. This extends previous work by the author [Proc. Camb. Philos. Soc. 68, 447-453 (1970; Zbl 0206.01905)] and others [\textit{H. Gupta}, Proc. Camb. Philos. Soc. 71, 343-345 (1972; Zbl 0225.10008), \textit{G. E. Andrews}, J. Number Theory 3, 104-110 (1971; Zbl 0215.07002)].