Go to the source code of this file.
Functions | |
template<class item_class> item_class | gcd (const item_class &a, const item_class &b) |
template<class T> T | gcd_bezout (const T &a, const T &b, T &u, T &v) |
template<class item_class> item_class | gcd (const vector< item_class > &v) |
This module consists of two functions which implements Euclidian algorithm for greatest common divisor producing.
Definition in file gcd.h.
|
Euclidian algorithm that produces the greatest common divisor of entries in v.
Definition at line 81 of file gcd.h. Referenced by rational::operator *(), and rational::operator/().
|
|
Euclidian algorithm produces the greatest common divisor of two integer u and v.
|
|
Euclidian algorithm produces the greatest common divisor of two integer u and v.
|