Exercise · ZW-LINEAR-CONGRUENCE-010 · ★★★ Advanced
Find all solutions of \(6x \equiv 9 \pmod{15}\) modulo 15.
Choose one option.
Show answer
- B. {4, 9, 14}
Exercise · ZW-LINEAR-CONGRUENCE-010 · ★★★ Advanced
Choose one option.
Since \(\gcd(6,15)=3\) divides 9, there are three solutions. Dividing by 3 gives \(2x\equiv 3\pmod{5}\), whose inverse of 2 is 3, yielding \(x\equiv 4\pmod 5\), so the solutions are 4, 9 and 14.
A linear congruence is a first-degree congruence in one unknown \(x\), with integer coefficients \(a\), \(b\) and modulus \(m\); its solutions are the integers \(x\) that satisfy it.