What is modular arithmetic according to this introductory lecture?

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.

To verify $a \equiv b \pmod{n}$, divide $a$ by the modulus $n$ using long division and check if the remainder is $b$. If the remainder matches $b$, the congruence is valid.

Conditions: The method is demonstrated for positive dividends and positive moduli.; The speaker calls it a colloquial explanation.

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.