Related papers: Elementary formulas for integer partitions

We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…

In this paper, we calculate an exact formula for the number of partitions of a natural number $n$, where the largest part is even and no odd parts appears more than two times. The generating functions of the number of these partitions is a…

A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…

In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In…

A well-studied statistic of an integer partition is the size of its Durfee square. In particular, the number $D_k (n)$ of partitions of $n$ with Durfee square of fixed size $k$ has a well-known simple rational generating function. We study…

The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for…

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…

We prove new formulas for $p_d(n)$, the number of $d$-ary partitions of $n$, and, also, for its polynomial part. Given a partition $\lambda=(\lambda_1,\ldots,\lambda_{\ell})$, its associated $j$-th symmetric elementary partition,…

This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

We revisit Euler's partition function recurrence, which asserts, for integers $n\geq 1,$ that $$ p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+\dots = \sum_{k\in \mathbb{Z}\setminus \{0\}} (-1)^{k+1} p(n-\omega(k)), $$ where $\omega(m):=(3m^2+m)/2$ is…

We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…

The partition function $ p_{[1^c11^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{11}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{11 n})^d}.\] In this paper, we prove infinite families of…

The details for the construction of an explicit formula for the divisors function d(n) = #{d | n} are formalized in this article. This formula facilitates a unified approach to the investigation of the error terms of the divisor problem and…

Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…

A $k$-regular partition into distinct parts is a partition into distinct parts with no part divisible by $k$. In this paper, we provide a general method to establish the unimodality of $k$-regular partition into distinct parts where the…

Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…