Difference between revisions of "Division Theorem"
(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.) |
Bunnyville (talk | contribs) |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
| − | For any positive | + | For any positive integers <math> a </math> and <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> if <math> a | b. </math> We call <math> a </math> the dividend, <math> b </math> the divisor, <math> q </math> the quotient, and <math> r </math> the remainder. |
| + | |||
| + | {{stub}} | ||
| + | [[Category:Mathematics]] | ||
| + | [[Category:Theorems]] | ||
Latest revision as of 14:37, 1 November 2024
For any positive integers 
and 
, there exist unique integers 
and 
such that 
and 
, with 
if 
We call the dividend, the divisor, the quotient, and the remainder.
This article is a stub. Help us out by expanding it.
