Continued fraction techniques are equivalent to Berlekamp\´s algorithm. The sequence

, in Berlekamp\´s algorithm provides the information about when Berlekamp\´s algorithm completes one iterative step of the continued fraction. In fact, this happens when

; and when

, it implies that Berlekamp\´s algorithm begins the next iterative step of the continued fraction.