The original problem was to show that factorization of polynomials with integer coefficients (into irreducibles) exists and is unique. This is what we are doing. (Please see my earlier post stating the overall strategy.)
For the second part, you should try to prove that if is irreducible and divides , then either or . Then, suppose that a polynomial has two factorizations. Use this division fact to show that the two factorizations differ only by a unit (or invertible number).
I'm not exactly sure how I can prove/show either part of what is noted above. However, I was reading through this document (link is here) and I think it relates to this problem, however I'm not the best at interpreting it into a little more understandable language. Perhaps it may help?
Wow, well I totally am confused by this. How am I supposed to show that then ?
I don't want to get off track here either. However I've been digging around and this is what other people have said about this problem:
I still wasn't able to make sense of all of this, and I don't want to give really off track here either. Can someone make sense of this?The fact that Z[X] is a ufd is due to gauss. It is NOT a euclidean domain however. the crucial concept is to define the "content" of a polynomial as the gcd of the coefficients, then prove the content of a product is the product of the contents. then one can reduce the proof to the case of Q[X].
Wow! Did you really write that yourself? I mean, how do you even write it in such styling? It makes sense thus far although it is pretty advanced, but I'm following. Now here is the kicker: does proving this need to be this complicated? Does a simpler method exist? I only ask this because when the OP asked the question I thought who ever answered it would post a 1-2 paragraph reply, I never imagined it this detailed!
Can anyone else also confirm?