Farey sequence explained

In mathematics, the Farey sequence of order n is the sequence of completely reduced fractions, either between 0 and 1, or without this restriction, which when in lowest terms have denominators less than or equal to n, arranged in order of increasing size.

With the restricted definition, each Farey sequence starts with the value 0, denoted by the fraction, and ends with the value 1, denoted by the fraction (although some authors omit these terms).

A Farey sequence is sometimes called a Farey series, which is not strictly correct, because the terms are not summed.^[1]

Examples

The Farey sequences of orders 1 to 8 are :

F₁ =

F₂ =

F₃ =

F₄ =

F₅ =

F₆ =

F₇ =

F₈ =

Centered
F1 =
F2 =
F3 =
F4 =
F5 =
F6 =
F7 =
F8 =

Farey sunburst

Plotting the numerators versus the denominators of a Farey sequence gives a shape like the one to the right, shown for

Reflecting this shape around the diagonal and main axes generates the Farey sunburst, shown below. The Farey sunburst of order connects the visible integer grid points from the origin in the square of side, centered at the origin. Using Pick's theorem, the area of the sunburst is, where is the number of fractions in .

History

The history of 'Farey series' is very curious — Hardy & Wright (1979)^[2]

... once again the man whose name was given to a mathematical relation was not the original discoverer so far as the records go. — Beiler (1964)^[3]

Farey sequences are named after the British geologist John Farey, Sr., whose letter about these sequences was published in the Philosophical Magazine in 1816. Farey conjectured, without offering proof, that each new term in a Farey sequence expansion is the mediant of its neighbours. Farey's letter was read by Cauchy, who provided a proof in his Exercices de mathématique, and attributed this result to Farey. In fact, another mathematician, Charles Haros, had published similar results in 1802 which were not known either to Farey or to Cauchy.^[3] Thus it was a historical accident that linked Farey's name with these sequences. This is an example of Stigler's law of eponymy.

Properties

Sequence length and index of a fraction

The Farey sequence of order contains all of the members of the Farey sequences of lower orders. In particular contains all of the members of and also contains an additional fraction for each number that is less than and coprime to . Thus consists of together with the fractions and .

The middle term of a Farey sequence is always, for . From this, we can relate the lengths of and using Euler's totient function :

$$|F\_n|\; =\; |F\_|\; +\; \backslash varphi(n).$$

Using the fact that, we can derive an expression for the length of :

$$|F\_n|\; =\; 1\; +\; \backslash sum\_^n\; \backslash varphi(m)\; =\; 1\; +\; \backslash Phi(n),$$where is the summatory totient.

We also have :$$|F\_n|\; =\; \backslash frac\backslash left(3+\backslash sum\_^n\; \backslash mu(d)\; \backslash left\backslash lfloor\; \backslash tfrac\; \backslash right\backslash rfloor^2\; \backslash right),$$and by a Möbius inversion formula : $$|F\_n|\; =\; \backslash frac\; (n+3)n\; -\; \backslash sum\_^n|F\_|,$$where is the number-theoretic Möbius function, and

is the floor function.

The asymptotic behaviour of is :$$|F\_n|\; \backslash sim\; \backslash frac\; .$$

The number of Farey fractions with denominators equal to in is given by when and zero otherwise. Concerning the numerators one can define the function

that returns the number of Farey fractions with numerators equal to in . This function has some interesting properties as^[4] , for any prime number , for any integer, In particular, the property in the third line above implies and, further, The latter means that, for Farey sequences of even order, the number of fractions with numerators equal to is the same as the number of fractions with denominators equal to, that is .

The index

of a fraction in the Farey sequence is simply the position that occupies in the sequence. This is of special relevance as it is used in an alternative formulation of the Riemann hypothesis, see below. Various useful properties follow:

-1

, \\[2pt] I_n(1/1) &= |F_n|-1, \\[2pt] I_n(h/k) &= |F_n|-1 - I_n\left(\frac\right).\end

The index of where and is the least common multiple of the first numbers,, is given by:^[5] $$I\_n(1/k)\; =\; 1\; +\; n\; \backslash sum\_^\; \backslash frac\; -\; k\backslash Phi(i).$$

Farey neighbours

Fractions which are neighbouring terms in any Farey sequence are known as a Farey pair and have the following properties.

