Related papers: On $7^k$-regular partitions modulo powers of $7$

In this paper, we prove several new infinite families of Ramanujan--like congruences satisfied by the coefficients of the generating function $U_t(a,q)$ which is an extension of MacMahon's generalized sum-of-divisors function. As a…

Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…

Recently, Andrews and Paule introduced a partition function $PDN1(N)$ which denotes the number of partition diamonds with $(n+1)$ copies of $n$ where summing the parts at the links gives $N$. They also presented the generating function for…

Let $\overline{B}_{s,t}(n)$ denote the number of overpartitions of $n$ where no part is divisible by $s$ or $t$, with $s$ and $t$ being coprime. By establishing the exact generating functions of a family of arithmetic progressions in…

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

Let $p_{k}(n)$ be the coefficient of $q^n$ in the series expansion of $(q;q)_{\infty}^{k}$. It is known that the partition function $p(n)$, which corresponds to the case when $k=-1$, satisfies congruences such as $p(5n+4)\equiv 0\pmod{5}$.…

Recently, Nadji, Ahmia and Ram\'{i}rez \cite{Nadji2025} investigate the arithmetic properties of ${\bar B}_{\ell_1,\ell_2}(n)$, the number of overpartitions where no part is divisible by $\ell_1$ or $\ell_2$ with $\gcd(\ell_1,\ell_2)$$=1$…

For any relatively prime integers $r$ and $s$, let $a_{r,s}(n)$ denote the number of $(r,s)$-regular partitions of a positive integer of $n$ into distinct parts. Prasad and Prasad (2018) proved many infinite families of congruences modulo 2…

Ramanujan's celebrated congruences of the partition function $p(n)$ have inspired a vast amount of results on various partition functions. Kwong's work on periodicity of rational polynomial functions yields a general theorem used to…

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

The restricted partition function $p_{N}(n)$ counts the partitions of $n$ into at most $N$ parts. In the nineteenth century Sylvester showed that these partitions can be expressed as a sum of $k$-periodic quasi-polynomials ($1\leq k\leq N$)…

Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to…

We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…

This paper provides algebraic proofs for several types of congruences involving the multipartition function and self-convolutions of the divisor function. Our computations use methods of Differential Algebra in $\mathbb{Z}/q\mathbb{Z}$,…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Recently, Hirschhorn and the first author considered the parity of the function $a(n)$ which counts the number of integer partitions of $n$ wherein each part appears with odd multiplicity. They derived an effective characterization of the…

In this paper we study the function $b_3(n)$ and $b_5(n)$, which denote the number of $3$-regular partitions and $5$-regular partitions of $n$ respectively. Using the theory of modular forms, we prove several arithmetic properties of…

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

We study $\nu_k(n)$, the number of partitions of $n$ into $k$ part sizes, and find numerous arithmetic progressions where $\nu_2$ and $\nu_3$ take on values divisible by 2 and 4. Expanding earlier work, we show $\nu_2(An+B) \equiv 0…

For each $n\geq 1$, we express the partition function $p(n)$ as a CM trace on $X_0(6)$ of the discriminant $\Delta_n:=1-24n$ invariants of a weight 0 weak Maass function $P$ that records where CM elliptic curves sit on $X(1)$, together with…