2. Prove that if a = b( mod r) and c = d( mod r) then a – c= b – d( mod r)

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.5: Congruence Of Integers
Problem 35E
icon
Related questions
Question
2. Prove that if a = b( mod r) and c = d( mod r) then a –c = b – d( mod r)
Transcribed Image Text:2. Prove that if a = b( mod r) and c = d( mod r) then a –c = b – d( mod r)
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer