TWO ALGORITHMS FOR FAREY TREE

Authors

Abstract

The Farey tree is a binary tree containing all rational numbers from \([0, 1]\) in an ordered way. It is constructed hierarchically, level by level, using the Farey mediant sum. Some known algorithms, connected with the Farey tree construction are reviewed and two new algorithms are proposed.

Downloads

Download data is not yet available.

Downloads

Published

2005-01-01

Issue

Vol. 29 (2005): 29 (LV) (2005)

Section

Articles

How to Cite

[1]
L. Kocić and L. Stefanovska, “TWO ALGORITHMS FOR FAREY TREE”, Mat. Bilt., vol. 29, no. 1, pp. 89–98, Jan. 2005, Accessed: Aug. 14, 2026. [Online]. Available: https://bilten.smm.org.mk/index.php/bilten/article/view/1716