modp

Gets remainder of x/y with +ve sign (euclidean division). 🏃 [:vhs:] 📦 🌔 📒

Similar: [rem], [mod], [modp].

bigint.modp(x, y);
// x: dividend
// y: divisor

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

bigint.modp(1n, 10n);
// 1n

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

bigint.modp(1n, -10n);
// 1n

references

• Modulo operation