Please type your explanation It will be greatly appreciated

Please type your explanation!!!!! It will be greatly appreciated.

We have learned that we can block-convert a binary number to octal by grouping the binary number into blocks of 3 digits (going from right to left, perhaps padding the binary number with one or two leading zeros to complete the leftmost block of three) and converting each 3 digit binary number into one octal digit. The following is a proof that this procedure works as advertised Suppose n is a nonnegative integer and its binary expansion is given by where each dk E {0,1) and m is a nonnegative integer. We can assume without loss of generality that the number of terms in this sum is a multiple of 3,i.e. m 1 3q for some natural number q We now group the sum into blocks of 3 terms each, as follows: 1 2 1 1 3i+j 1:0 j=0 We now set o; - d3i + 2d3i+1 +4d3i+2 for all i and get 1 Since each dk is 0 or 1, the 0i satisfy 0 % 7, i.e., there are octal digits. We have found the octal expansion of n, and it is obtained by block-converting three binary digits at a time to octal, from right to left.

Solution

Binary numbers can be converted to base b for numbers which can be written as 2^m=b where m is a positive integer. For example 8,16,32