Related papers: Glaisher's divisors and infinite products
Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…
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}$,…
The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we…
For a finite sequence of positive integers $A=\{a_j\}_{j=1}^{k},$ we prove a recursion for divisor function $\sigma_{x}^{(A)}(n)=\sum_{d|n,\enskip d\in A}d^x.$ As a corollary, we give an affirmative solution of the problem posed in 1969 by…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…
Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of…
Ramanujan famously found congruences for the partition function like p(5n+4) = 0 modulo 5. We provide a method to find all simple congruences of this type in the coefficients of the inverse of a modular form on Gamma_{1}(4) which is…
For any non-negative integer $n$ and non-zero integer $r$, let $p_r(n)$ denote Ramanujan's general partition function. By employing $q$-identities, we prove some new Ramanujan-type congruences modulo 5 for $p_r(n)$ for $r=-(5\lambda+1),…
Euler discovered recurrence for divisor sum functions as a consequence of the pentagonal numbers theorem. With similar idea and also motivated by Ewell's work in 1977, we prove new recurrences for certain divisor sum functions and…
Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius…
One of the main goals in this paper is to establish convolution sums of functions for the divisor sums $\widetilde{\sigma}_s(n)=\sum_{d|n}(-1)^{d-1}d^s$ and $\widehat{\sigma}_s(n)=\sum_{d|n}(-1)^{\frac{n}{d}-1}d^s$, for certain $s$, which…
For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…
Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…
Translation from the Latin of Euler's "Observatio de summis divisorum" (1752). E243 in the Enestroem index. The pentagonal number theorem is that $\prod_{n=1}^\infty (1-x^n)=\sum_{n=-\infty}^\infty (-1)^n x^{n(3n-1)/2}$. This paper assumes…
In 1920, P. A. MacMahon generalized the (classical) notion of divisor sums by relating it to the theory of partitions of integers. In this paper, we extend the idea of MacMahon. In doing so we reveal a wealth of divisibility theorems and…
In this article, we study the arithmetic properties of the partition function $p_8(n)$, the number of 8-colour partitions of $n$. We prove several Ramanujan type congruences modulo higher powers of 2 for the function $p_8(n)$ by finding…
We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…
Dyson famously provided combinatorial explanations for Ramanujan's partition congruences modulo $5$ and $7$ via his rank function, and postulated that an invariant explaining all of Ramanujan's congruences modulo $5$, $7$, and $11$ should…
In the present work, we extend current research in a nearly-forgotten but newly revived topic, initiated by P. A. MacMahon, on a generalized notion which relates the divisor sums to the theory of integer partitions and two infinite families…