Related papers: Fractional Powers of the Generating Function for t…
We present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.
We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…
Let $p$ be a prime greater than $3$ and let $a$ be a rational p-adic integer. In this paper we try to determine $\sum_{k=1}^{[p/3]}\binom{3k}ka^k\pmod p$, and real the connection between cubic congruences and the sum…
Let $ p \ge 5 $ be a prime and let $ b, c \in \mathbb{Z} $. Denote by $ T_k(b,c) $ the generalized central trinomial coefficient, i.e., the coefficient of $ x^k $ in $ (x^2 + bx + c)^k $. In this paper, we establish congruences modulo $ p^3…
For a vector $\mathbf a=(a_1,\ldots,a_r)$ of positive integers we prove formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0,…
It was recently shown that $q\omega(q)$, where $\omega(q)$ is one of the third order mock theta functions, is the generating function of $p_{\omega}(n)$, the number of partitions of a positive integer $n$ such that all odd parts are less…
We present a proof of Ramanujan's congruences $$p(5n+4) \equiv 0 \pmod 5 \text{ and } \tau(5n+5) \equiv 0 \pmod 5.$$ The proof only requires a limiting case of Jacobi's triple product, a result that Ramanujan knew well, and a technique…
Let $m\in\N_{\geq 2}$ and for given $k\in\N_{+}$ consider the sequence $(A_{m,k}(n))_{n\in\N}$ defined by the power series expansion $$ \prod_{n=0}^{\infty}\frac{1}{\left(1-x^{m^{n}}\right)^{k}}=\sum_{n=0}^{\infty}A_{m,k}(n)x^{n}. $$ The…
Let $\Bbb Z$ be the set of integers, and let $(m,n)$ be the greatest common divisor of integers $m$ and $n$. Let $p\equiv 1\mod 4$ be a prime, $q\in\Bbb Z$, $2\nmid q$ and $p=c^2+d^2=x^2+qy^2$ with $c,d,x,y\in\Bbb Z$ and $c\e 1\mod 4$.…
In this work, we investigate the arithmetic properties of $p_{1,7^k}(n)$, which counts 2-color partitions of $n$ where one of the colors appears only in parts that are multiples of $7^k$. By constructing generating functions for…
One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…
Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for $k$-colored partition functions $p_{-k}(n)$ for all $k\geq2$. This enables us to extend the $k$-colored partition function multiplicatively to a…
We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these…
The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…
For an arbitrary set or multiset $A$ of positive integers, we associate the $A$-partition function $p_A(n)$ (that is the number of partitions of $n$ whose parts belong to $A$). We also consider the analogue of the $k$-colored partition…
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…
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…
A number of recent papers have estimated ratios of the partition function $p(n-j)/p(n)$, which appears in many applications. Here, we prove an easy-to-use effective bound on these ratios. Using this, we then study second shifted difference…
We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$)…
A q-series with nonnegative power series coefficients is called positive. The partition statistics BG-rank is defined as an alternating sum of parities of parts of a partition. It is known that the generating function for the number of…