It is of interest to me the extent to which the traditional long multiplication algorithm is of so little use when multiplying irrational numbers. I mean, consider the below with respect to our traditional place value system.
1.41421356237309504880168872421…
Clearly it trails off infinitely to the right. But the point is, in traditional multiplication, you start at the rightmost digit because you can be guaranteed that no lesser places will effect the multiplication of that place through carrying. For example, multiplying 432*599, looking at the last two digits of 2 and 9, it’s clear to see that the last digit of the product must be an 8, since 9*2 = 18. The next digit can then be worked out, knowing you carry that 1. However, starting from the opposite side, 4*5 = 20, so you ‘know’ that the leftmost side must be around (imagine airquotes around that) 20. But you can’t say for sure, because prior terms in the product will effect the final result. Indeed, a more astute observation would be to say that 599 is almost 600, and 4*6 = 24, so the leftmost side of the product will more closely resemble 24. Of course, we’re already using prior terms to adjust our prediction/calculation about the leftmost side of the product. And indeed, if you calculate the actual product out, 258768, we see that the leftmost part is actually 25 – we were close, but some amount of carrying pushed us off slightly. By starting from the lowest place value, we avoid all this.
So, as it applies to irrational numbers, because they have an infinite decimal representation, there is no lowest place value to start at. There is an obvious starting point, the leftmost place, the 1 before the decimal, but the problem then is that the place values decrease from left to right, so any kind of carrying would just fail, and multiplication would just fall apart.
The point though is that I don’t really care, so what happens if we apply the multiplication algorithm to infinite sequences of digits?
(more…)