x = 3
#1 -2x + 5 = -31

3. (6 pts) internally in the computer, with few exceptions, all numerical computation is done using binary numbers. output, however, often uses ascii, which is formed by appending 011 to the left of a bcd code. thus, an algorithm that directly converts a binary integer to a bcd integer is very useful. here is one such algorithm 1) draw lines to the left of the binary number to bound the expected bcd decades. (each decade is a group of 4 bits.) move the binary number one bit to the left. add 0011 to each bcd decade containing a binary value> 0100 repeat steps 2-3 until the last bit in the binary number has been moved into the least significant decade position. (note that when the last bit has been shifted into bcd decade, step 3 is not repeated.) read the bcd result. 2) 3) 4) 5) a) execute the algorithm for the binary number 1101101 b) execute the algorithm for the binary number 01110101110 4. (4 pts) represent the decimal number 3568 in bcd; excess-3 code; ascil; and hex.

Use a while-end loop in a script file to calculate the sum of the first n terms of the series: summation sign on the top n bottom k=1 : )^k * k^2 +5k)/3^k show the script file and the two results of n = 10 and n = 20.

Create a function called quadform( ) that takes as input the coefficients of the quadratic equation (a, b,c) and returns the two distinct real roots (x1,x2) as output, if they exist. in addition, the function returns a message (flag) that informs the user if an error occurred when trying to find two distinct real roots. the possible errors are: (1) "only one root is found"; (2) "imaginary roots are found"; (3) "any value of x is a solution"; (4) "no zeroes exist." if no errors occur, then flag should be "no errors".