How do you verify a statement like $a \equiv b \pmod{n}$ in this video?

Modular arithmetic is a system of arithmetic for integers in which values wrap around after reaching a certain value called the modulus. The video introduces this concept as central to cryptography.

Conditions: Applies to integers.; A modulus value is needed to define the wrap-around behavior.

In this clip, the modulus is the specific value at which the integer system wraps around and restarts. It acts as the boundary for the cyclic arithmetic.

Conditions: Used within modular arithmetic.; The exact formal notation for modulus is not introduced in this clip.

Because adding the modulus 12 to -2 gives 10 ($-2 + 12 = 10$). This means -2 and 10 represent the same residue class modulo 12.

Conditions: Work modulo 12.; Allow negative representatives.

No, the numerical demonstration using specific numbers like 10, 7, and 13 is merely an illustrative example, not a rigorous formal proof applicable to all integers.

Conditions: The demonstration uses specific numerical values.; A formal proof would require generalizing the property for all integers.

The reflexive property is demonstrated by showing that any number is related to itself, specifically that 10 mod 3 is equal to 10 mod 3.

Conditions: The relation is defined as equality of remainders modulo 3.; The property requires every element to be related to itself.