Talk:Euclidean algorithm: Difference between revisions
wotw |
update |
||
| Line 1: | Line 1: | ||
{{WotW|week=December 6-12|prevweek=[[Graph (graph theory)]]<br />[[Carl Friedrich Gauss]]|curweek=[[Euclidean algorithm]]<br />[[Euclid]]}} | {{WotW|week=December 6-12|prevweek=[[Graph (graph theory)]]<br />[[Carl Friedrich Gauss]]|curweek=[[Euclidean algorithm]]<br />[[Euclid]]|nextweek=[[Expected value]]<br />[[Recursion]]}} | ||
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) | ||
Revision as of 19:38, 17 January 2008
| AoPSWiki Words of the Week for December 6-12 | ||
| Previous week Graph (graph theory) Carl Friedrich Gauss |
Current week Euclidean algorithm Euclid |
Next week Expected value Recursion |
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)
