What is it about?
An elegant algorithm of how to find GCD for two very large numbers. It is based on looking only on the pair of truncated numbers, which carry only the first view digits of each original number. And so the goal is to make quick, elegant check that the first several steps are indentical to the true pair.
Featured Image
Why is it important?
Every GCD algorithm is important.
Perspectives
There are some ways to improve the efficiency at the time of truncation.
Dr Ari Belenkiy
Read the Original
This page is a summary of: A Greatest Common Divisor Algorithm, International Journal of Algebra and Computation, October 1998, World Scientific Pub Co Pte Lt,
DOI: 10.1142/s0218196798000296.
You can read the full text:
Contributors
The following have contributed to this page
