Exercise · ZW-LINEAR-CONGRUENCE-009 · ★★☆ Intermediate

Solve \(4x \equiv 2 \pmod{10}\). What is the set of solutions modulo 10?

Choose one option.

Show answer
  • C. {3, 8}

Explanation

Since \(\gcd(4,10)=2\) divides 2, there are two solutions. Dividing by 2 gives \(2x\equiv 1\pmod{5}\), so \(x\equiv 3\pmod{5}\), and the solutions modulo 10 are 3 and 8.

Study Elementary number theory in ZWMath →

Review the concept: Linear congruence

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.

\[ax \equiv b \pmod{m}\]

More practice problems: linear congruence

← ZW-LINEAR-CONGRUENCE-008 ZW-LINEAR-CONGRUENCE-010 →