warning: page of speculation and wondering
In “Euclidean” algorithm form:
And now we put on top not the usual 1/ of a regular CF, but 2/, to cancel the denominator.
And here we have the same fraction as before, so the terms will repeat, i.e.
A formula for nonregular CFs of square roots
Using the formula, and the Euclidean method above:
contfrac CF computer
Gosper’s CF arithmetic
fractional iteration of 1/(1+x)