  in mathematics, the remainder is the amount "left over" after performing some computation. in arithmetic, the remainder is the integer "left over" after dividing one integer by another to produce an integer quotient (integer division). in algebra, the remainder is the polynomial "left over" after dividing one polynomial by another. the modulo operation is the operation that produces such a remainder when given a dividend and divisor. formally it is also true that a remainder is what is left after subtracting one number from another, although this is more properly called the difference. this usage can be found in some elementary textbooks; colloquially it is replaced by the expression "the rest" as in "give me two dollars back and keep the rest." however, the term "remainder" is still used in this sense when a function is approximated by a series expansion and the error expression ("the rest") is referred to as the remainder term. ==integer division== if a and d are integers, with d non-zero, it can be proven that there exist unique integers q and r, such that a = qd&nbsp;+&nbsp;r and 0&nbsp;â¤&nbsp;r&nbsp;<&nbsp;|d|. the number q is called the quotient, while r is called the remainder. see euclidean division for a proof of this result and division algorithm for algorithms describing how to calculate the remainder. the remainder, as defined above, is called the least positive remainder or simply the remainder.. but if the remainder is 0, it is not positive, even though it is called a "positive remainder". the integer a is either a multiple of d or lies in the interval between consecutive multiples of d, namely, qâd and (q + 1)d (for positive q). at times it is convenient to carry out the division so that a is as close as possible to an integral multiple of d, that is, we can write :a = kâd + s, with |s| â¤ |d/2| for some integer k. in this case, s is called the least absolute remainder. as with the quotient and remainder, k and s are uniquely determined except in the case where d = 2n and s = Â± n. for this exception we have, : a = kâd + n = (k + 1)d - n. a unique remainder can be obtained in this case by some convention such as always taking the positive value of s. ==examples== in the division of 43 by 5 we have: : 43 = 8 &times; 5 + 3, so 3 is the least positive remainder. we also have, : 43 = 9 &times; 5 - 2, and &minus;2 is the least absolute remainder. these definitions are also valid 
Division_(mathematics) Number_theory