If and are neighbours in a Farey sequence, with, then their difference is equal to . Since$$\backslash frac\; -\; \backslash frac\; =\; \backslash frac,$$

this is equivalent to saying that $$bc\; -\; ad\; =\; 1.$$

Thus and are neighbours in, and their difference is .

The converse is also true. If $$bc\; -\; ad\; =\; 1$$

for positive integers with and, then and will be neighbours in the Farey sequence of order .

If has neighbours and in some Farey sequence, with, then is the mediant of and  - in other words, $$\backslash frac\; =\; \backslash frac.$$

This follows easily from the previous property, since if

It follows that if and are neighbours in a Farey sequence then the first term that appears between them as the order of the Farey sequence is incremented is $$\backslash frac,$$

which first appears in the Farey sequence of order .

Thus the first term to appear between and is, which appears in .

The total number of Farey neighbour pairs in is .

The Stern–Brocot tree is a data structure showing how the sequence is built up from 0 and 1, by taking successive mediants.

Equivalent-area interpretation

Every consecutive pair of Farey rationals have an equivalent area of 1.^[6] See this by interpreting consecutive rationals $$r\_1\; =\; \backslash frac\; \backslash qquad\; r\_2\; =\; \backslash frac$$as vectors in the xy-plane. The area is given by$$A\; \backslash left(\backslash frac,\; \backslash frac\; \backslash right)\; =\; qp\text{'}\; -\; q\text{'}p.$$As any added fraction in between two previous consecutive Farey sequence fractions is calculated as the mediant (⊕), then (since and, its area must be 1).

Farey neighbours and continued fractions

Fractions that appear as neighbours in a Farey sequence have closely related continued fraction expansions. Every fraction has two continued fraction expansions - in one the final term is 1; in the other the final term is greater by 1. If, which first appears in Farey sequence, has the continued fraction expansions

then the nearest neighbour of in (which will be its neighbour with the larger denominator) has a continued fraction expansion$$[0;\backslash \; a\_1,\backslash \; a\_2,\backslash \; \backslash ldots,\backslash \; a\_n]$$

and its other neighbour has a continued fraction expansion $$[0;\backslash \; a\_1,\backslash \; a\_2,\backslash \; \backslash ldots,\backslash \; a\_\{n-1\}]$$

For example, has the two continued fraction expansions and, and its neighbours in are, which can be expanded as ; and, which can be expanded as .

Farey fractions and the least common multiple

The lcm can be expressed as the products of Farey fractions as$$\backslash text[1,2,...,N]\; =\; e^\; =\; \backslash frac\; \backslash left(\backslash prod\_\; 2\; \backslash sin(\backslash pi\; r)\; \backslash right)^2$$

where is the second Chebyshev function.^{[7] [8]}

Farey fractions and the greatest common divisor

Since the Euler's totient function is directly connected to the gcd so is the number of elements in,$$|F\_n|\; =\; 1\; +\; \backslash sum\_^n\; \backslash varphi(m)\; =\; 1+\; \backslash sum\backslash limits\_^\; \backslash sum\backslash limits\_^m\; \backslash gcd(k,m)\; \backslash cos\; .$$

For any 3 Farey fractions the following identity between the gcd's of the 2x2 matrix determinants in absolute value holds:^[9]

^[10]

Applications

Farey sequences are very useful to find rational approximations of irrational numbers.^[11] For example, the construction by Eliahou^[12] of a lower bound on the length of non-trivial cycles in the 3x+1 process uses Farey sequences to calculate a continued fraction expansion of the number .

In physical systems with resonance phenomena, Farey sequences provide a very elegant and efficient method to compute resonance locations in 1D^[13] and 2D.^[14]

Farey sequences are prominent in studies of any-angle path planning on square-celled grids, for example in characterizing their computational complexity^[15] or optimality.^[16] The connection can be considered in terms of -constrained paths, namely paths made up of line segments that each traverse at most rows and at most columns of cells. Let be the set of vectors such that

, , and, are coprime. Let be the result of reflecting in the line . Let . Then any -constrained path can be described as a sequence of vectors from . There is a bijection between and the Farey sequence of order given by mapping to .

Ford circles

There is a connection between Farey sequence and Ford circles.

