Difference between revisions of "Talk:Greatest common divisor"
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) | 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) | ||
+ | |||
+ | 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 :(. --[[User:fedja|fedja]] 18 June 2006 |
Revision as of 21:43, 18 June 2006
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