2000 character limit reached
Elementary proof of congruences modulo 25 for broken $k$-diamond partitions
Published 5 Jul 2018 in math.CO | (1807.01890v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.