For every fraction (in its lowest terms) there is a Ford circle, which is the circle with radius

and centre at Two Ford circles for different fractions are either disjoint or they are tangent to one another—two Ford circles never intersect. If then the Ford circles that are tangent to are precisely the Ford circles for fractions that are neighbours of in some Farey sequence.

Thus is tangent to,,,, etc.

Ford circles appear also in the Apollonian gasket . The picture below illustrates this together with Farey resonance lines.^[17]

Riemann hypothesis

Farey sequences are used in two equivalent formulations of the Riemann hypothesis. Suppose the terms of are

Define in other words is the difference between the th term of the th Farey sequence, and the th member of a set of the same number of points, distributed evenly on the unit interval. In 1924 Jérôme Franel^[18] proved that the statement

$$\backslash sum\_^\; d\_^2\; =\; O\; (n^r)\; \backslash quad\; \backslash forall\; r\; >\; -1$$

is equivalent to the Riemann hypothesis, and then Edmund Landau^[19] remarked (just after Franel's paper) that the statement$$\backslash sum\_^\; |d\_|\; =\; O\; (n^r)\; \backslash quad\; \backslash forall\; r\; >\; \backslash frac$$

is also equivalent to the Riemann hypothesis.

Other sums involving Farey fractions

The sum of all Farey fractions of order is half the number of elements:$$\backslash sum\_\; r\; =\; \backslash frac\; |F\_n|\; .$$

The sum of the denominators in the Farey sequence is twice the sum of the numerators and relates to Euler's totient function:

$$\backslash sum\_\; b\; =\; 2\; \backslash sum\_\; a\; =\; 1\; +\; \backslash sum\_^\; i\backslash varphi(i),$$

which was conjectured by Harold L. Aaron in 1962 and demonstrated by Jean A. Blake in 1966.^[20] A one line proof of the Harold L. Aaron conjecture is as follows.The sum of the numerators is $$1\; +\; \backslash sum\_\; \backslash \; \backslash sum\_\; a\; =\; 1\; +\; \backslash sum\_\; b\backslash frac.$$ The sum of denominators is$$2\; +\; \backslash sum\_\; \backslash \; \backslash sum\_\; b\; =\; 2\; +\; \backslash sum\_\; b\backslash varphi(b).$$The quotient of the first sum by the second sum is .

Let be the ordered denominators of, then:^[21]

$$\backslash sum\_^$$

-1

\frac = \frac and$$\backslash sum\_^$$

-1

\frac = 1.

Let

the th Farey fraction in, then$$\backslash sum\_^$$

-1

(a_b_ - a_b_) = \sum_^

-1

\begin a_ & a_ \\ b_ & b_ \end = 3(|F_n|-1) - 2n - 1,

which is demonstrated in.^[22] Also according to this reference the term inside the sum can be expressed in many different ways:$$a\_\; b\_\; -\; a\_\; b\_\; =\; \backslash frac\; =\; \backslash frac\; =\; \backslash left\backslash lfloor\backslash frac\; \backslash right\backslash rfloor,$$

obtaining thus many different sums over the Farey elements with same result. Using the symmetry around 1/2 the former sum can be limited to half of the sequence as

$$\backslash sum\_^\; (a\_\; b\_\; -\; a\_\; b\_)\; =\; \backslash frac\; -\; n\; -\; \backslash left\backslash lceil\; \backslash frac\; \backslash right\backslash rceil,$$

The Mertens function can be expressed as a sum over Farey fractions as$$M(n)=\; -1+\; \backslash sum\_\; e^$$where

is the Farey sequence of order .

This formula is used in the proof of the Franel–Landau theorem.^[23]

Next term

A surprisingly simple algorithm exists to generate the terms of F_n in either traditional order (ascending) or non-traditional order (descending). The algorithm computes each successive entry in terms of the previous two entries using the mediant property given above. If and are the two given entries, and is the unknown next entry, then . Since is in lowest terms, there must be an integer k such that and, giving and . If we consider p and q to be functions of k, then

so the larger k gets, the closer gets to .

To give the next term in the sequence k must be as large as possible, subject to (as we are only considering numbers with denominators not greater than n), so k is the greatest . Putting this value of k back into the equations for p and q gives

This is implemented in Python as follows:from fractions import Fractionfrom collections.abc import Generator

def farey_sequence(n: int, descending: bool = False) -> Generator[Fraction]: """ Print the n'th Farey sequence. Allow for either ascending or descending.

>>> print(*farey_sequence(5), sep=' ') 0 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4 4/5 1 """ a, b, c, d = 0, 1, 1, n if descending: a, c = 1, n - 1 yield Fraction(a, b) while 0 <= c <= n: k = (n + b) // d a, b, c, d = c, d, k * c - a, k * d - b yield Fraction(a, b)

if __name__

"__main__": import doctest

doctest.testmod

Brute-force searches for solutions to Diophantine equations in rationals can often take advantage of the Farey series (to search only reduced forms). While this code uses the first two terms of the sequence to initialize a, b, c, and d, one could substitute any pair of adjacent terms in order to exclude those less than (or greater than) a particular threshold.^[24]

See also

• ABACABA pattern
• Stern–Brocot tree
• Euler's totient function

Further reading

• • Book: Ronald L. Graham . Ronald L. . Graham . Donald E. Knuth . Donald E. . Knuth . Oren Patashnik . Oren . Patashnik . Concrete Mathematics: A foundation for computer science . 2nd . Addison-Wesley . Boston, MA . 1989 . 0-201-55802-5 . 115–123, 133–139, 150, 462–463, 523–524. — in particular, see §4.5 (pp. 115–123), Bonus Problem 4.61 (pp. 150, 523–524), §4.9 (pp. 133–139), §9.3, Problem 9.3.6 (pp. 462–463).
• Web site: Linas . Vepstas . The Minkowski Question Mark, GL(2,Z), and the Modular Group . — reviews the isomorphisms of the Stern-Brocot Tree.
• Web site: Linas . Vepstas . Symmetries of Period-Doubling Maps . — reviews connections between Farey Fractions and Fractals.
• Cristian . Cobeli . Alexandru . Zaharescu . The Haros–Farey sequence at two hundred years. A survey . Acta Univ. Apulensis Math. Inform. . 5 . 2003 . 1–38. Web site: pp. 1–20. Acta Univ. Apulensis . Web site: pp. 21–38. Acta Univ. Apulensis .
• Book: Matveev, Andrey O. . Farey Sequences: Duality and Maps Between Subsequences . De Gruyter . Berlin, DE . 2017 . 978-3-11-054662-0. Errata + Code

External links

• Web site: Allen . Hatcher . Topology of Numbers. Online copy of book
• Web site: Alexander Bogomolny . Alexander . Bogomolny . Farey series . Cut-the-Knot.
• Web site: Alexander Bogomolny . Alexander . Bogomolny . Stern-Brocot Tree . Cut-the-Knot.
• Web site: Ettore . Pennestri . A Brocot table of base 120.
  • • • • • Archived at Ghostarchive and the Wayback Machine: Bonahon . Francis . Francis Bonahon . Funny Fractions and Ford Circles . . 9 June 2015 . YouTube . video.

Notes and References

1. Book: Guthery . Scott B. . 2011 . A Motif of Mathematics: History and Application of the Mediant and the Farey Sequence . 1. The Mediant . 7 . Docent Press . Boston . en . 978-1-4538-1057-6 . 1031694495 . https://books.google.com/books?id=swb2c9enRJcC&pg=PA7 . 28 September 2020.
2. Book: G. H. Hardy . Hardy, G.H. . E. M. Wright . Wright, E.M. . 1979 . An Introduction to the Theory of Numbers . Fifth . Oxford University Press . 0-19-853171-0 . Chapter III .
3. Book: Beiler, Albert H. . 1964 . Recreations in the Theory of Numbers . Second . Dover . 0-486-21096-0 . Chapter XVI. Cited in Web site: Farey Series, A Story . Cut-the-Knot.
4. Tomas Garcia . Rogelio . Farey Fractions with Equal Numerators and the Rank of Unit Fractions . Integers . July 2024 . 24 . 13 July 2024 --> .
5. Tomas . Rogelio . Partial Franel sums . Journal of Integer Sequences . January 2022 . 25 . 1 . 16 January 2022 --> .
6. Web site: Austin . David . December 2008 . Trees, Teeth, and Time: The mathematics of clock making . . Rhode Island . en . 28 September 2020 . live . https://web.archive.org/web/20200204014725/http://www.ams.org/publicoutreach/feature-column/fcarc-stern-brocot . 4 February 2020.
7. 0907.4384. Martin. Greg. A product of Gamma function values at fractions with the same denominator. math.CA. 2009.
8. 0909.1838 . Wehmeier . Stefan . The LCM(1,2,...,n) as a product of sine values sampled over the points in Farey sequences . math.CA . 2009.
9. Tomas Garcia . Rogelio . Equalities between greatest common divisors involving three coprime pairs. Notes on Number Theory and Discrete Mathematics . August 2020 . 26 . 3. 5–7 . 10.7546/nntdm.2020.26.3.5-7 . 225280271 . free . 20 January 2022 --> .
10. Tomas . Rogelio . Partial Franel sums . Journal of Integer Sequences . January 2022 . 25 . 1 . 16 January 2022 --> .
11. Web site: Farey Approximation . NRICH.maths.org . 18 November 2018 . https://web.archive.org/web/20181119092100/https://nrich.maths.org/6596 . 19 November 2018 . dead.
12. Eliahou . Shalom . The 3x+1 problem: new lower bounds on nontrivial cycle lengths . Discrete Mathematics . August 1993 . 118 . 1–3 . 45–56 . 10.1016/0012-365X(93)90052-U. free .
13. Zhenhua Li . A. . Harter . W.G. . 1308.4470 . Quantum Revivals of Morse Oscillators and Farey–Ford Geometry . Chem. Phys. Lett. . 2015 . 633 . 208–213 . 10.1016/j.cplett.2015.05.035. 2015CPL...633..208L . 66213897 .
14. Tomas . R. . 2014 . 10.1103/PhysRevSTAB.17.014001. From Farey sequences to resonance diagrams . Physical Review Special Topics - Accelerators and Beams . 17 . 1 . 014001. 2014PhRvS..17a4001T . free .
15. Harabor . Daniel Damir . Grastien . Alban . Öz . Dindar . Aksakalli . Vural . Optimal Any-Angle Pathfinding In Practice . Journal of Artificial Intelligence Research . 26 May 2016 . 56 . 89–118 . 10.1613/jair.5007. free .
16. Hew . Patrick Chisan . The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones . Journal of Artificial Intelligence Research . 19 August 2017 . 59 . 543–563 . 10.1613/jair.5442. free .
17. Tomas . Rogelio . 2006.10661. Imperfections and corrections . physics.acc-ph. 2020 . 4 July 2020 --> .
18. Jérôme Franel . Jérôme . Franel . Les suites de Farey et le problème des nombres premiers . Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen . Mathematisch-Physikalische Klasse . 1924 . 198–201 . fr.
19. Edmund Landau . Edmund . Landau . Bemerkungen zu der vorstehenden Abhandlung von Herrn Franel . Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen . Mathematisch-Physikalische Klasse . 1924 . 202–206 . de.
20. Jean A.. Blake. 10.2307/2313922 . Some Characteristic Properties of the Farey Series. The American Mathematical Monthly. 73. 1. 1966. 50–52 . 2313922 .
21. 10.4169/000298910X475005 . 10.4169/000298910X475005 . Farey Sums and Dedekind Sums . The American Mathematical Monthly . 117 . 1 . 72–78 . 2010 . Kurt Girstmair . Girstmair . Kurt. 31933470 .
22. R. R. . Hall . P. . Shiu . The Index of a Farey Sequence. Michigan Math. J. . 51 . 2003. 10.1307/mmj/1049832901. 1 . 209–223. free .
23. Book: Edwards . Harold M. . Harold Edwards (mathematician) . Smith. Paul A.. Paul Althaus Smith. Ellenberg. Samuel. Samuel Eilenberg. 1974 . Riemann's Zeta Function . 12.2 Miscellany. The Riemann Hypothesis and Farey Series . . Pure and Applied Mathematics. 263267 . New York . en . 978-0-08-087373-2 . 316553016 . https://archive.org/details/riemannszetafunc00edwa_0/page/262 . registration . 30 September 2020.
24. Norman . Routledge . Computing Farey series . . 92 . 523 . 55–62 . March 2008.