Logo

Programming-Idioms

# 359 Euclidean division
Set q and r to the quotient and the remainder of the integer a divided by the integer b, such that a = b * q + r.

a is the dividend, b is the divisor.

E.g. a=31, b=7 ⟶ q=4, r=3
New implementation

Type ahead, or select one

Explain stuff

To emphasize a name: _x → x

Please be fair if you are using someone's work

You agree to publish under the CC-BY-SA License

Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating material.

Please try to avoid dependencies to third-party libraries and frameworks.

Other implementations 
import "math/big"
q := new(big.Int)
r := new(big.Int)
q.DivMod(a, b, r)

a, b, q, r have type *big.Int

Preview