> I'd like to see how "repeated addition" works in polynomial rings.
Consider the following polynomial: x0 * b^0 + x1 * b^1 + x2 * b^2 ... xn * b^n, where "n" goes to both positive infinity and negative infinity.
When "b = 10" and when "x" can be numbers from [0-9], we have the so called base-10 set of real numbers, do we not? IIRC, if b = sqrt(-1) * 10, we then have the set of complex numbers (a non-intuitive result. I may have made a mistake somewhere, but I assure you there's a surprising property along those lines).
That's the funny thing about real numbers and complex-numbers. Real numbers and even complex-numbers ARE polynomials, and therefore a polynomial ring. 3.1415926 == 3 * 10^0 + 1 * 10 ^-1 + 4 * 10 ^-2 ...
------------
I'm using a lot of words here. But all I'm saying is once again: Pi * 3 == 3.14... * 3 == 3 * 3 + 0.1 * 3 + 0.04 * 3 + ... == 9.42...
We can evaluate 3 * Pi by splitting Pi up into a set of additions (3 + 0.1 + 0.04 + 0.001...), even if that set of additions is infinite. Then evaluate 3*(each component). This is possible because Pi is easily represented as a polynomial X0 * 10^0 + X1 * 10^-1 + ... Xn * 10^-n.
There's a reason why polynomial multiplication is usually called "Carry-free multiplication". Because Real-numbers are just polynomials where you have that annoying "carry the one" property to keep track of. Remove the "carry the one" property (in say: Galois extension fields), and all the math still works.
--------
Hmmmm... I probably could have said all that in fewer words. TL;DR: "Real numbers ARE a polynomial ring". (And complex numbers are probably a polynomial ring, I just forgot how to prove that factoid)
> I'd like to see how "repeated addition" works in polynomial rings.
EDIT: Just thought of a cute and simple retort. You ever do a CRC32 check? There ya go.