Problem: Prove that p(n) is equal to the number of partitions of the integer 2n with no odd parts.
Now i don't really understand what no odd parts means? I've looked online and have yet to find a problem saying no odd parts. Does this just mean even? I'm not sure where to start with this one due to the wording. Any help?
Also we arent allowed to use generating functions to show this