Ask a New Question

Question

prove the euclid division
given and int j and k>0 then one can find a unique pair (q,r) of int state j=q*k +r and 0<r<k
13 years ago

Answers

MathMate
This is a classical but rather lengthy proof that requires mathematical induction in three different cases.
One example proof can be found at:

http://www.proofwiki.org/wiki/Division_Algorithm

Post if you have further questions.
13 years ago

Related Questions

By using Euclid geometry prove that the line segment has only on end point What is Euclid known for? what was Euclid's contribution to mathematics that's still in use today? What was Euclid’s contribution to mathematics that’s still in use today?(1 point) Responses his text... What was Euclid’s contribution to mathematics that’s still in use today?(1 point) Responses his... What was Euclid’s contribution to mathematics that’s still in use today?(1 point) Responses his... What was Euclid’s contribution to mathematics that’s still in use today?(1 point) Responses his... What was Euclid’s contribution to mathematics that’s still in use today?(1 point) Responses his... What was Euclid’s contribution to mathematics that’s still in use today? What was Euclid’s contribution to mathematics that’s still in use today?(1 point) Responses his...
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use