A community for students.
Here's the question you clicked on:
← 55 members online
 0 viewing
anonymous
 one year ago
We say that a solution n of a congruence is unique modulo c if any solution n' of it is congruent to n modulo c. Can you give me an example?
anonymous
 one year ago
We say that a solution n of a congruence is unique modulo c if any solution n' of it is congruent to n modulo c. Can you give me an example?

This Question is Closed

zzr0ck3r
 one year ago
Best ResponseYou've already chosen the best response.0\(3x\equiv1(\text{mod }11)\) in \(\mathbb{Z}_{11}\)

zzr0ck3r
 one year ago
Best ResponseYou've already chosen the best response.0only solution is \(4\), but if we change to \(\mathbb{Z}\) there are infinite solutions.

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0all solutions are x = 4 + 11k, right?

zzr0ck3r
 one year ago
Best ResponseYou've already chosen the best response.0\(3(4+11k)1=12+33k1=11+33k=11(3k+1)\) yep
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.