Euclid meets Popeye: The Euclidean Algorithm for $2\times 2$ Matrices by Bacher, Roland

“…An analogue of the Euclidean algorithm for square matrices of size $2$ with integral non-negative entries and positive determinant $n$ defines a finite set $\mathcal{R}(n)$ of Euclid-reduced matrices corresponding to elements of $\lbrace (a,b,c,d)\in \mathbb{N}^4\ \vert \ n=ab-cd,\ 0\le c,d…”
Get full text