Elementary proof of congruences modulo 25 for broken k-diamond partitions
Abstract
Let 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 k(n) with the help of modular forms. In this paper, we aim to provide an elementary proof of this result.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.