Farey sequence

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.

Examples

The Farey sequences of orders 1 to 8 are :
:''F''₁ =
:''F''₂ =
:''F''₃ =
:''F''₄ =
:''F''₅ =
:''F''₆ =
:''F''₇ =
:''F''₈ =

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 2, centered at the origin. Using Pick's theorem the area of the sunburst is 4(, _n, −1), where , _n, is the number of fractions in _n.

History

:''The history of 'Farey series' is very curious'' — Hardy & Wright (1979)

:''... 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) Cited in

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. 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 ''n'' contains all of the members of the Farey sequences of lower orders. In particular ''F_n'' contains all of the members of ''F''_''n''−1 and also contains an additional fraction for each number that is less than ''n'' and coprime to ''n''. Thus ''F''₆ consists of ''F''₅ together with the fractions and .

The middle term of a Farey sequence ''F''_''n'' is always ,
for ''n'' > 1. From this, we can relate the lengths of ''F_n'' and ''F''_''n''−1 using Euler's totient function $\varphi(n)$ :

:$, F_n, = , F_, + \varphi(n).$

Using the fact that , ''F''₁, = 2, we can derive an expression for the length of ''F_n'':

:$, F_n, = 1 + \sum_^n \varphi(m) = 1 + \Phi(n),$
where $\Phi(n)$ is the summatory totient.

We also have :
:$, F_n, = \frac\left(3+\sum_^n\mu(d)\left\lfloor\tfrac\right\rfloor^2\right),$
and by a Möbius inversion formula :
:$, F_n, = \frac(n+3)n-\sum_^n, F_, ,$
where µ(''d'') is the number-theoretic Möbius function, and $\lfloor \tfrac \rfloor$ is the floor function.

The asymptotic behaviour of , ''F_n'', is :
:$, F_n, \sim \frac .$

The index $I_n(a_)=k$ of a fraction $a_$ in the Farey sequence $F_n=\$ is simply the position that $a_$ 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:
:$I_n(0/1) = 0,$
:$I_n(1/n) = 1,$
:$I_n(1/2) = (, F_n, -1)/2,$
:$I_n(1/1) = , F_n, -1 ,$
:$I_n(h/k) = , F_n, -1-I_n((k-h)/k).$

