Probabilistic Methods in Search and Number Theory - 0 views
-
Probabilistic Methods in Search and Number Theory Several interesting features of the accuracy of diophantine approximations can be expressed in probabilistic terms. Many diophantine approximation algorithms produce a sequence of sets F(n), indexed by n, of rational numbers p/q in [0,1]. Famous examples of F(n) are the Farey sequence, the collection of rationals p/q in [0,1] with q<=n, and the collection of all n-th continued fraction convergents.
