Difference between revisions of "Division Algorithm"

(New page: For any positive integer a and integer b, there exist unique integers q and r such that b = qa + r and 0 <= r < a, with r = 0 iff a | b.)
 
(LaTeX,, stub)
Line 1: Line 1:
For any positive integer a and integer b, there exist unique integers q and r such that b = qa + r and 0 <= r < a, with r = 0 iff a | b.
+
For any positive integer <math>a</math> and integer <math>b</math>, there exist unique integers <math>q</math> and <math>r</math> such that <math>b = qa + r</math> and <math>0 \le r < a</math>, with <math>r = 0</math> iff <math>a \mid b</math>.
 +
 
 +
{{stub}}

Revision as of 20:22, 3 July 2008

For any positive integer $a$ and integer $b$, there exist unique integers $q$ and $r$ such that $b = qa + r$ and $0 \le r < a$, with $r = 0$ iff $a \mid b$.

This article is a stub. Help us out by expanding it.