|The Road to Reality
|Page 1 of 1|
|Author:||gandalf [ 27 Jul 2010, 19:16 ]|
|Post subject:||Exercise [03.01]|
Since I found the numerical computations we are asked to do here rather annoying (calculating the approximation of order n doesnt help us anything in calculating the approximation of order n+1), I looked around a bit and found a recursion formula for continued fractions significantly simplifying these computations. Consequently, in my solution I first prove this recursion formula and then apply it to the numerical computations in question.
|Page 1 of 1||Archived: 07 Aug 2014|
|Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group