Talk:Euclidean algorithm: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

26 September 2007

25 May 2007

14 May 2007

  • curprev 07:5507:55, 14 May 2007‎ imported>Catherine Woodgold‎ 4,172 bytes +1,651‎ You never get to where both the numbers are zero.

13 May 2007

  • curprev 18:5518:55, 13 May 2007‎ imported>Michael Hardy‎ 3,872 bytes +268‎ No edit summary
  • curprev 18:2218:22, 13 May 2007‎ imported>Catherine Woodgold‎ 3,604 bytes +1,083‎ A way of proving it.
  • curprev 17:3217:32, 13 May 2007‎ imported>Michael Hardy‎ 2,521 bytes +2,521‎ considering alternative......
  • curprev 08:4308:43, 13 May 2007‎ imported>Catherine Woodgold‎ 2,225 bytes +2,225‎ Adding to my comment
  • curprev 08:3608:36, 13 May 2007‎ imported>Catherine Woodgold‎ 1,195 bytes +1,195‎ Whether 0 is a positive integer, and whether the last number must be the gcd; and need checklist template.
Retrieved from "https://citizendium.org/wiki/Talk:Euclidean_algorithm"