Hostname: page-component-7bb8b95d7b-s9k8s Total loading time: 0 Render date: 2024-10-06T01:21:27.453Z Has data issue: false hasContentIssue false

Computing Farey Series

Published online by Cambridge University Press:  01 August 2016

Norman Routledge*
Affiliation:
24 Rothsay Street, Bermondsey, London SE1 4UE

Extract

The Farey series of order n, Fn, consists of all the fractions between 0 and 1 (inclusive) with denominators less than or equal to n, arranged in order of magnitude and expressed in their lowest terms, so that for example The most obvious way of computing one is to assign a long series of stores and then insert the terms with denominator 1, with denominator 2, … , shifting the terms already there to make room for the new ones in their correct positions. This may require a large amount of storage and is fairly slow because of the large amount of shifting involved: for instance F1025 has 319765 terms, and occupies 400 printed pages (see Neville [1]). Neville also gives a table related to F100, which has 3045 terms. His procedures, a heroic application of pencil-and-paper methods, are described at the end of this paper.

Type
Articles
Copyright
Copyright © The Mathematical Association 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Neville, E.H., The Farey series of order 1025, (Cambridge University Press) (1950).Google Scholar
2. Pătrascu, C.E. and Pătrascu, M., Computing order statistics in the Farey sequence, in Algorithmic Number Theory, Springer Lecture Notes in Computer Science, Vol. 3076 (2004), pp. 358366.Google Scholar
3. Hardy, G.H. and Wright, E.M., An introduction to the theory of numbers (5th edn.), Clarendon Press, Oxford (1979).Google Scholar
4. Davenport, H., The higher arithmetic, (2nd edn.), Hutchinson, London (1962).Google Scholar
5. Neville, E.H., The structure of Farey series, Proc. London Maths. Soc. (Ser. 2) 51 (1949) pp. 132144.CrossRefGoogle Scholar