Saturday, 19 April 2014

Remainder when the polynomial 1+x2+x4+cdots+x22 is divided by 1+x+x2cdots+x11





Question : Find the remainder when the polynomial 1+x2+x4++x22 is divided by 1+x+x2++x11.




I tried using Euclid's division lemma, I.e.



P1(x)=1+x2+x4++x22



P2(x)=1+x+x2++x11



Then for some polynomial Q(x) and R(x); we have




P1(x)=Q(x)P2(x)+R(x)



Now, we put the values of x such that R(x)=0 and form equations, but this method is way too long and solving the 11 set of equations for 11 variable (Since R(x) a polynomial of at most 10 degree) is impossible to do for a competitive exam where the average time for solving a question is 3 minutes.



Another method is using the original long division method, and following the pattern, we can predict Q(x) and R(x), but it's also very hard and time taking.



I am searching for a simple solution to this problem since last a week and now I doubt even we have a simple solution to this question.



Can you please give me a hint/solution on how to proceed to solve this problem in time?




Thanks!


Answer



P1(x)=x241x21
P2(x)=x121x1
P1(x)P2(x)=x241x121x1x21=x12+1x+1
Then Ruffini's rule tells us that the remainder of this reduced division is the polynomial x12+1 evaluated at 1, i.e. 2. When the top and bottom of 2x+1 are multiplied by x121x21, the denominator becomes P2(x) and the numerator gives the final answer of 2(x121)x21=2+2x2+2x4+2x6+2x8+2x10.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...