The Stern-Brocot tree organizes all rationals by their continued fraction expansions. The Farey sequence F_n contains all fractions p/q with q≤n. Click any node to see its continued fraction.
Mediant property: between p/q and r/s, the simplest fraction is (p+r)/(q+s). This IS the Euclidean algorithm.