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)=x24−1x2−1
P2(x)=x12−1x−1
P1(x)P2(x)=x24−1x12−1⋅x−1x2−1=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 x12−1x2−1, the denominator becomes P2(x) and the numerator gives the final answer of 2(x12−1)x2−1=2+2x2+2x4+2x6+2x8+2x10.
No comments:
Post a Comment