Binary trees and sum of two squares (Q7290503)

The paper introduces an infinite binary tree, where vertices are labeled with \(2\times 2\) integral matrices. The well-known Stern-Brocot and Calkin-Wilf trees can be derived from this tree by multiplying the \(2\times 2\) integral matrices from the right with the vector \((1,1)^T\) and from the left with the vector \((1,1)\), respectively. Using this infinite binary tree, which is closely related to continued fractions, there is a way to (re)produce Brillhart's proof that primes of the form \(4n+1\) can be written as a sum of two squares. For \textit{J. Brillhart}'s proof, see [Math. Comput. 26, 1011--1013 (1972; Zbl 0259.10006)].