Talk:Division algorithm

From Wikipedia, the free encyclopedia

[edit] Algorithm vs. Theorem

Although the "Division Algorithm" is a theorem, it is so called because of its algorithmic nature. In fact, you can prove it using an algorithm: if you build a q and a r, such that a = q * b + r , then the existence part is proved.

Other question: how do you use the division algorithm to find the GCD of two integers? I know Euclid's Theorem, but it is different, right? joaoferreira

The title say Algorithm, while the article is proving a property about the natural numbers. Thue 21:41, 25 May 2004 (UTC)

Yes, it's a misnomer. I've noted this in the article. — Matt 11:54, 28 May 2004 (UTC)

The major edit was me. I was logged on so long, it logged me out. Oh, well. Revolver 04:18, 13 Jul 2004 (UTC)

[edit] Uniqueness?

So, what is unique about Division Algorithm? I would really like to know this because I'm taking Mini University Courses at the University of Ottawa, and I would like to know more about the subject that I'm learning

[edit] S is nonempty

"We claim that S contains at least one nonnegative integer . . .."

But we haven't proved that S is nonempty!

---