A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
Prove that if a≡b mod n and c≡d mod n then a−c≡b−d mod n??
anonymous
 4 years ago
Prove that if a≡b mod n and c≡d mod n then a−c≡b−d mod n??

This Question is Closed

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0u start like a=kn + b........

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0\(a≡b \pmod n \implies a=n.k+b \) where \( k\in \mathbb{N} \) \(c≡d \pmod n \implies c=n.p+d \) where \( p\in \mathbb{N} \) \(ac = nk+bnpd = n(kp) +(bd)\), where \( (kp)\in \mathbb{N} \). Hence \((a−c)≡(b−d) \pmod n \) QED!

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0c= pn+d ac=n(kp)+bd :P......m late

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Similarly we can show that \( (a+c)≡(b+d) \pmod n \) and more generally \( (pa+qc)≡(pb+qd) \pmod n \)

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so basically we need to show that difference between a and c will be a multiple of n
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.