Talk:GCD is Smallest Positive Integer Combination

I'll come back to it this weekend if someone doesn't before, but this page seems to need some serious proofreading. I could of course be wrong, I'm still recovering from being sick for a while and may not be entirely with it. --Cynic 23:02, 19 June 2008 (UTC)

$= a\times(qs) + b\times(qt)$ should be $= a\times(1-qs) + b\times(qt)$ right? well ordering principle issue removed, due to my inability to read late at night, no problems there --Cynic 01:03, 28 June 2008 (UTC)

As you see I've rewritten, renamed and restructured this page. Note:

• Renaming was needed anyway to bring it into line with the standard capitalization scheme.
• I've referred to the "linear combination" as "integer combination" elsewhere. I appreciate that "linear combination" is probably a "better name" as it distinguishes it from "quadratic combination" etc. so we may want to revisit this.
• As I've already defined GCD and Integer Combination, I've referenced these results and definitions etc. (and several more).
• I've amplified some points, in particular the question of negative $a$ and $b$.

I've kept the initial page you wrote inside this new page but commented out. Feel free to reinstate any of this instead of what I put. --Matt Westwood 07:18, 12 October 2008 (UTC)