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

Revision as of 14:54, 8 May 2009

Revision as of 15:58, 8 May 2009

Line 195:

* More to come. Good work thus far. --'''[[User:Cryptic C62|Cryptic C62]] · [[User talk: Cryptic C62|Talk]]''' 19:59, 3 May 2009 (UTC)

:::Thank you very much for your careful reviewing! The article is definitely improving. [[User:Proteins|Proteins]] ([[User talk:Proteins|talk]]) 10:32, 4 May 2009 (UTC)

'''Comments'''

:1) The spacing convention is not followed consistently through out. (e.g. 252 = 21 × 12 (with space) but 35 = 5×7 (without space), k=0 (with no space))

:2) "Thus, Euclid's algorithm, which computes the GCD of two integers, suffices to calculate the GCD of an arbitrary number of integers."

::Can it calculate the GCD of a countable infinite set of integers? An uncountable one? Be specific.

:3) "The latter argument is used to show that the Euclidean algorithm for natural numbers must end in a finite number of steps."

::Citation needed.

:4) Redundant phrase (found a lot at the beginning of paragraphs):

;;"the Euclidean algorithm is an efficient method for computing the greatest common divisor (GCD)"

;;"The Euclidean algorithm calculates the greatest common divisor (GCD) of two natural numbers a and b."

::"Euclid's algorithm, which computes the GCD of two integers"

:: "The Euclidean algorithm finds the greatest common divisor g of two numbers a and b in a series of steps."

[[Special:Contributions/131.111.216.15|131.111.216.15]] ([[User talk:131.111.216.15|talk]]) 15:58, 8 May 2009 (UTC)