论文标题
Farey序列，严厉的Brocot树和欧几里得定理
The Farey Sequence, Stern Brocot Tree and Euclids Theorem
论文作者
论文摘要
Farey的序列是一种众所周知的程序，用于生成0到1的适当分数。Farey序列通常用于非理性数字，福特圆圈和Riemann假设的合理近似中。因此，在本文中，我们旨在使用Farey序列的属性来证明流行的GCD定理。
Farey's sequence is a well-known procedure used to generate proper fractions from 0 to 1. Farey sequence is commonly used in rational approximations of irrational numbers, ford circles and in Riemann hypothesis. Thus, in this paper, we aim to use properties of the Farey's sequence to prove the popular gcd theorem.
