Elementary proof of congruences modulo 25 for broken k-diamond partitions
classification
🧮 math.CO
keywords
brokencongruencesdeltadiamondelementarymodulopartitionsproof
read the original abstract
Let $\Delta_{k}(n)$ denote the number of $k$-broken diamond partitions of $n$. Quite recently, the second author proved an infinite family of congruences modulo 25 for $\Delta_{k}(n)$ with the help of modular forms. In this paper, we aim to provide an elementary proof of this result.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.