Greatest Common Divisor of Several Integers and an Associated Linear Diophantine Equation

DOI10.2307/2310105zbMath0100.03604OpenAlexW2334295053MaRDI QIDQ3281143

Robert Weinstock

Publication date: 1960

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2310105

zbMATH Keywords

number theory

Mathematics Subject Classification ID

Linear Diophantine equations (11D04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items

Comparison of algorithms for calculation of g.c.d. of polynomials ⋮ Using the Blankinship algorithm to find the general solution of a linear diophantine equation

This page was built for publication: Greatest Common Divisor of Several Integers and an Associated Linear Diophantine Equation