We present a unified approach to establish infinite families of congruences for [Formula: see text] for arbitrary positive integer [Formula: see text], where [Formula: see text] is given by the [Formula: see text]th power of the Euler product [Formula: see text]. For [Formula: see text], define [Formula: see text] to be the least positive integer such that [Formula: see text] and [Formula: see text] the least non-negative integer satisfying [Formula: see text]. Using the Atkin [Formula: see text]-operator, we find that the generating function of [Formula: see text] (respectively, [Formula: see text]) can be expressed as the product of an integral linear combination of modular functions on [Formula: see text] and [Formula: see text] (respectively, [Formula: see text]) for any [Formula: see text] and [Formula: see text]. By investigating the properties of the modular equations of the [Formula: see text]th order under the Atkin [Formula: see text]-operator, we obtain that these generating functions are determined by some linear recurring sequences. Utilizing the periodicity of these linear recurring sequences modulo [Formula: see text], we are led to infinite families of congruences for [Formula: see text] modulo any [Formula: see text] with [Formula: see text] and periodic relations between the values of [Formula: see text] modulo powers of [Formula: see text]. As applications, infinite families of congruences for many partition functions such as [Formula: see text]-core partition functions, the partition function and Andrews’ spt-function are easily obtained.
Congruence Properties of Binary Partition Functions