A note on the computation of the fraction of smallest denominator in between two irreducible fractions
Résumé
Given two irreducible fractions f and g, with f < g, we characterize the fraction h such that f < h < g and the denominator of h is as small as possible. An output-sensitive algorithm of time complexity O(d), where d is the depth of h is derived from this characterization.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...