Abstract Algebra: Theory and Applications · Problem 38

Polynomials — Thomas Judson

Mathematics — Abstract Algebra · linear-congruences

Problem

Let gcd⁡(a,n)=d\gcd(a, n) = d and gcd⁡(b,d)≠1\gcd(b, d) \neq 1. Prove that ax≡b(modn)ax \equiv b \pmod{n} does not have a solution.

Related theory

Browse the problem library