The index of $1/k$ where $n/(i+1) < k \leq n/i$ and $n$ is the least common multiple of the first $i$ numbers, n=( ,i , is given by:
:$I_n(1/k) = 1 + n \sum_^ \frac - k\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
:$\frac - \frac = \frac,$

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

Thus and are neighbours in ''F''₅, and their difference is .

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

for positive integers ''a'',''b'',''c'' and ''d'' with ''a'' < ''b'' and ''c'' < ''d'' then and will be neighbours in the Farey sequence of order max(''b,d'').

If has neighbours and in some Farey sequence, with
:$\frac < \frac < \frac$

then is the mediant of and – in other words,
:$\frac = \frac.$

This follows easily from the previous property, since if , then , , .

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
:$\frac,$

which first appears in the Farey sequence of order .

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

The total number of Farey neighbour pairs in ''F_n'' is 2, ''F_n'',  − 3.

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. See this by interpreting consecutive rationals ''r''₁ = ''p''/''q'' and ''r''₂ = ''p''′/''q''′ as vectors (''p'', ''q'') in the x–y plane. The area of ''A''(''p''/''q'', ''p''′/''q''′) is given by ''qp''′ − ''q''′''p''. As any added fraction in between two previous consecutive Farey sequence fractions is calculated as the mediant (⊕), then ''A''(''r''₁, ''r''₁ ⊕ ''r''₂) = ''A''(''r''₁, ''r''₁) + ''A''(''r''₁, ''r''₂) = ''A''(''r''₁, ''r''₂) = 1 (since ''r''₁ = 1/0 and ''r''₂ = 0/1, 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 than 1. If , which first appears in Farey sequence ''F_q'', has continued fraction expansions
: ; ''a''₁, ''a''₂, ..., ''a''_{''n'' − 1}, ''a''_''n'', 1: ; ''a''₁, ''a''₂, ..., ''a''_{''n'' − 1}, ''a''_''n'' + 1
then the nearest neighbour of in ''F_q'' (which will be its neighbour with the larger denominator) has a continued fraction expansion
: ; ''a''₁, ''a''₂, ..., ''a''_''n''
and its other neighbour has a continued fraction expansion
: ; ''a''₁, ''a''₂, ..., ''a''_{''n'' − 1}
For example, has the two continued fraction expansions and , and its neighbours in ''F''₈ 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
: \text ,2,...,N= e^=\frac \left( \prod_ 2 \sin(\pi r) \right)^2

where $\psi(N)$ is the second Chebyshev function.

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'',
:$, F_n, = 1 + \sum_^n \varphi(m) = 1+ \sum\limits_^ \sum\limits_^m \gcd(k,m) \cos .$

For any 3 Farey fractions , and the following identity between the gcd's of the 2x2 matrix determinants in absolute value holds:
:$\gcd\left(\begin a & c\\b & d \end, \begin a & e\\b & f \end \right) =\gcd\left(\begin a & c\\b & d \end, \begin c & e\\d & f \end \right) =\gcd\left(\begin a & e\\b & f \end, \begin c & e\\d & f \end \right)$

Applications

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

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

Farey sequences are prominent in studies of any-angle path planning on square-celled grids, for example in characterizing their computational complexity or optimality. The connection can be considered in terms of ''r''-constrained paths, namely paths made up of line segments that each traverse at most $r$ rows and at most $r$ columns of cells. Let $Q$ be the set of vectors $(q,p)$ such that $1 \leq q \leq r$, $0 \leq p \leq q$, and $p$, $q$ are coprime. Let $Q*$ be the result of reflecting $Q$ in the line $y = x$. Let $S = \$. Then any ''r''-constrained path can be described as a sequence of vectors from $S$. There is a bijection between $Q$ and the Farey sequence of order $r$ given by $(q,p)$ mapping to $\tfrac$.

Ford circles

There is a connection between Farey sequence and Ford circles.

For every fraction (in its lowest terms) there is a Ford circle C[], which is the circle with radius 1/(2''q''²) and centre at (, ). Two Ford circles for different fractions are either Disjoint sets, disjoint or they are tangent to one another—two Ford circles never intersect. If 0 < < 1 then the Ford circles that are tangent to C[] are precisely the Ford circles for fractions that are neighbours of in some Farey sequence.

Thus ''C''[] is tangent to ''C''[], ''C''[], ''C''[], ''C''[], etc.

Ford circles appear also in the Apollonian gasket (0,0,1,1). The picture below illustrates this together with Farey resonance lines.

Riemann hypothesis

Farey sequences are used in two equivalent formulations of the Riemann hypothesis. Suppose the terms of $F_n$ are $\$. Define $d_ = a_ - k/m_n$, in other words $d_$ is the difference between the ''k''th term of the ''n''th Farey sequence, and the ''k''th member of a set of the same number of points, distributed evenly on the unit interval. In 1924 Jérôme Franel proved that the statement

: $\sum_^ d_^2 = O (n^r)\quad\forall r>-1$

is equivalent to the Riemann hypothesis, and then Edmund Landau remarked (just after Franel's paper) that the statement
: $\sum_^ , d_, = O (n^r)\quad\forall r>1/2$

is also equivalent to the Riemann hypothesis.

Other sums involving Farey fractions

The sum of all Farey fractions of order ''n'' is half the number of elements:
: $\sum_ r = \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:

: $\sum_ b = 2 \sum_ a = 1 + \sum_^ i\varphi(i) ,$

which was conjectured by Harold L. Aaron in 1962 and demonstrated by Jean A. Blake in 1966. A one line proof of the Harold L. Aaron conjecture is as follows.
The sum of the numerators is $$. The sum of denominators is
$$. The quotient of the first sum by the second sum is $\frac$.

Let ''b''_''j'' be the ordered denominators of ''F''_''n'', then:

:$\sum_^ \frac = \frac$

and
: $\sum_^ \frac = 1 .$

Let ''a''_''j''/''b''_''j'' the ''j''th Farey fraction in ''F''_''n'', then
: $\sum_^ (a_ b_ - a_ b_) = \sum_^ \begin a_ & a_\\b_ & b_ \end =3(, F_n, -1)-2n-1 ,$

which is demonstrated in. Also according to this reference the term inside the sum can be expressed in many different ways:
: $a_ b_ - a_ b_ = \frac = \frac = \left\lfloor\frac \right\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
: $\sum_^ (a_ b_ - a_ b_) = 3(, F_n, -1)/2 - n- \lceil n/2 \rceil ,$

The Mertens function can be expressed as a sum over Farey fractions as

:$M(n)= -1+ \sum_ e^$   where   $\mathcal_n$   is the Farey sequence of order ''n''.

This formula is used in the proof of the Franel–Landau theorem.

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 ''kc'' = ''a'' + ''p'' and ''kd'' = ''b'' + ''q'', giving ''p'' = ''kc'' − ''a'' and ''q'' = ''kd'' − ''b''. If we consider ''p'' and ''q'' to be functions of ''k'', then
:$\frac- \frac = \frac$
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 ''kd'' − ''b'' ≤ ''n'' (as we are only considering numbers with denominators not greater than ''n''), so ''k'' is the greatest integer ≤ . Putting this value of ''k'' back into the equations for ''p'' and ''q'' gives
:$p = \left\lfloor\frac\right\rfloor c - a$
:$q = \left\lfloor\frac\right\rfloor d - b$

This is implemented in Python as follows:

def farey_sequence(n: int, descending: bool = False) -> None:
"""Print the n'th Farey sequence. Allow for either ascending or descending."""
(a, b, c, d) = (0, 1, 1, n)
if descending:
(a, c) = (1, n - 1)
print("/".format(a, b))
while (c <= n and not descending) or (a > 0 and descending):
k = (n + b) // d
(a, b, c, d) = (c, d, k * c - a, k * d - b)
print("/".format(a, b))

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.

See also

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

Footnotes

References

Further reading

*
* — 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).
* — reviews the isomorphisms of the Stern-Brocot Tree.
* — reviews connections between Farey Fractions and Fractals.
*
*
Errata + Code

External links

*
*
*
*
*
*
*
*
* Archived a
Ghostarchive
and th
Wayback Machine

{{Authority control

Fractions (mathematics)
Number theory
Sequences and series