✦ LIBER ✦

Notes on Greatest Common Divisor and Least Common Multiple of Integers

✍ Scribed by Benjamin Franklin Yanney

Book ID: 123798105
Publisher: Mathematical Association of America
Year: 1912
Tongue: English
Weight: 312 KB
Volume: 19
Category: Article
ISSN: 0002-9890
DOI: 10.2307/2973872

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Greatest common divisor and least common

Greatest common divisor and least common multiple

✍ MARY HART ZINK 📂 Article 📅 1966 🏛 National Council of Teachers of Mathematics ⚖ 344 KB

Greatest common divisors and least commo

Greatest common divisors and least common multiples of graphs

✍ G. Chartrand; L. Holley; G. Kubicki; M. Schultz 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 492 KB

Greatest Common Factor and Least Common

Greatest Common Factor and Least Common Multiple

✍ Charles E. Lamb and Lyndal R. Hutcherson 📂 Article 📅 1984 🏛 National Council of Teachers of Mathematics ⚖ 345 KB

Another Look at Least Common Multiple an

Another Look at Least Common Multiple and Greatest Common Factor

✍ Loren L. Henry 📂 Article 📅 1978 🏛 National Council of Teachers of Mathematics ⚖ 346 KB

On greatest common divisor matrices and

On greatest common divisor matrices and their applications

✍ B.V.Rajarama Bhat 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 990 KB

A carry-free algorithm for finding the g

A carry-free algorithm for finding the greatest common divisor of two integers

✍ George B. Purdy 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 503 KB

We investigate a variant of the so-called "binary" algorithm for finding the GCD (greatest common divisor) of two numbers which requires no comparisons. We show that when implemented with carry-save hardware, it can be used to find the modulo B inverse of an n-bit binary integer in a time proportion