Difference between revisions of "Talk:Greatest common divisor"

 
 
(3 intermediate revisions by 2 users not shown)
Line 1: Line 1:
The Euclidean Algorithm is mentioned here as "Euler's Theorem"This should be corrected and mention to the extended Euclidean Algorithm should be explained after that part of the article is finished.--[[User:MCrawford|MCrawford]] 22:15, 18 June 2006 (EDT)
+
This article will eventually include material up to the Olympiad level.  It might be good to start blocking out what's here as introAlso, make EA the first approach -- it requires less knowledge of math and is more computationally efficient in general.--[[User:MCrawford|MCrawford]] 13:33, 20 June 2006 (EDT)

Latest revision as of 12:33, 20 June 2006

This article will eventually include material up to the Olympiad level. It might be good to start blocking out what's here as intro. Also, make EA the first approach -- it requires less knowledge of math and is more computationally efficient in general.--MCrawford 13:33, 20 June 2006 (EDT)