Exact quotient and remainder
Enter two decimal integers to calculate a quotient q and remainder r satisfying dividend = divisor × q + r. BigInt arithmetic keeps every digit exact, even beyond ordinary JavaScript number precision.
Choose the negative-number convention
Truncating division rounds the quotient toward zero; the remainder has the dividend's sign or is zero. For -17 divided by 5, q = -3 and r = -2. Euclidean division instead guarantees 0 ≤ r < |divisor|, giving q = -4 and r = 3. Both modes allow negative divisors.
Input limits and privacy
Each value may contain up to 1,000 decimal digits and an optional sign. Leading zeros and surrounding whitespace are accepted. Fractions, separators and a zero divisor are rejected. Processing happens locally in your browser.