|
|
(One intermediate revision by one other user 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 intro. Also, 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) |
− | | |
− | 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
| |
− | | |
− | ----
| |
− | | |
− | 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.--[[User:MCrawford|MCrawford]] 23:35, 18 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)