Binary trees and sum of two squares
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)].
- A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra
- H. J. S. Smith and the Fermat Two Squares Theorem
- History of the theory of numbers. Vol. I: Divisibility and primality. Vol. II: Diophantine analysis.
- scientific article; zbMATH DE number 3062232 (Why is no real title available?)
- Note on Representing a Prime as a Sum of Two Squares
- Recounting the Rationals: Twice!
This page was built for publication: Binary trees and sum of two squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7290503)
