p. 1

division with remainders division with remainders the euclidean division is the usual process of division of integers producing a quotient and a remainder it can be specified precisely by a theorem stating that these exist uniquely with given properties an integer division algorithm is any effective method for realizing this division using the decimal notation of integers or any other positional notation long division provides a fairly efficient division algorithm and other algorithms exist as well the integer division algorithm is an important ingredient for other algorithms such as the euclidean algorithm for finding the greatest common divisor of two integers.the integral domains to which the euclidean division may be generalized with similar properties are called euclidean domains they include polynomial rings in one variable over a field and gaussian integers statement of the theorem given two integers a and b with b 0 there exist unique integers q and r such that a bq r and 0 r |b where |b denotes the absolute value of b the four integers that appear in this theorem have been given a name a is called the dividend b is called the divisor q is called the quotient and r is called the remainder the computation of the quotient and the remainder from the dividend and the divisor is called division or in case of ambiguity euclidean division division in which the fractional remainder is discarded is called integer division and is sometimes denoted using a backslash know more about permutation vs combination math.edurite.com page 1/3

[close]

p. 2

proof the proof consists of two parts first the proof of the existence of q and r and second the proof of the uniqueness of q and r existence consider first the case b 0 setting b -b and q -q the equation a bq r may be rewritten a b q r and the inequality 0 r |b may be rewritten 0 r |b this reduces the existence for the case b 0 to that of the case b 0 similarly if a 0 and b 0 setting a -a q -q 1 and r b r the equation a bq r may be rewritten a bq r and the inequality 0 r b may be rewritten 0 r b thus the proof of the existence is reduced to the case a 0 and b 0 and we consider only this case in the remainder of the proof let q1 and r1 both nonnegative such that a bq1 r1 for example q1 0 and r1 a if r1 b we are done otherwise q2 q1 1 and r2 r1 b satisfy a bq2 r2 and 0 r2 r1 repeating this process one gets eventually q qk and r rk such that a bq r and 0 r b this proves the existence and also gives an algorithm to compute the quotient and the remainder however this algorithm needs q steps and is thus not efficient uniqueness suppose there exists q q r r with 0 r r |b such that a bq r and a bq r adding the two inequalities 0 r |b and b -r 0 yelds b r r |b that is |r r |b subtracting the two equations yields bq q r r thus |b divides |r r if |r r 0 this implies |b |r r contradicting previous inequality thus r r and bq q 0 as b 0 this implies q q proving uniqueness effectiveness usually a existence proof does not provide an algorithm to compute the existing object but the above proof provides immediately an algorithm however this is not a very efficient method as it requires as many steps as the size of the quotient this is related to the fact that it only uses addition subtraction and comparison of the integers without involving multiplication nor any particular representation of the integers such as decimal notation.in terms of decimal notation long division provides a much more efficient division algorithm its generalization to binary notation allows to use it in a computer however algorithms that reduce division to multiplication like newton­raphson one are usually preferred because they need a time which is proportional to the time of the multiplication needed to verify the result independently of the multiplication algorithm which is used read more about matrice math.edurite.com page 2/3

[close]

p. 3

thank you math.edurite.com

[close]