
Accession Number : AD0835213
Title : METHODS FOR COMPUTING THE GREATEST COMMON DIVISOR AND APPLICATIONS IN MATHEMATICAL PROGRAMMING.
Descriptive Note : Master's thesis,
Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Personal Author(s) : MacGregor, Harry Gregor, Jr. ; Modine, Kent Allen
Report Date : JUN 1968
Pagination or Media Count : 46
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)
Descriptors : (*NUMBER THEORY, PROBLEM SOLVING), (*MATHEMATICAL PROGRAMMING, NUMBER THEORY), LINEAR PROGRAMMING, SET THEORY, ALGORITHMS, COMPUTER PROGRAMS, THEOREMS, THESES.
Subject Categories : Theoretical Mathematics
Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE