function x = bijection(n)
% Bijective function from naturals {1, 2, 3, ... } to bistrings {0 , 1}*
% showing that the set of all bitstrings is a countable set.
x = dec2bin(n);
x = x(2:length(x));