(a) Let a, b, and c be integers and x≡ y (mod m). Prove that ax2 + bx + c ≡ ay2 + by + c (mod m).
(b) Show that the result in part (a) may be false if a, b, and c are not all integers, even if ax2 + bx + c and ay2 + by + c are both integers.
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.