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
✦ LIBER ✦
Using a Calculator to Find the “Greatest Common Factor”
✍ Scribed by Bryce E. Adkins
- Book ID
- 114976539
- Publisher
- School Science and Mathematics Association
- Year
- 1981
- Tongue
- English
- Weight
- 119 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0036-6803
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A carry-free algorithm for finding the g
✍
George B. Purdy
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 503 KB
Using a Homemade Calculator to Master th
✍
Marvin N. Nelson; H. Clifford Clark
📂
Article
📅
1991
🏛
School Science and Mathematics Association
🌐
English
⚖ 274 KB
A method to calculate displacement facto
✍
Peixian Li; Zhixiang Tan; Lili Yan; Kazhong Deng
📂
Article
📅
2011
🏛
Elsevier
🌐
English
⚖ 275 KB
Using the ovarian vein to find the ovary
✍
S. Govil; A. Justus
📂
Article
📅
2006
🏛
Springer
🌐
English
⚖ 276 KB
A new methodology to calculate Carter fa
✍
Wesley Pacheco Calixto; Enes Gonçalves Marra; Leonardo da Cunha Brito; Bernardo
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 494 KB
This paper presents a methodology to calculate the value of Carter's factor for airgaps with polygonal slots. A numerical evaluation of the Schwarz-Christoffel transformation is performed using Genetic Algorithms. The methodology presented here extends Carter's method to airgaps with more complicate
Using the Online Marketplace to Find Qua
✍
John S. Kakalik; Marie A. Wright
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 171 KB