 |
 |
Algebra |
|
Authors: Timothy Jones
The Euclidean Algorithm finds the greatest common divisor (GCD) of two integers; it also gives a way to express the GCD as an integer linear combination of the two numbers. This latter feature is not easily done by hand. We present programs for the Euclidean Algorithm and give a fast and easy way to find this linear combination.
Comments: 4 Pages. Added more complete TI84-CE program.
Download: PDF
[v1] 2025-06-19 18:55:59
[v2] 2025-07-09 11:41:42
Unique-IP document downloads: 313 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.
| Third-Party Links: |
|