论文标题
最小部分给定均等的n分区数量
Number of partitions of n with a given parity of the smallest part
论文作者
论文摘要
我们获得了伯科维奇和uncu的令人惊讶的加权分区平等的组合证明。我们的证明自然会导致一个公式，以给定最小部分给定奇偶校验的分区数量，就s（i）而言，i的分区数量分为不同的部分，均匀等级的数量是奇数等级，为此，安德鲁斯，戴森和希克森几乎封闭的公式。这种计算最小部分给定奇偶校验的N分区数量的方法是实用有效的。
We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of partitions of i into distinct parts with even rank minus the number with odd rank, for which there is an almost closed formula by Andrews, Dyson and Hickerson. This method of calculating the number of partitions of n with a given parity of the smallest part is practical and efficient.
