Fundamental recurrence formulas

From formulasearchengine
Jump to navigation Jump to search

{{ safesubst:#invoke:Unsubst||$N=Unreferenced |date=__DATE__ |$B= {{#invoke:Message box|ambox}} }} In the theory of continued fractions, the fundamental recurrence formulas relate the partial numerators and the partial denominators with the numerators and denominators of the fraction's successive convergents. Let

be a general continued fraction, where the an (the partial numerators) and the bn (the partial denominators) are numbers. Denoting the successive numerators and denominators of the fraction by An and Bn, respectively, the fundamental recurrence formulas are given by

The continued fraction's successive convergents are then given by

These recurrence relations are due to John Wallis (1616-1703).

The determinant formula

It can be shown, by induction, that the determinant formula

holds for all positive integers n > 0. If neither Bn-1 nor Bn is zero, this relationship can also be used to express the difference between two successive convergents of the continued fraction.

It is necessary but not sufficient for the convergence of an infinite continued fraction that the difference between successive convergents approaches zero; this is the subject of the convergence problem. (Note: By definition, the continued fraction converges if the sequence of convergents has a limit.)

A simple example

Consider the regular continued fraction in canonical form that represents the golden ratio φ:

Applying the fundamental recurrence formulas we find that the successive numerators An are {1, 2, 3, 5, 8, 13, ...} and the successive denominators Bn are {1, 1, 2, 3, 5, 8, ...}, the Fibonacci numbers. Since all the partial numerators in this example are equal to one, the determinant formula assures us that the absolute value of the difference between successive convergents approaches zero quite rapidly.