Let P(x) be a Polynomial in x defined as follows:
Let R(x)=C be the Polynomial that is obtained as remainder when P(x) is divided by
, where C is a Constant Natural Number .Find the number of 1 s in the Binary/Base-2 Expansion of C .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let's call y = x 2 and the polynomial q ( y ) = P ( x ) ⇒ q ( y ) = y 8 + y 7 + y 6 + . . . + y + 1 → q ( y ) = ( y − 2 ) r ( y ) + C where r ( y ) is a polynomial in y and C is a constant, and C is the same value defined above in the question ⇒ q ( 2 ) = C ( remainder factor theorem ) and q ( 2 ) = 2 8 + 2 7 + 2 6 + . . . . + 2 1 + 1 ⇒ C has 9 one's in base 2.
Note.- (Of course, I'm leting P : R ⟶ R . If it was P : Z 2 ⟶ Z 2 then the answer would be C = 1 = 1 2 ) and C would have 1 only one in base 2. )