4.2, due on February 2

This section was a little mind blowing.  They started by claiming that the divisibility and greatest common factors carry over to polynomials and I thought, "Cool!" But then they showed that any any constant multiple of a function was also a multiple.  That part made sense, but then we hit GCD.  How in the world can you have a GCD if you can just multiply it by a constant and get a bigger one? That's where monic polynomials come in.  A monic polynomial is a polynomial that has a leading coefficient of 1.  The gcd fo a polynomial has to be a monic polynomial.  So if you use the Division Algorithm and get a polynomial that is not monic simply multiply it by the reciprocal of it's leading coefficent and BOOM! you get a monic polynomial.  *mind blown* I'm just going to have to remind myself to remember the monic polynomial.  That's the tricky part.