Mathematics · pattern A, Numeric fields
Enter a dividend and divisor for the whole-number quotient, the remainder, the decimal result and the multiplication that verifies it.
dividend = divisor × quotient + remainder
The remainder is always smaller than the divisor. That identity is the check on any division and the definition the algorithm rests on.
198
Any integer division can be written as dividend = divisor × quotient + remainder with the remainder smaller than the divisor. Checking that identity catches every slip in a long division, and it is the same statement underlying modular arithmetic and Euclid's algorithm.
If the number is not the part you are stuck on, that is what the service is for — a specialist who explains the working, not just the answer.
Arithmetic runs in double-precision floating point, so results beyond about fifteen significant figures are not exact. Where a question wants an exact fraction or surd, keep the exact form rather than a decimal.