Methods for Computing the Greatest Common Divisor and Applications in Mathematical Programming.
Several methods are presented for determining the greatest common divisor of a set of positive integers by solving the n integer program: find the integers x. that minimize Z = E a.x. i = l subject to Z 2: 1. The methods are programmed for use on a computer and compared with the Euclidean algo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Monterey, California. Naval Postgraduate School
2012
|
| Online Access: | http://hdl.handle.net/10945/12659 |