AngouriMath

Navigation

← Back to list of members

#ctor​(AngouriMath.​Entity,​AngouriMath.​Entity,​AngouriMath.​Entity)

 Method (no overloads)

Summary

The statement that a and b are congruent modulo n: written
a = b (mod n), or a ≡ b (mod n), and meaning n divides a - b. A
relation between integers with the modulus written once at the end, as mathematics
writes it — not the remainder operator a mod n, which is a number, and which the
reference this follows refuses to write in this sense at all. The modulus may be any
integer: modulo 0 it is equality, and its sign is immaterial, exactly as in
n divides a - b. A statement about integers: NaN elsewhere.
https://github.com/asc-community/AngouriMath/issues/1409

























Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 5057 pages online