arXiv · 0708.0080
Farey Statistics in Time n^{2/3} and Counting Primitive Lattice Points in Polygons
Abstract
We present algorithms for computing ranks and order statistics in the Farey sequence, taking time O (n^{2/3}). This improves on the recent algorithms of Pawlewicz [European Symp. Alg. 2007], running in time O (n^{3/4}). We also initiate the study of a more general algorithmic problem: counting primitive lattice points in planar shapes.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mihai Patrascu. 2007-11-02. Farey Statistics in Time n^{2/3} and Counting Primitive Lattice Points in Polygons. https://arxiv.org/abs/0708.0080
Cite the original work for its findings. Save a collection to share your selection of sources.