JCT
1998
14 years 8 days ago
1998
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
COMBINATORICS
2004
14 years 14 days ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...