Jump to content

X mod n

From Hackerpedia

Revision as of 02:53, 15 January 2026 by imported>Unknown user

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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:

Retrieved from "https://hackerpedia.org/index.php?title=X_mod_n&oldid=14334"

Cybersecurity