Talk:Continued fraction: Difference between revisions
Content added Content deleted
(→Related tasks: moebius function) |
|||
Line 25: | Line 25: | ||
The purpose would be to compute <math>A_n</math>, <math>D_n</math>, <math>C_n</math> and <math>D_n</math> for any n.--[[User:Grondilu|Grondilu]] 00:55, 16 October 2012 (UTC) |
The purpose would be to compute <math>A_n</math>, <math>D_n</math>, <math>C_n</math> and <math>D_n</math> for any n.--[[User:Grondilu|Grondilu]] 00:55, 16 October 2012 (UTC) |
||
As I think about it, I realize there is a recursive property: |
|||
:<math>M_n(x) = M_{n-1}(\frac{b_n}{a_n+x})</math> |
|||
That should make things much easier than doing the whole algebraic development.--[[User:Grondilu|Grondilu]] 02:00, 16 October 2012 (UTC) |
|||
== creating a continued fraction == |
== creating a continued fraction == |