Wikipedia:Featured article candidates/Euclidean algorithm/archive1: Difference between revisions
Content deleted Content added
c to awadewit, is this better? |
→Euclidean algorithm: unencyclopedic language |
||
Line 98:
**Ok, so I rewrote the passage with the visualization example to say: <blockquote>Imagine a rectangular area a by b. Suppose d divides both a and b with no remainder. So we can divide the sides of the rectangle into some number of segments of length d and furthermore divide the rectangle into a grid consisting of squares of side length d. The greatest common divisor g equals the largest value of d for which this is possible. For illustration, a 24×60 rectangular area can be divided into a grid of: 1×1 squares, 2×2 squares, 3×3 squares, 6×6 squares or 12×12 squares. Thus, 12 is the greatest common divisor of 24 and 60.</blockquote> Is this an improvement? --[[User:C S|C S]] ([[User talk:C S|talk]]) 07:11, 30 April 2009 (UTC)
***I didn't follow the thread of edits, but talking to the reader ("imagine ...") and "we" should be avoided as unencyclopedic language. [[User:Jakob.scholbach|Jakob.scholbach]] ([[User talk:Jakob.scholbach|talk]]) 07:45, 30 April 2009 (UTC)
| |||