Partitions of n where every element of the partition is different from 1 is
I am trying to prove that p(n| every element in the partition is different of , and I am quite lost... I have tried first giving a biyection between some sets, trying to draw an example in a Ferrers diagram and working on it... Nevertheless, I have not obtained significant results. Then, I have thought about generating functions; we know that the generating function of is , so will have as generating function. So, what we have to prove is that -x). is the generating function of p(n|every element in the partition is different of 1)... but i'm am not seeing why! Any help or hint will be appreciate it!