In number theory, the Stern–Brocot tree is an infinite complete binary tree in which the vertices correspond one-for-one to the positive rational numbers...
17 KB (2,589 words) - 07:00, 27 April 2025
Euclidean algorithm (section Stern–Brocot tree)
infinite binary search tree, called the Stern–Brocot tree. The number 1 (expressed as a fraction 1/1) is placed at the root of the tree, and the location of...
126 KB (15,349 words) - 16:35, 30 April 2025
Moritz Abraham Stern, a 19th-century German mathematician who also invented the closely related Stern–Brocot tree. Even earlier, a similar tree (including...
16 KB (1,949 words) - 23:34, 19 June 2025
series". Cut-the-Knot. Bogomolny, Alexander. "Stern-Brocot Tree". Cut-the-Knot. Pennestri, Ettore. "A Brocot table of base 120". "Farey series", Encyclopedia...
41 KB (5,077 words) - 22:13, 8 May 2025
with, but independently of, German number theorist Moritz Stern) of the Stern–Brocot tree, a mathematical structure useful in approximating real numbers...
3 KB (248 words) - 22:50, 3 June 2025
Farey sequences Fn are successively built up with increasing n. The Stern–Brocot tree provides an enumeration of all positive rational numbers via mediants...
11 KB (2,040 words) - 14:58, 3 June 2025
{R} } is defined via the codenominator. Jimm relates the Stern-Brocot tree to the Bird tree. Jimm induces an involution of the moduli space of rank-2...
28 KB (4,407 words) - 06:55, 3 March 2025
more than twice. He is also known for the Stern–Brocot tree, which he wrote about in 1858 and which Brocot independently discovered in 1861. Setting the...
3 KB (279 words) - 21:37, 12 December 2024
as can be seen by a recursive definition closely related to the Stern–Brocot tree. One way to define the question-mark function involves the correspondence...
26 KB (3,855 words) - 21:04, 25 June 2025
of a given unit m. This problem is related to Farey sequences, the Stern–Brocot tree, and continued fractions. Finished lumber, writing paper, electronic...
68 KB (8,569 words) - 21:58, 27 June 2025
or the next smaller ancestor to p / q {\displaystyle p/q} in the Stern–Brocot tree or where p / q {\displaystyle p/q} is the next larger or next smaller...
11 KB (1,506 words) - 08:26, 22 December 2024
matrix product and integration over a certain fractal measure on the Stern–Brocot tree. Moreover, Viswanath computed the numerical value above using floating...
7 KB (1,032 words) - 08:35, 23 June 2025
where L and R are the standard left and right moves on the Stern–Brocot tree; it is well known that these moves generate the modular group. Alternately...
36 KB (4,891 words) - 22:52, 19 June 2025
fraction Recurring decimal Cyclic number Farey sequence Ford circle Stern–Brocot tree Dedekind sum Egyptian fraction Montgomery reduction Modular exponentiation...
10 KB (937 words) - 18:05, 24 June 2025
representation Restricted partial quotients – Analytic series Stern–Brocot tree – Ordered binary tree of rational numbers Pettofrezzo & Byrkit 1970, p. 150....
69 KB (9,628 words) - 12:45, 24 June 2025
17 (4): 333–339. MR 0550175. Gibbs, Philip (1999). "A Generalised Stern-Brocot Tree from Regular Diophantine Quadruples". arXiv:math.NT/9903035v1. Herrmann...
4 KB (453 words) - 06:48, 2 June 2025
development—without the use of continued fractions—of the theory of the Stern–Brocot tree, which codifies the new rational endpoints that appear at the nth...
78 KB (10,932 words) - 02:21, 20 June 2025