Difference between revisions of "Division Theorem"

m (Added Categories)
 
Line 1: Line 1:
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>
+
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}}
 
{{stub}}
 
[[Category:Mathematics]]
 
[[Category:Mathematics]]
 
[[Category:Theorems]]
 
[[Category:Theorems]]

Latest revision as of 14:37, 1 November 2024

For any positive integers $a$ and $b$, there exist unique integers $q$ and $r$ such that $b = qa + r$ and $0 \le r < a$, with $r = 0$ if $a | b.$ We call $a$ the dividend, $b$ the divisor, $q$ the quotient, and $r$ the remainder.

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