Question: Prove that if a and b are any positive integers such that a | b, then (x mod b) mod a = x mod a
Prove that if a and b are any positive integers such that a | b, then (x mod b) mod a = x mod a for any x. Prove, under the same assumptions, that x = y (mod b) implies x = y (mod a) for any integers x and y.
Step by Step Solution
3.27 Rating (165 Votes )
There are 3 Steps involved in it
Given that a and b are any positive integers such that a b we must show that x mod b mod a x mod a for any x Recall that x mod a is the remainder of x ... View full answer
Get step-by-step solutions from verified subject matter experts
