Jump to content

Talk:Lehmer's GCD algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Snowbot (talk | contribs) at 18:59, 5 April 2007 (Removing Template:Maths rating per Wikiproject Mathematics request). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Draft

Hope I've got the algorithm right. Maybe someone could write up a program to test it. We should also make note of the numerous variants on this algorithm eg. Jebelean etc. sometime. Jafet 17:02, 21 December 2006 (UTC)[reply]

This looks like an algorithm well-suited for Matlab or some functional programming language, with multiple assignment and matrices. My question is, how on earth do you tell whether two numbers have the same number of digits in constant time, unless you're keeping track of the number of digits independently somehow (e.g., if this is part of a bignum library)? Without some kind of "similar_size(a,b)" primitive, we're not going to be able to write concise code for this algorithm, are we? --Quuxplusone 03:18, 23 December 2006 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Lehmer%27s_GCD_algorithm&oldid=120549700"