Modular equation: Difference between revisions
Jump to navigation
Jump to search
(Created page with "A relation which has the form <code>expression EQUIV expression MOD expression</code>. The modulus will be automatically applied on any integers in the equation wh...") |
mNo edit summary |
||
| Line 1: | Line 1: | ||
A relation which has the form <code>[[expression]] EQUIV [[expression]] | A relation which has the form <code>[[expression]] EQUIV [[expression]] ("mod" [[expression]])</code>. The modulus will be automatically applied whenever the equation changes, depending on the type of the modulus: | ||
* Positive integer modulus: Any integers in the equation will be reduced to a remainder smaller than the modulus | |||
* Symbolic modulus (single symbol): Any occurrence of the modulus in the equation will be replaced by 0 | |||
The brackets around <code>"mod"</code> can be omitted. | |||
[[Category:Element]] | [[Category:Element]] | ||
Latest revision as of 20:33, 4 January 2018
A relation which has the form expression EQUIV expression ("mod" expression). The modulus will be automatically applied whenever the equation changes, depending on the type of the modulus:
- Positive integer modulus: Any integers in the equation will be reduced to a remainder smaller than the modulus
- Symbolic modulus (single symbol): Any occurrence of the modulus in the equation will be replaced by 0
The brackets around "mod" can be omitted.