Methods for Computing the Greatest Common Divisor and Applications in Mathematical Programming.
Loading...
Authors
MacGregor, Harry Gregor, Jr.
Modine, Kent Allen
Subjects
Advisors
Modine, Kent A.
Date of Issue
1968-06
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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 algorithm. Computational results
and applications are given.
Type
Thesis
Description
Series/Report No
Department
Operations Research
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.