Scribd
Upload
8 views1 page

Statement of The Theorem: Unique Absolute Value

Given two integers a and b where b ≠ 0, there exist unique integers q and r such that a = bq + r and 0 ≤ r < |b|. This theorem, known as the division algorithm, states that any integer a can be divided into b some number of times q with some remainder r less than the absolute value of b. The division algorithm provides a simple way to compute the quotient q and remainder r from the dividend a and divisor b, though it is technically a theorem rather than an algorithm. Division is undefined if the divisor b equals 0.

Uploaded by

Hazel Clemente Carreon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views1 page

Statement of The Theorem: Unique Absolute Value

Given two integers a and b where b ≠ 0, there exist unique integers q and r such that a = bq + r and 0 ≤ r < |b|. This theorem, known as the division algorithm, states that any integer a can be divided into b some number of times q with some remainder r less than the absolute value of b. The division algorithm provides a simple way to compute the quotient q and remainder r from the dividend a and divisor b, though it is technically a theorem rather than an algorithm. Division is undefined if the divisor b equals 0.

Uploaded by

Hazel Clemente Carreon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

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.[1]
The four integers that appear in this theorem have been given names: 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. The theorem is frequently referred to as
the division algorithm, although it is a theorem and not an algorithm, because its proof as given
below also provides a simple division algorithm for computing q and r.
Division is not defined in the case where b = 0; see division by zero.

You might also like