10. (Solved)

Let b(n) denote the number of partitions of n into non-negative powers of 2. Prove that:

OK as I said I have solved that question.

10. Using question 10 prove the following three identities:

a.

b.

c. mod 2 for n>1

I am strugling with this. I think identity a is fairly obvious because for each partition of 2n we create a partition of 2n+1 by adding the only odd part that is available (2^0).

I think identity c followis from identities a. and b. by induction.

However, I have no idea how to tackle identity b.