Question

Difficulty: EasyModular Arithmetic

Determine the least non-negative integer congruent to 68(mod9)68 \pmod{9}.

Answer: 5

Answer

The least non-negative integer congruent to 68(mod9)68 \pmod{9} is 5.
Dividing 68 by 9 gives a quotient of 7 and a remainder of 5. Since 05<90 \le 5 < 9, the value 5 is the standard non-negative remainder.

Step-by-Step Solution

1
Divide 68 by the modulus 9 using the division algorithm.
68=9×7+568 = 9 \times 7 + 5
Every integer aa can be written uniquely as a=nq+ra = nq + r where qq is the quotient and 0r<n0 \le r < n.
2
Extract the non-negative remainder rr.
r=5r = 5
In modular arithmetic, the least non-negative integer congruent to a(modn)a \pmod{n} is the remainder rr when aa is divided by nn.

Key Concept

Modular Arithmetic Remainder
Rate this question