Congruence Question

Watch
Announcements
#1
777x ≡ 1312 (mod 2021).
In each case, express your answer in the form x ≡ a (mod n) with
0 ≤ a < n.

I have no idea how to tackle this question, maybe x ≡ 1312/777 (mod 2021)?
0
6 months ago
#2
basically find the multiplicative inverse $k$, that is the number such that , so which has a solution by Bezouts identity as . once you've found k, just multiply your congruence by k on both sides and you'll end up with , calculate 1312k and reduce that modulo 2021
Last edited by ish101; 6 months ago
0
6 months ago
#3
(Original post by SuprDooprPoopr)
777x ≡ 1312 (mod 2021).
In each case, express your answer in the form x ≡ a (mod n) with
0 ≤ a < n.

I have no idea how to tackle this question, maybe x ≡ 1312/777 (mod 2021)?
Can you explain why it is that you're attempting a question you have no idea how to tackle? What is it you're studying?
0
#4
(Original post by DFranklin)
Can you explain why it is that you're attempting a question you have no idea how to tackle? What is it you're studying?
nah I know how to do it, I was being silly.
0
X

new posts
Back
to top
Latest
My Feed

Oops, nobody has postedin the last few hours.

Why not re-start the conversation?

see more

See more of what you like onThe Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

Poll

Join the discussion

Are you tempted to change your firm university choice on A-level results day?

Yes, I'll try and go to a uni higher up the league tables (7)
50%
Yes, there is a uni that I prefer and I'll fit in better (1)
7.14%
No I am happy with my choice (6)
42.86%
I'm using Clearing when I have my exam results (0)
0%