Let the binary representation of positive integer $n$ be $b_tb_{t-1}\cdots b_1b_0$. Show that $$\binom{n}{2^j} \equiv b_j \pmod{2}$$

where $j$ is a non-negative integer. Note that $\binom{n}{m} = 0$ if $m > n$.