In a special case, the working of the map corresponds to the Euclid algorithm and, more generally, to terms in the continuing fractions.
Recall also that the 2-dimensional case can be viewed as the Euclid algorithm which in turn corresponds to the usual continued fractions (see Example 2.
This is the analog (for the F-EUCLID algorithm) of the celebrated Gauss density associated to the standard Euclid algorithm and equal to (1/ log 2)1/(1 + x).
c)], [DELTA] are also central in the analysis of the bit-complexity of the Euclid Algorithm , .
Provide a precise description of the phase transition for the behaviour of the bitcomplexity between the Gauss algorithm for a valuation r [right arrow] -1 and the Euclid algorithm.