For a positive integer , the Farey sequence is the increasing list of reduced fractions in with denominators at most , including and . For example,
Each denominator contributes exactly new interior fractions, because the allowable numerators are precisely those coprime to . Therefore the number of terms is , using the summatory totient function.
For two distinct fractions in the list, their difference is , since the integer is positive. This arithmetic separation, rather than arbitrary real spacing, makes Farey fractions useful in rational approximation. The Stern-Brocot tree organizes the same positive reduced fractions by mediant insertion instead of a denominator cutoff.
A member of a Farey sequence. Two distinct level- fractions have ordinary distance at least . On the quotient circle identify zero and one before forming a set; the shorter wrapped distance of two remaining distinct fractions obeys the same bound.

Articles by others on the same topic (2)

Farey sequence by Ciro Santilli 40 Created 2024-07-12 Updated 2025-07-16
A Farey sequence, denoted as \( F_n \), is a sequence of completely reduced fractions between 0 and 1 that have denominators less than or equal to a given positive integer \( n \). The Farey sequence is arranged in increasing order. Each fraction in the sequence is expressed in simplest form, meaning that the numerator and denominator are coprime (they have no common factors other than 1).