Binary Trees and Sum of Two Squares
arXiv:2606.24931 · doi:10.5281/zenodo.20597662
Abstract
In this paper, we introduce a matrix-based binary tree that forms the foundation of both the Stern--Brocot and Calkin--Wilf trees. We then explore its connection to continued fractions. Building on this relationship, we provide a path-based representation of Brillhart's proof of the sum of two squares.
5 pages