Division Algorithms



 

\begin{array}{l} Let\;\;\;\;a,b \in Z\;\;\;\;,\;\;\;\;b \in N\\ Then\;there\;exist\;unique\;\;\;\;\;q,r \in Z\;\;\;\;such\;that\\ a = qb + r\;\;\;\;\;\;\;\;,\;\;0 \le r < b\\ q:\;is\;called\;the\;quotient\\ r:\;is\;called\;the\;remainder \end{array}

Post a Comment

Please Select Embedded Mode To Show The Comment System.*

Previous Post Next Post