Accession Number:

AD0835213

Title:

METHODS FOR COMPUTING THE GREATEST COMMON DIVISOR AND APPLICATIONS IN MATHEMATICAL PROGRAMMING.

Corporate Author:

NAVAL POSTGRADUATE SCHOOL MONTEREY CA

Report Date:

1968-06-01

Abstract:

Several methods are presented for determining the greatest common divisor of a set of positive integers by solving the integer program find the integers x sub i that minimize Z Summation from i 1 to i n of a sub i x sub i subject to Z or 1. The methods are programmed for use on a computer and compared with the Euclidean algorithm. Computational results and applications are given. Author

Descriptive Note:

Master's thesis,

Pages:

0046

File Size:

0.00MB

Full text not available:

Request assistance