Modulo

a≡b(mod⁡n)⇔a−b=qn,where q∈ℤa \equiv b \pmod{n} \iff a - b = qn, \quad \text{where } q \in \mathbb{Z}

(amod⁡n)+(bmod⁡n)≡(a+b)mod⁡n(a \bmod n) + (b \bmod n) \equiv (a + b) \bmod{n}

(amod⁡n)⋅(bmod⁡n)≡(a⋅b)mod⁡n(a \bmod n) \cdot (b \bmod n) \equiv (a \cdot b) \bmod{n}

Addition and multiplication table

E.g. for integers modulo 4

Common questions

Standard cycle method

Find the last digit of 79999.

Not coprime factors

Find the last digit of 89999.

Operator closure

Set S is closed under △⇔∀x,y∈S,x△y∈S\text{Set } S \text{ is closed under } \triangle \iff \forall x, y \in S, \; x \triangle y \in S

Examples

Let S be the set of odd integers and △ be the multiplication. Is S closed under △?

Let S be the set of irrational numbers and △ be the addition. Is S closed under △?