Long division of infinite series
Long division of numbers is usually taught in primary schools to children as one of the basic arithmetic skills.
Consider, for example, 486÷5.
It technically requires the child to atomize 486 into blocks of fives. There are a few ways to handle this problem. Since we know that 90×5=450, one way to do 486÷5 is: 486=(90×5)+(480−90×5)+6=(90×5)+30+6=(90×5)+(6×5)+(5+1)=(90+6+1)×5+1=97×5+1 We can also repeat the process with a different seed number, for instance, instead of 90, we can start with 80: 486=(80×5)+(480−80×5)+6=(80×5)+80+6=(80×5)+(50+30)+(5+1)=(80+10+6+1)×5+1=97×5+1 This essentially means that 486 can be atomized into 97 blocks of fives plus a one. Long division is a very economical way to present the same information (multiplications, addition and subtractions) in the process given above. The only catch is that the long division procedure requires the child to always start the largest possible seed number. This, she can do with a bit of trial-and-error and with her command of multiplication table.Although the long division procedure is a useful trick to handle division of numbers, I hardly need to reapply this trick after I left primary school. So, it slowly degenerated into a useless tool in my cognitive toolbox. That changed a bit on one fine morning in 1999, when Mr. Lim Ah Kok, demonstrated the long division procedure with two finite polynomials in the classroom. Before that, I have never thought of doing long division with algebraic expressions.
My teacher's action immediately prompted the little man in my brain to ask this question:
Can you get a nice infinite series for tanx if you perform the long division procedure with the infinite series of sine and cosine?And from that moment, I was mumbling to the little man and stopped paying attention to my teacher and his nice handwritings on the blackboard.
k | ak |
---|---|
1 | 12!−13! |
2 | 15!−14!+12!a1 |
3 | 16!−17!−14!a1+12!a2 |
4 | 19!−18!+16!a1−14!a2+12!a3 |
⋮ | ⋮ |
n | (−1)n(1(2n+1)!−1(2n)!)+(an−12!−an−24!+an−36!−…+a1(2n−2)!) |
In general, the following recurrence must be true for n≥1: an=(−1)n(1(2n+1)!−1(2n)!)+n−1∑r=1(−1)r+1an−r(2r)!
Comments