Difference between Adjacent Terms of Farey Sequence
Jump to navigation
Jump to search
Theroem
Let $F_n$ be a Farey sequence of order $n$.
Let $\dfrac a b$ and $\dfrac c d$ be consecutive terms of $F_n$ such that $\dfrac a b < \dfrac c d$.
Then:
- $\dfrac c d - \dfrac a b = \dfrac 1 {b d}$
or equivalently:
- $b c - a d = 1$
Proof
This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Examples
Arbitrary Example
Consider the Farey sequence $F_5$ of order $5$:
- $\dfrac 0 1, \dfrac 1 5, \dfrac 1 4, \dfrac 1 3, \dfrac 2 5, \dfrac 1 2, \dfrac 3 5, \dfrac 2 3, \dfrac 3 4, \dfrac 4 5, \dfrac 1 1$
Consider the consecutive terms $\dfrac 3 5$ and $\dfrac 2 3$.
We have:
\(\ds \dfrac 2 3 - \dfrac 3 5\) | \(=\) | \(\ds \dfrac {2 \times 5 - 3 \times 3} {3 \times 5}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \dfrac {10 - 9} {15}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \dfrac 1 {15}\) |
$\blacksquare$
Sources
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): Farey sequence (of order $n$)
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): Farey sequence (of order $n$)