Can the polynomial ( x − 1 ) ( x − 2 ) ( x − 3 ) ⋯ ( x − 1 0 0 ) + 1 + 1 0 1 ! be factorized into 2 non-constant polynomials with integer coefficients?
Note: 1 0 1 ! = 1 × 2 × ⋯ × 1 0 1 .
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.
Brilliant solution.
I'm not sure i got your second line , How could you get such a consequence using just FLT ?
Log in to reply
Each of 1 , 2 , 3 , … , 1 0 0 is a root of the equation x 1 0 0 − 1 = 0 in Z 1 0 1 , and hence each of x − 1 , x − 2 , … , x − 1 0 0 is a factor of x 1 0 0 − 1 in Z 1 0 1 [ x ] . The first equation is just the consequence of factorizing x 1 0 0 − 1 in Z 1 0 1 [ x ] . I have found 1 0 0 distinct linear factors and so there cannot be any more!
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Eisenstein's Irreducibility Criterion
This one falls to Eisenstein's Irreducibility criterion. Note that 1 0 1 is prime. If 1 ≤ j ≤ 1 0 0 then j 1 0 0 ≡ 1 ( m o d 1 0 1 ) , and hence x 1 0 0 − 1 ≡ j = 1 ∏ 1 0 0 ( x − j ) ( m o d 1 0 1 ) Thus if we write f ( x ) = j = 1 ∏ 1 0 0 ( x − j ) + 1 + 1 0 1 ! = j = 0 ∑ 1 0 0 a j x j then the prime 1 0 1 divides all of a 0 , a 1 , … , a 9 9 , while 1 0 1 does not divide a 1 0 0 = 1 , and 1 0 1 2 does not divide a 0 = 1 0 0 ! + 1 0 1 ! + 1 . Thus f ( x ) is irreducible over Z [ x ] .