Factor it 3

Algebra Level 4

What is the smallest positive integer n n such that x n 1 x^n-1 is factored into precisely five irreducible factors? (Irreducible over the rationals.)


The answer is 16.

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.

1 solution

We know that the form x n 1 x^{n} - 1 denotes a difference of two squares. The positive factor left over for the difference of two squares process is irreducible over the rationals, thus only the negative factors can break up into more factors. Let k k be the number of irreducible factors over the rationals. If we do some casework, x 2 1 = ( x + 1 ) ( x 1 ) k = 2 x^{2} - 1 = (x + 1)(x-1) \Longrightarrow k = 2 x 4 1 = ( x 2 + 1 ) ( x 2 1 ) = ( x 2 + 1 ) ( x + 1 ) ( x 1 ) k = 3 x^{4} - 1 = (x^{2} + 1)(x^{2}-1) = (x^{2} + 1)(x+1)(x-1) \Longrightarrow k = 3 x 8 1 = ( x 4 + 1 ) ( x 4 1 ) = ( x 4 + 1 ) ( x 2 + 1 ) ( x 2 1 ) = ( x 4 + 1 ) ( x 2 + 1 ) ( x + 1 ) ( x 1 ) k = 4 x^{8} - 1 = (x^{4} + 1)(x^{4}-1) = (x^{4} + 1)(x^{2}+1)(x^{2}-1)= (x^{4} + 1)(x^{2}+1)(x+1)(x-1) \Longrightarrow k = 4

Through induction, we can conclude that every n n that is a power of two equals 2 k 1 2^{k-1} . n = 2 5 1 n = 16 n=2^{5-1} \Longrightarrow n= \boxed{16}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...