Binary Trees and Sum of Two Squares
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.