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

Revision as of 10:06, 5 May 2009

Revision as of 10:10, 5 May 2009

Line 128:

**::I'm not familiar with how to convert a series of images into an animation, but I'd be willing to make the images (or at least try). If I make them, can you make the animation? --'''[[User:Cryptic C62|Cryptic C62]] · [[User talk: Cryptic C62|Talk]]''' 18:52, 4 May 2009 (UTC)

**"The greatest common divisor is often written as GCD(a, b) or, more simply, as (a, b)." Yes, the second version is simpler, but that notation is also used for ''lots'' of other things in mathematics. What (a, b) represents depends on the context of the problem, and I think it would be wise to mention this so as not to mislead our less mathematically-inclined readers.

:::Mentioned ambiguity of "(''a'', ''b'')" notation, and swapped order of last two sentences in paragraph for better flow. [[User:Proteins|Proteins]] ([[User talk:Proteins|talk]]) 10:10, 5 May 2009 (UTC)

**"neither 6 = 2×3 nor 35 = 5×7 is a prime number, since they both have two prime factors" I think it may be a tad confusing to include the prime factorization at first; perhaps this should be added later: "neither 6 nor 35 is a prime number, since they both have two prime factors: 6 = 2x3 and 35 = 5x7." or something like that. Also, shouldn't it be "neither 6 nor 35 '''are''' prime number'''s'''" ?

**:Excellent suggestion for the rewording. [[User:Proteins|Proteins]] ([[User talk:Proteins|talk]]) 09:59, 4 May 2009 (UTC)