Talk:Greatest common divisor

Revision as of 00:54, 19 June 2006 by Fedja (talk | contribs)

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.--MCrawford 22:15, 18 June 2006 (EDT)

I made the correction but didn't change the content too much. In my humble opinion, one should create a special article for Euclidean algorithm, after which half of this article can be deleted. I tried to start but the parser refused to recognize every single formula I wrote, so I gave up. Something should be done to make the LaTeX work on AoPSWiki. As it is, it is barely functioning at best :(. --fedja 18 June 2006


I agree that EA deserves its own entry. Also, I suggest not describing the iterative steps in the EA as "recursive" in the introductory section of what this article becomes. Use that at the intermediate level, and just describe the process as "repeating" for the intro section.--MCrawford 23:35, 18 June 2006 (EDT)

I added an article on EA and removed the algorithm's description from the article on GCD. --fedja 18 June 2006