Find all integers that satisfy the linear congruence above
Your answer can be written as , where and are positive primes . Submit it as .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
4 x + 2 0 ≡ 2 7 x − 1 mod 5 is equal to 2 3 x − 2 1 ≡ 0 mod 5 . The last means 2 3 x − 2 1 = 5 n .
A number is divisible by 5 if its last digit is 0 or 5 . So, the last digit of 2 3 x minus 1 must be 0 or 5 .
The last digit of 2 3 x only could be 1 or 6 . So the last digit of x must be 7 or 2 . Therefore x ≡ 2 mod 5