Jump to content

X mod n

From Hackerpedia

Languages: English | Français

X mod n

The unique remainder r, 0£ r £ (n – 1), when integer x is divided by positive integer n. For example, 23 mod 7 = 2.


Source: NIST SP 800-106 | Category: