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

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)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1968
Accession Number
AD0835213

Entities

People

  • Harry Gregor Macgregor Jr.
  • Kent Allen Modine

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computers
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematical Programming
  • Mathematics

Readers

  • Linear Algebra
  • Regression Analysis.