๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the greatest common divisor of two Cullen numbers

โœ Scribed by Florian Luca

Publisher
Vandenhoeck & Ruprecht
Year
2003
Tongue
German
Weight
756 KB
Volume
73
Category
Article
ISSN
0025-5858

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On primitive recursive algorithms and th
On primitive recursive algorithms and the greatest common divisor function
โœ Yiannis N. Moschovakis ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 341 KB

We establish linear lower bounds for the complexity of non-trivial, primitive recursive algorithms from piecewise linear given functions. The main corollary is that logtime algorithms for the greatest common divisor from such givens (such as Stein's) cannot be matched in e ciency by primitive recurs

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

The calculation of the degree of an appr
The calculation of the degree of an approximate greatest common divisor of two polynomials
โœ Joab R. Winkler; Xin Lao ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

The calculation of the degree of an approximate greatest common divisor (AGCD) of two inexact polynomials f (y) and g(y) is a non-trivial computation because it reduces to the estimation of the rank loss of a resultant matrix R( f , g). This computation is usually performed by placing a threshold on