Difference between revisions of "Talk:Euclidean algorithm"
(fix) |
|||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | {{WotW|week=January 10-16|prevweek=[[Graph (graph theory)]]<br />[[Carl Friedrich Gauss]]|curweek=[[Euclidean algorithm]]<br />[[Euclid]]|nextweek=[[Expected value]]<br />[[Recursion]]}} | ||
| + | {{AotD tag|January 21st, 2008}} | ||
I liked the new organization but I thought that to start with the very formal description of algorithm may be not a very good idea. Besides, one would have to add some words on why the algorithm works anyway. So, I just restored the beginning part of the initial version. Of course, what resulted from it is far from perfection and improvements are welcome. --[[User:Fedja|Fedja]] 12:45, 20 June 2006 (EDT) | I liked the new organization but I thought that to start with the very formal description of algorithm may be not a very good idea. Besides, one would have to add some words on why the algorithm works anyway. So, I just restored the beginning part of the initial version. Of course, what resulted from it is far from perfection and improvements are welcome. --[[User:Fedja|Fedja]] 12:45, 20 June 2006 (EDT) | ||
Latest revision as of 19:45, 28 March 2008
| AoPSWiki Words of the Week for January 10-16 | ||
| Previous week Graph (graph theory) Carl Friedrich Gauss |
Current week Euclidean algorithm Euclid |
Next week Expected value Recursion |
| AoPSWiki Article of the Day | ||
|
| ||
I liked the new organization but I thought that to start with the very formal description of algorithm may be not a very good idea. Besides, one would have to add some words on why the algorithm works anyway. So, I just restored the beginning part of the initial version. Of course, what resulted from it is far from perfection and improvements are welcome. --Fedja 12:45, 20 June 2006 (EDT)
