I have already proved that the powerset of the natural numbers is uncountable. To show that P(M) is uncountable where M={n∈N | 2 divides n) I think I need to construct a bijection between P(N) and P(M)? I'm unsure of exactly how to achieve this - I can only imagine a bijection between N and M.
Any help would be appreciated.