2.7 Remainder Arithmetic

Remainder arithmetic, also known as modular arithmetic, deals with integers under division by a fixed number (the modulus). It is commonly used in number theory and cryptography.

Key Concepts:

Example 1: Verify if \(17 \equiv 5 \,(\text{mod } 6)\).

Solution:

Check if \(17 - 5\) is divisible by 6: \[ 17 - 5 = 12. \] Since \(12\) is divisible by \(6\), we conclude: \[ 17 \equiv 5 \,(\text{mod } 6). \]

Example 2: Compute \((7 + 10) \,(\text{mod } 5)\).

Solution:

Add the numbers: \[ 7 + 10 = 17. \] Find the remainder when \(17\) is divided by \(5\): \[ 17 \div 5 = 3 \text{ remainder } 2. \] Therefore: \[ (7 + 10) \,(\text{mod } 5) = 2. \]

Example 3: Compute \((9 \cdot 8) \,(\text{mod } 7)\).

Solution:

Multiply the numbers: \[ 9 \cdot 8 = 72. \] Find the remainder when \(72\) is divided by \(7\): \[ 72 \div 7 = 10 \text{ remainder } 2. \] Therefore: \[ (9 \cdot 8) \,(\text{mod } 7) = 2. \]

Example 4: Compute \(3^4 \,(\text{mod } 5)\).

Solution:

Calculate the power: \[ 3^4 = 81. \] Find the remainder when \(81\) is divided by \(5\): \[ 81 \div 5 = 16 \text{ remainder } 1. \] Therefore: \[ 3^4 \,(\text{mod } 5) = 1. \]

Example 5: Multiplication Table Modulo \(4\).

Solution:

Construct the table for integers \(0, 1, 2, 3\) modulo \(4\): \[ \begin{array}{c|cccc} \cdot \,(\text{mod } 4) & 0 & 1 & 2 & 3 \\\\ \hline 0 & 0 & 0 & 0 & 0 \\\\ 1 & 0 & 1 & 2 & 3 \\\\ 2 & 0 & 2 & 0 & 2 \\\\ 3 & 0 & 3 & 2 & 1 \\\\ \end{array} \] This table shows the results of multiplication under modulo \(4\).

Section 2: Algebra Chapters

← Back to Study Guide