How many divisors of the polynomial x 4 − 1 in Z [ x ] are there?
Definitions:
Z [ x ] is the ring of polynomials with integer coefficients. That is, elements of Z [ x ] are polynomials with integer coefficients. 1 , x , 2 x 2 + 3 x − 4 are elements of Z [ x ] ; 2 1 , x − 1 , 2 x aren't.
A polynomial Q ( x ) is a divisor of another polynomial P ( x ) in Z [ x ] if (and only if) there exists a third polynomial R ( x ) such that P ( x ) , Q ( x ) , R ( x ) ∈ Z [ x ] and P ( x ) = Q ( x ) R ( x ) .
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.
As mentioned by Mark, the conclusion follows from having a unique factorization domain.
It is important to note that Z [ X ] is a unique factorization domain, that X − 1 , X + 1 and X 2 + 1 are the prime/irreducible factors of X 4 − 1 (to within association), and that 1 , − 1 are the only units in Z [ X ] .
Log in to reply
Please explain the notation.
Log in to reply
Ivan has defined the terminology excellently, except to add that a unique factorization domain cannot have zero divisors . There cannot be nonzero elements a , b whose product a b equals 0 . To throw another bit of terminology about, a commutative ring without zero divisors is called a integral domain , and UFDs are always integral domains.
The point is that, outside a UFD, you cannot determine the number of factors of a number simply by finding a factorization into irreducible elements.
For example, consider the ring Z [ 2 i ] consisting of Gaussian integers of the form a + 2 b i where a , b ∈ Z . If we consider the number 8 i , then the identity 8 i = 2 × 2 × 2 i , is a factorization of 8 i into irreducibles in Z [ 2 i ] . If Z [ 2 i ] were a UFD, then all factors of 8 i would be equal to plus or minus (the only units here are 1 and − 1 ) products of these factors, namely ± 1 ± 2 i ± 2 ± 2 × 2 i = ± 4 i ± 2 2 ± 2 2 × 2 i = = ± 4 ± 8 i However, we also have 8 i = ( 2 + 2 i ) 2 , and we have found a totally different irreducible factor 2 + 2 i of 8 i . Note that neither 2 nor 2 i divides 2 + 2 i in Z [ 2 i ] , in that no element z ∈ Z [ 2 i ] can be found with either 2 + 2 i = 2 z or 2 + 2 i = 2 i z .
Z [ x ] is the ring of polynomials with integer coefficients. For example, x , 1 , 2 x 2 + 3 x − 4 are elements of Z [ x ] .
A unit of a ring is an element that has a multiplicative inverse. In the natural numbers, the only unit is 1, because 2 has "inverse" 2 1 that is not a natural number. In the integers, -1 also becomes a unit. Surprisingly, going to Z [ x ] , there are no new units; it's still 1 and -1. ( x is not a unit because its inverse would be x − 1 , not a polynomial.) Two elements of a ring are associated if you can multiply a unit to one element to obtain the other.
A unique factorization domain is a (commutative) ring where every nonzero element can be factorized uniquely into irreducible elements (or prime elements), except probably multiplying the factors by units, and changing their orders. A common example is the ring of positive integers or the ring of integers (due to the fundamental theorem of arithmetic). 1 2 = 2 2 ⋅ 3 is the unique factorization (you can also have 1 2 = ( − 1 ) ⋅ ( − 2 ) ⋅ 2 ⋅ 3 , but they are just multiplying the factors by units, so it's considered the same). It turns out that Z [ x ] is also a unique factorization domain.
The importance of that is that we can factorize any element e of Z [ x ] , take all those factors (with multiplicities) and throw in − 1 (because it's a unit), and now all factors of e can be generated by taking some subset of them and multiplying them all together. For example, 1 2 = 2 2 ⋅ 3 , so take 2 , 2 , 3 , throw in − 1 as a unit, and now all factors of 12 can be generated by taking some subset of 2 , 2 , 3 , − 1 and multiplying them together. For example, taking 2 , 2 , − 1 gives the factor -4 of 12. The same also applies to x 4 − 1 in the problem; this time, it factorizes to ( x − 1 ) ( x + 1 ) ( x 2 + 1 ) , so all factors can be generated by taking some subset of x − 1 , x + 1 , x 2 + 1 , − 1 and multiplying them all together.
You're right, this is not hard enough to be level 5
The only thing that threw me off was the notation Z [ x ] , which I didn't understand. I deduced that it meant polynomials with integers coefficients, but it ironically made me forget about just integers (the "[x]" threw me off).
Log in to reply
Originally that notation was explained, but the explanation was buried in the definition of divisor. Is the problem clearer now?
Problem Loading...
Note Loading...
Set Loading...
The answer is 16. The divisors are:
To obtain the answer, just note that we can factorize x 4 − 1 = ( x − 1 ) ( x + 1 ) ( x 2 + 1 ) . Thus the divisors are exactly those obtained by choosing any subset of the three factors x − 1 , x + 1 , x 2 + 1 , together with potentially choosing − 1 , and multiplying them all together. Each factor and unit can be either chosen or not chosen, for two choices for each, and they are all independent choices, so there are 2 4 = 1 6 choices. For example, − x 3 + x 2 − x + 1 is obtained when we choose x − 1 , x 2 + 1 , − 1 and multiply them together.
Fun fact : Did you know? I originally set this as Level 2 (because I thought factorizing would be easy) and look at what level it is now.