Number Theory


The Greatest Common Divisor Function is Symmetric

Authors: Pedro Hugo García Peláez

With this algorithm you can easily find the greatest common divisor of two numbers even with large numbers of figures and the same can be done if you want to find the greatest common divisor of polynomials easily and also complex numbers.

Comments: Pages.

Download: PDF

Submission history

[v1] 2019-05-29 20:34:27

Unique-IP document downloads: 12 times 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. 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.

comments powered by Disqus