论文部分内容阅读
设P(n)表示n的分拆数,即把n表为正整数之和的方法数,Hardy et al在[1]中指出,Macmechon曾于1918年利用公式 P(n)-P(n-1)-P(-2)+P(n-5)+…+(-1)~kP{n-k/2(3(?)-1)}
Let P(n) denote the number of splits of n, that is, the number of methods for which the n is the sum of positive integers. Hardy et al. pointed out in [1] that Macmechon used the formula P(n)-P(n) in 1918. -1)-P(-2)+P(n-5)+...+(-1)~kP{nk/2(3(?)-1)}