Revision as of 01:18, 30 April 2009 edit Wadewitz (talk \| contribs) 50,892 edits →Euclidean algorithm: supporting the lead ← Previous edit		Revision as of 01:40, 30 April 2009 edit undo C S (talk \| contribs) Pending changes reviewers 8,453 edits c to awadewit Next edit →
Line 91: '''Support the lead''' - I have a very hard time reading mathematics articles. I tried very hard to understand this, but I kept getting lost. I understood the lead, but after that, not much. I'm too verbal, I suppose. (Even the diagrams slightly confused me. I was like, "why are there 10 squares?") Anyway, the lead makes sense to idiots such as myself. [[User:Awadewit\|Awadewit]] ([[User talk:Awadewit\|talk]]) 01:18, 30 April 2009 (UTC) *Perhaps the 10 square example could be improved. It's not important the exact numbers that are being used there. The basic idea is that the gcd of two numbers is the largest length which can be used as a unit for both numbers. So for the two numbers illustrated by the 10 square picture, the gcd fits in one number twice and fits in the other number 5 times. This is illustrated by the 5 x 2 grid. There is no way to tile that rectangle with a bigger square. --[[User:C S\|C S]] ([[User talk:C S\|talk]]) 01:40, 30 April 2009 (UTC)

Wikipedia:Featured article candidates/Euclidean algorithm/archive1: Difference between revisions