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

1 Expert Approved Answer
Step: 1 Unlock

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

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction to Algorithms Questions!