modp

Find the remainder of x/y with +ve sign (euclidean division).

Similar: rem, mod, modp.

function modp(x, y)
// x: dividend
// y: divisor

const xbigint = require('extra-bigint');


xbigint.modp(1n, 10n);
// → 1n

xbigint.modp(-1n, 10n);
// → 9n

xbigint.modp(1n, -10n);
// → 1n

References

• Modulo operation: Wikipedia