Remainder

From Simple English Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In arithmetic, the result of the division of two integers usually cannot be expressed with an integer quotient, unless a remainder—a amount "left over" after the division—is also accepted.

The remainder for natural numbers[change | change source]

Given a natural number a and a non-zero natural number d, it can be shown that there exist unique integers q and r, such that a = qd + r and 0 ≤ r < d. The number q is called the quotient, while r is called the remainder.[1][2]

Examples[change | change source]

  • When dividing 13 by 10, 1 is the quotient and 3 is the remainder, since 13=1×10+3.
  • When dividing 26 by 4, 6 is the quotient and 2 is the remainder, since 26=6×4+2.
  • When dividing 56 by 7, 8 is the quotient and 0 is the remainder, since 56=8×7+0.
  • When dividing 9 by 10, 0 is the quotient and 9 is the remainder, since 9=0×10+9.

The case of general integers[change | change source]

If a and d are integers with d being non-zero, then a remainder is an integer r such that a = qd + r for some integer q, and with 0 ≤ |r| < |d|.

When defined this way, there are two possible remainders. For example, the division of -42 by -5 can be expressed as either

-42 = 9 ×(-5) + 3

or

-42 = 8 ×(-5) + (-2).

So the remainder is then either 3 or -2.

This ambiguity in the value of the remainder is not very serious; in the case above, the negative remainder is obtained from the positive one just by subtracting 5, which is d. This holds in general. When dividing by d, if the positive remainder is r1, and the negative one is r2, then

r1 = r2 + d.

The remainder for real numbers[change | change source]

When a and d are real numbers, with d being non-zero, then a can be divided by d without remainder, with the quotient being another real number. If the quotient is constrained to being an integer, however, the concept of remainder is still necessary. It can be proved that there exists a unique integer quotient q and a unique real remainder r such that a=qd+r with 0≤r < |d|. Similar to the case of division of integers, the remainder could be required to be negative, that is, -|d| < r ≤ 0.

Extending the definition of remainder for real numbers, as described above, is not of theoretical importance in mathematics; however, many programming languages implement this definition—see modulo operation for more.

Related pages[change | change source]

References[change | change source]

  1. "The Definitive Higher Math Guide to Long Division and Its Variants — for Integers". Math Vault. 2019-02-24. Retrieved 2020-08-27.
  2. "The quotient remainder theorem (article) | Khan Academy". Khan Academy. Retrieved 2020-08-27.