In particular, for 0 < a < b < k, they defined W1(a, b; k; n) to be the number of partitions of n in which the parts are congruent to a or b mod ...
確定! 回上一頁