@@ -0,0 +1,867 @@
+package Chapter01.Section01;%0A%0Apublic class Exercise09%0A%7B%0A    public static void main(String%5B%5D args)%0A    %7B%0A        if (args.length == 1)%0A        %7B%0A            String rawN = args%5B0%5D;%0A            int n = Integer.parseInt(rawN);%0A%0A            if (n %3E 0)%0A            %7B%0A                String result = getBinaryRepresentation(n);%0A                System.out.println(result);%0A            %7D%0A            else%0A            %7B%0A                System.out.println(%22N must be positive; was %22 + String.valueOf(n));%0A            %7D%0A        %7D%0A        else%0A        %7B%0A            System.out.println(%22Must have one integer argument.%22);%0A        %7D%0A    %7D%0A%0A    public static String getBinaryRepresentation(int n)%0A    %7B%0A        String binN = %22%22;%0A%0A        while (n %3E 0)%0A        %7B%0A            int mod = n %25 2;%0A            binN = mod + binN;%0A            n /= 2;%0A        %7D%0A%0A        return binN;%0A    %7D%0A%7D%0A

Solved 1.1.9