𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding the greatest common factor with the number line

✍ Scribed by BRYCE E. ADKINS

Book ID
125072180
Publisher
National Council of Teachers of Mathematics
Year
1965
Weight
451 KB
Volume
12
Category
Article
ISSN
0004-136X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Calculi with the greatest number
Calculi with the greatest number
✍ V. L. Rvachev; A. N. Shevchenko; T. I. Sheiko πŸ“‚ Article πŸ“… 1995 πŸ› Springer US 🌐 English βš– 794 KB
Rings with the greatest common divisor
Rings with the greatest common divisor
✍ A. N. Koryukin, A. M. Sebeldin, A. L. Sylla πŸ“‚ Article πŸ“… 2012 πŸ› Springer US 🌐 English βš– 105 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