Determine necessary and sufficient conditions on x and c so that the following holds: for any a, b, if ax ≡ bx mod c, then a ≡ b mod c.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.