Assuming n is a decimal number.
Divide n by 2 repeatedly, and summing the remainders will give the number of one's in binary representation.
pseudocode of algorithm:
Enter value of n:
sum=0;
while n>0 {
sum=mod(n,2);
n=n/2 [integer division]
}
Display n, sum
Answer:
The sum of the interior angles of any quadrilateral is 360°.
Your answer would be "7,376,024".
Ok, insert (-10) for x
Multiply (-10) and 4 (-40)
Change subtraction to addition of the opposite [(-40) + (-100)]
Your answer is -140
Hope this helps.
1) 3+2x and 4-5x ; they want the sum so ..... (3+2x)+(4-5x) .... 3+2x+4-5x ..... = -3x+7
This answer helps us figure out the sum of the complex numbers because the "i" and "x" are just simply variables so the same simplification would apply.
2) 1-3x and 2+x ; They want us to find the product or multiplication of these two binomials: (1-3x)(2+x) ... To achieve this we use the FOIL method. We get:
2+x-6x-3x^2 ... = (-3x)^2 -5x+2.
The same reasoning applies just like number 1.
