AbstractThe partition function P(n) satisfy some congruence properties. Eichhorn and Ono prove the existence of an effective constant C(m,r) (where m,r∈N have some restrictions), such that if p(mn+r)≡0(modm) for n⩽C(m,r), then the congruence holds for every non-negative integer n. In this paper we improve the value of C(m,r) by removing its dependence in r
Let bm(n) denote the number of partitions of n into powers of m. Define σr = ε2m 2 + ε3m 3 + · · ·...
AbstractLet bm(n) denote the number of partitions of n into powers of m. Define σr=ε2m2+ε3m3+…+εrmr,...
Let p_r(n) denote the difference between the number of r-colored partitions of n into an even number...
Let n be a positive integer. A partition of n is a sequence of non-increasing positive integ...
The arithmetic properties of the ordinary partition function p(n) have been the topic of intensive s...
AbstractUsing the theory of modular forms, we show that the three-colored Frobenius partition functi...
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive...
2Abstract. Eighty years ago, Ramanujan conjectured and proved some striking con-gruences for the par...
Folsom, Kent, and Ono used the theory of modular forms modulo ℓ to establish remarkable “self-simila...
AbstractAlthough much is known about the partition function, little is known about its parity. For t...
AbstractLet bℓ(n) denote the number of ℓ-regular partitions of n, where ℓ is a positive power of a p...
The ordinary partition function p(n) counts the number of representations of a positive integer n as...
AbstractOn page 189 in his lost notebook, Ramanujan recorded five assertions about partitions. Two a...
In this paper, motivated by the work of Mahlburg, we find congruences for a large class of modular f...
AbstractWe prove explicit congruences modulo powers of arbitrary primes for three smallest parts fun...
Let bm(n) denote the number of partitions of n into powers of m. Define σr = ε2m 2 + ε3m 3 + · · ·...
AbstractLet bm(n) denote the number of partitions of n into powers of m. Define σr=ε2m2+ε3m3+…+εrmr,...
Let p_r(n) denote the difference between the number of r-colored partitions of n into an even number...
Let n be a positive integer. A partition of n is a sequence of non-increasing positive integ...
The arithmetic properties of the ordinary partition function p(n) have been the topic of intensive s...
AbstractUsing the theory of modular forms, we show that the three-colored Frobenius partition functi...
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive...
2Abstract. Eighty years ago, Ramanujan conjectured and proved some striking con-gruences for the par...
Folsom, Kent, and Ono used the theory of modular forms modulo ℓ to establish remarkable “self-simila...
AbstractAlthough much is known about the partition function, little is known about its parity. For t...
AbstractLet bℓ(n) denote the number of ℓ-regular partitions of n, where ℓ is a positive power of a p...
The ordinary partition function p(n) counts the number of representations of a positive integer n as...
AbstractOn page 189 in his lost notebook, Ramanujan recorded five assertions about partitions. Two a...
In this paper, motivated by the work of Mahlburg, we find congruences for a large class of modular f...
AbstractWe prove explicit congruences modulo powers of arbitrary primes for three smallest parts fun...
Let bm(n) denote the number of partitions of n into powers of m. Define σr = ε2m 2 + ε3m 3 + · · ·...
AbstractLet bm(n) denote the number of partitions of n into powers of m. Define σr=ε2m2+ε3m3+…+εrmr,...
Let p_r(n) denote the difference between the number of r-colored partitions of n into an even number...