Math 2.0

Number theory Definition

Farey sequence

Builds on Greatest common divisor

Definition

Let nn be a positive integer. The Farey sequence FnF_n of order nn is the increasing sequence of all fractions ab\frac{a}{b} with 0≤a≤b≤n0 \le a \le b \le n and gcd⁡(a,b)=1\gcd(a, b) = 1. Each fraction is in lowest terms, and FnF_n starts with 01\frac{0}{1} and ends with 11\frac{1}{1}.

Remarks

For example, F5=(01,15,14,13,25,12,35,23,34,45,11)F_5 = \left( \frac{0}{1}, \frac{1}{5}, \frac{1}{4}, \frac{1}{3}, \frac{2}{5}, \frac{1}{2}, \frac{3}{5}, \frac{2}{3}, \frac{3}{4}, \frac{4}{5}, \frac{1}{1} \right). If ab<cd\frac{a}{b} < \frac{c}{d} are neighbours in FnF_n, then bc−ad=1bc - ad = 1. The length of FnF_n is 1+∑k=1nφ(k)1 + \sum_{k=1}^{n} \varphi(k), with φ\varphi Euler's totient function. The sequences are named after John Farey, whose letter about them appeared in 1816.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Divisibility definition
  2. Greatest common divisor definition
  3. Farey sequence definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Farey_sequence, lead section
About this page
Tag0PN4QJE969
URIm2://0PN4QJE969
Kinddefinition
WritingW1 stated
MSC11B57
DefinesFarey sequence
UsesGreatest common divisor

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.