加载中…
We prove congruences for the number of partition pairs such that is non-empty, , and where is the smallest part and is the largest part of a partition. The proofs use Bailey’s Lemma and a generalized Lambert series identity of Chan. We also discuss how a partition pair crank gives combinatorial refinements of these congruences.

生成讲解博客的中文版本

生成AI智能校验的中文版本