Using the information from “Power-Of-Two Number Systems”, convert Binary 11101001110111 to Octal – and show your work!

The sum of the numbers (10 0000 0001)2 and (100 0000 0000)2 is (  )2 and their product is ( )2

The modulus for the field GF(25) is x5+x2+1 and its elements are all five-bit strings. Calculate each of the following and enter your answer in exactly five bits (Example, 01101). 1. 11111 + 00001 2. 00011 x 00011 3. 01100 x 01100

Please explain step by step:Let e = 2.71828183 be the Euler’s number with 8 decimal digits of precision.Find the binary scientific notation of e with five bits after the binary point; i.e. find integer n and bits x1, x2, . . . , x5 such that e = 1.x1x2x3x4x5 × 2 n .Find the single-precision IEEE 754 representation of e. (Hint: Round the result of 223e to the closest integer like m. Convert m to its normalized binary scientific notation and round its fraction to 23 bits after the binary point. Finally, find the normalized binary scientific notation of m/2 23 by subtracting 23 from the power of two in the representation of m).