power set of natural numbers equal to the power set of integers I need show that the two given sets: power set of natural numbers and power set of integers, have equal cardinality by describing a bijection from one to the other (describe the bijection with formula).
Thanks in advance

Basically, given any bijection $f : X \to Y$, there exists a bijection $g : 2^X \to 2^Y$ where $g(A) = \{f(x)\ |\ x \in A\}$.
Hence, let $f$ be some bijection from the natural numbers (suppose they include $0$, but it doesn't matter) to the integers, such as $f(0) = 0$, $f(1) = 1$, $f(2) = -1$, $f(3) = 2$, $f(4) = -2$ etc.
