arXiv · 1803.04875
Generating B\'ezout trees for Pythagorean pairs
Abstract
Relatively prime pairs of integers can be represented as nodes in three way branching trees. We construct trees of B\'ezout coefficients which correspond to the relatively prime pairs in the aforementioned trees. As one application, we compare the B\'ezout coefficients in these trees to those returned by the gcd function in Matlab. As another application, we use these trees to decrease the computation time required to create computer generated hyperbolic wallpaper designs.
Explore related subjects
Keep this discovery
Emily Gullerud, James S. Walker. 2018-03-13. Generating B\'ezout trees for Pythagorean pairs. https://arxiv.org/abs/1803.04875
Cite the original work for its findings. Save a collection to share your selection of sources.