Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: Division Algorithm Proof
Replies: 5   Last Post: Aug 16, 1999 4:29 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Jon Haugsand

Posts: 26
Registered: 12/12/04
Re: Division Algorithm Proof
Posted: Aug 16, 1999 3:32 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply



* Randy Ades
> Does anyone know a proof of the following algorithm(Division Algorithm):
>
> Let a and b be integers with b > 0. Then there exist unique integers q
> and r with the property that
>
> a = b*q + r, where r >= 0 and r < b.


Hint: Look at the set

S = {a-b*t | a-b*t non-negative and t integer }

Prove S is non-empty. From there take the smallest element of S...

Uniqueness: Assume b*q' + r' = b*q + r, then
r' - r = b * (q - q') and |r' - r| < b, and so on.

--
Jon Haugsand
Norwegian Computing Center,
<mailto://haugsand@nr.no> Pho: +47 22852608 / +47 22852500,
Fax: +47 22697660, Pb 114 Blindern, N-0314 OSLO, Norway







Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.