Farey sequence
Builds on Greatest common divisor
Definition
Let be a positive integer. The Farey sequence of order is the increasing sequence of all fractions with and . Each fraction is in lowest terms, and starts with and ends with .
Remarks
For example, . If are neighbours in , then . The length of is , with 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
- no evidence level
- Divisibility definition
- Greatest common divisor definition
- Farey sequence definition
Further reading
- Web https://en.wikipedia.org/wiki/Farey_sequence, lead section
About this page
| Tag | 0PN4QJE969 |
|---|---|
| URI | m2://0PN4QJE969 |
| Kind | definition |
| Writing | W1 stated |
| MSC | 11B57 |
| Defines | Farey sequence |
| Uses | Greatest 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.