Exercise · ZW-MODULAR-CONGRUENCE-002 · ★☆☆ Basic
Compute \(53\bmod8\).
Choose one option.
Show answer
- C. 5
Explanation
\(53=6\cdot8+5\), so the remainder is 5.
Review the concept: Modular congruence
Two integers \(a\) and \(b\) are congruent modulo a positive integer \(m\) if \(m\) divides their difference; equivalently, they leave the same remainder when divided by \(m\).
\[a\equiv b\pmod m\iff m\mid(a-b)\]
More practice problems: modular congruence
- ZW-MODULAR-CONGRUENCE-001 Which of the following congruences is true?
- ZW-MODULAR-CONGRUENCE-003 What is -7bmod5?
- ZW-MODULAR-CONGRUENCE-004 Compute (17+25)bmod6.
- ZW-MODULAR-CONGRUENCE-005 Compute 3^4bmod5.
- ZW-MODULAR-CONGRUENCE-006 Compute 2^10bmod7.
- ZW-MODULAR-CONGRUENCE-007 Solve 3x≡4pmod7 with 0≤ x≤6.
- ZW-MODULAR-CONGRUENCE-008 What is the last digit of 7^2026?
- ZW-MODULAR-CONGRUENCE-009 If a≡ b and c≡ dpmod m, which statement does NOT always hold?