Remainder

Algebra Level 4

The remainder when x 1959 1 x^{1959} - 1 is divided by ( x 2 + 1 ) ( x 2 + x + 1 ) (x^2 + 1)(x^2 + x + 1) is of the form a x 3 + b x 2 + c x + d ax^3 + bx^2 + cx + d .

FInd a + b + c + d a + b + c + d .

This is part of the set My Problems and THRILLER


The answer is 0.

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.

2 solutions

Brian Moehring
Feb 21, 2017

Suppose ( x 2 + 1 ) ( x 2 + x + 1 ) = 0 (x^2+1)(x^2+x+1) = 0 . Then either x 2 + 1 = 0 x^2+1 = 0 or x 2 + x + 1 = 0 x^2 + x + 1 = 0 . Now we note:

  • If x 2 + 1 = 0 x^2+1=0 , then x 4 = 1 x^4 = 1 .
  • If x 2 + x + 1 = 0 x^2+x+1 = 0 , then x 3 1 = ( x 1 ) ( x 2 + x + 1 ) = 0 x^3 - 1 = (x-1)(x^2+x+1) = 0 , so that x 3 = 1 x^3 = 1 .

In either case, we additionally see that x 12 = 1 x^{12} = 1 . In other words, every root of ( x 2 + 1 ) ( x 2 + x + 1 ) = 0 (x^2+1)(x^2+x+1)=0 satisfies x 12 1 = 0 x^{12}-1=0 . Since we note the former only has simple zeros, we can conclude ( x 2 + 1 ) ( x 2 + x + 1 ) (x^2+1)(x^2+x+1) divides x 12 1 x^{12}-1 . Therefore, we have shown that x 12 1 ( m o d ( x 2 + 1 ) ( x 2 + x + 1 ) ) . x^{12} \equiv 1 \pmod{(x^2+1)(x^2+x+1)}.

Using this, we may write x 1959 1 = ( x 12 ) 163 x 3 1 x 3 1 ( m o d ( x 2 + 1 ) ( x 2 + x + 1 ) ) x^{1959}-1 = (x^{12})^{163} \cdot x^3 - 1 \equiv x^3 - 1 \pmod{(x^2+1)(x^2+x+1)}

Luckily, this is already reduced! Therefore, a = 1 , b = 0 , c = 0 , d = 1 a=1, b=0, c=0, d=-1 and a + b + c + d = 0 a+b+c+d = \boxed{0} .

@Brian Moehring Brilliant solution.!!!

Ankit Kumar Jain - 4 years, 3 months ago

I just realized I have an error. It's not too hard to fix, but I'm going to bed now, so I'll fix it in the morning...

Brian Moehring - 4 years, 3 months ago

Log in to reply

Where is the error?

Ankit Kumar Jain - 4 years, 3 months ago

Log in to reply

It wasn't an error in the sense of "this statement is wrong". It was an error in the sense of "this step doesn't always work, but it does in this case". I just had to explain how to jump from a statement about the roots of a polynomial to a statement about polynomial division.

Brian Moehring - 4 years, 3 months ago
Ankit Kumar Jain
Feb 21, 2017

Let ( x 2 + 1 ) ( x 2 + x + 1 ) = k (x^2 + 1)(x^2 + x + 1) = k

x 1959 1 x 1 x ( x 1 ) ( m o d x 2 + 1 ) x^{1959} - 1\equiv{-x - 1}\equiv{x(x - 1)}\pmod{x^2 + 1}

Multiplying throughout by x 2 + x + 1 x^2 + x + 1 yields ,

( x 1959 1 ) ( x 2 + x + 1 ) x ( x 1 ) ( x 2 + x + 1 ) x ( x 3 1 ) ( m o d k ) (x^{1959} - 1)(x^2 + x + 1)\equiv{x(x - 1)(x^2 + x + 1)}\equiv{x(x^3 - 1)}\pmod{k} ( A ) \quad \quad \quad \cdot \cdot \cdot (A)


Now , x 2 + x + 1 x 3 1 ( x 3 ) 653 1 653 = x 1959 1 x^2 + x + 1 \mid x^3 - 1 \mid (x^{3})^{653} - 1^{653} = x^{1959} - 1

x 1959 1 0 ( m o d x 2 + x + 1 ) \Rightarrow x^{1959} - 1\equiv{0}\pmod{x^2 + x + 1}

Multiplying throughout by x 2 + 1 x^2 + 1 gives ,

( x 1959 1 ) ( x 2 + 1 ) 0 ( m o d k ) (x^{1959} - 1)(x^2 + 1)\equiv{0}\pmod{k} ( B ) \quad \quad \quad \cdot \cdot \cdot (B)


Combining ( A ) , ( B ) (A) , (B) gives ,

( x 1959 1 ) ( x ) x ( x 3 1 ) ( m o d k ) (x^{1959} - 1)(x)\equiv{x(x^3 - 1)}\pmod{k}

( x 1959 1 ) x 3 1 ( m o d k ) \Rightarrow (x^{1959} - 1)\equiv{x^3 - 1}\pmod{k}

Hence , a = 1 , b = 0 , c = 0 , d = 1 a + b + c + d = 0 a = 1 , b = 0 , c = 0 , d = -1 \Rightarrow a + b + c + d = \boxed{0}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...