Before trying the problem "note your opinion as to whether the observed pattern is known to continue, known not to continue, or not known at all."
Lets factor polynomials of the form x^n1. Starting with 1 the following list can be generated:
n=1: (x1)
n=2: (x1)*(x+1)
n=3: (x1)*(x^2+x+1)
n=4: (x1)*(x+1)*(x^2+1)
n=5: (x1)*(x^4+x^3+x^2+x+1)
n=6: (x1)*(x+1)*(x^2+x+1)*(x^2x+1)
One thing to notice is that each line has exactly one polynomial factor not seen earlier in the list:
n=1: x1
n=2: x+1
n=3: x^2+x+1
n=4: x^2+1
n=5: x^4+x^3+x^2+x+1
n=6: x^2x+1
Does each new factorization always produce exactly one new polynomial factor?
Looking more closely you may see that all the coefficients are 1, 0, or 1. Does this continue to be the case for all factors?
Initial opinion: first I thought it probably true, by analogy with some Diophantine equations, but the reasoning there depends on convergents.
So then I guessed probably unknown.
Then I began to think about n=4; (x1)*(x+1)*(x^2+1). (x+1)*(x^2+1) = x^3+x^2+x+1 which arguably at least in this context follows more of a 'pattern': (x+1), (x^2+x+1), (x^3+x^2+x+1) etc.
In that case the problem answers itself: every such expression can be reduced to 2 terms, one of which is unique to that particular n. In fact, there are a number of ways to factor such expressions, e.g:
(x^n1)(x^n+1) = x^(2n)1
(x^n1)(x^(2n)+x^n+1) = x^(3n)1
(x^n+1)(x^(2n)x^n+1) = x^(3n)+1
(x^n1)(x^n+1)(x^(2n)+1) = x^(4n)1
It's also easy to produce factorisations with larger coefficients, e.g:
x^61 = (x1)*(x+1)*(x^2+x+1)*(x^2x+1), but also
x^61 = (x1)(x^2x+1)(x^3+2x^2+2x+1)
What is needed is a comparing like with like method, treating all x^n1 in the same way.
Start with the observation (x^(k*y)1)/(x^y1) = sum (n=0 to k1) x^(y*n) [1]
This is true for all x,y,k, e.g.
(x^(2*3)1)/(x^31) = sum (n=0 to 21) x^(3*n) i.e. (x^61)/(x^31) = (1+x^3)
(x^(5*5)1)/(x^51) = sum (n=0 to 51) x^(5*n) i.e. (x^251)/(x^51)= (1+x^5+x^10+x^15+x^20)
Where the exponent is a prime square or power, i.e. k=y, or k=y^m we can stop immediately, because all such representations are plainly unique.
Otherwise, {k,y} can always be selected so that GCD {k,y} = 1, when sum (n=0 to k1) x^(y*n) is divisible by sum (n=0 to k1) x^n
Equivalently, ((x1) (x^(ky)1))/((x^k1) (x^y1)) [2]
Say k=3, y=5: x^8x^7+x^5x^4+x^3x+1
Say k=7, y=4: x^18x^17+x^14x^13+x^11x^9+x^7x^5+x^4x+1
etc.
Note that if the values of k and y are swapped, the final part of the expression does not change:
x^281 = (x^71)(x^3+x^2+x+1)(x^18x^17+x^14x^13+x^11x^9+x^7x^5+x^4x+1)
x^281 = (x^41)(x^6+x^5+x^4+x^3+x^2+x+1)(x^18x^17+x^14x^13+x^11x^9+x^7x^5+x^4x+1)
Call [2] the invariant.
The difficulty with composite square exponents is that, e.g: ((x1) (x^(36)1))/((x^61) (x^61))
leads to the unlovely invariant:
x^25x^24+2x^192x^18+3x^133x^12+ 4x^74x^6+(12x)/(x^2x+1)+3/(x^2+x+1)+5x+2/(x+1)  5
However, if the factors are rearranged, so that e.g. 36=9*4:
(x^361) = (x^91)(x^3+x^2+x+1)(x^24x^23+x^20x^19+x^16x^14+x^12x^10+x^8x^5+x^4x+1)
So to summarise:
x^(k*y)1 = (x^y1)(sum (n=0 to k1) x^(y*n)). The first part (x^y1) is nonunique as it must have appeared earlier in the list. If the exponent is a prime square or power, then (sum (n=0 to k1) x^(y*n)) will be unique to that exponent and irreducible.
Otherwise, apply equation [2], giving x^(k*y)1 = (x^y1)(x^(k1)+x^(k2)...+x+1)*(invariant). The first part, (x^y1) is nonunique as it will have appeared earlier in the list. The second part (x^(k1)+x^(k2)...+x+1), must have appeared whenever k has been a factor of a smaller exponent. The invariant remains the same whichever valid factor is selected to generate the factorisation. But if so, then it follows at once by the fundamental theorem of arithmetic that every invariant must be unique.
So in answer to the questions in the puzzle:
1. It is possible to factor every polynomial of form x^n1 so that it has one and exactly one new polynomial factor, namely the invariant mentioned above. Further, every such invariant is unique. It is true that an invariant can on occasion be further factored; for example invariant {k,y} = {3,4} = (x^2x+1)(x^4x^2+1). Naturally, since 12 divides 24 and 36, these are also factors of {k,y} = {3,8}, and {k,y} = {4,9}, but this does not diminish the uniqueness of the invariants themselves.
2. All such factorisations have coefficients of either 1, 0, or 1. This is inherent to the method as outlined above.

Posted by broll
on 20190211 07:27:41 